On the public citation graph

Pursuit-evasion in a graph

https://doi.org/10.1007/bfb0070400
0 signed · 398 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.22669openalex-snapshot
Connected search for a lazy robber
inferred← citeshttps://doi.org/10.1002/net.21460openalex-snapshot
Integer programming models and algorithms for the graph decontamination problem with mobile agents
inferred← citeshttps://doi.org/10.1002/net.21740openalex-snapshot
Branch‐cut‐price algorithms for solving a class of search problems on general graphs
inferred← citeshttps://doi.org/10.1002/net.70073openalex-snapshot
Shelters and Multiple Shots in a Hunters and Rabbit Game
inferred← citeshttps://doi.org/10.1006/inco.1994.1064openalex-snapshot
The Vertex Separation and Search Number of a Graph
inferred← citeshttps://doi.org/10.1006/jctb.1993.1027openalex-snapshot
Graph Searching and a Min-Max Theorem for Tree-Width
inferred← citeshttps://doi.org/10.1006/jctb.2000.2031openalex-snapshot
Directed Tree-Width
inferred← citeshttps://doi.org/10.1007/0-387-25036-0_8openalex-snapshot
Strategies for Searching Graphs
inferred← citeshttps://doi.org/10.1007/1-4020-3389-3openalex-snapshot
Multi-Robot Systems. From Swarms to Intelligent Automata Volume III
inferred← citeshttps://doi.org/10.1007/1-4020-3389-3_6openalex-snapshot
Parallel Stochastic Hill- Climbing with Small Teams
inferred← citeshttps://doi.org/10.1007/11682462_45openalex-snapshot
Connected Treewidth and Connected Graph Searching
inferred← citeshttps://doi.org/10.1007/11753728_58openalex-snapshot
Capturing an Intruder in the Pyramid
inferred← citeshttps://doi.org/10.1007/11780823_7openalex-snapshot
Distributed Chasing of Network Intruders by Mobile Agents
inferred← citeshttps://doi.org/10.1007/11832072_1openalex-snapshot
Edge Eavesdropping Games
inferred← citeshttps://doi.org/10.1007/11917496_21openalex-snapshot
Monotony Properties of Connected Visible Graph Searching
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_37openalex-snapshot
Computing Optimal Linear Layouts of Trees in Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-45449-7_24openalex-snapshot
Hierarchical Approach for Design of Multi-vehicle Multi-modal Embedded Software
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_77openalex-snapshot
Randomized Pursuit-Evasion in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_26openalex-snapshot
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-45873-5_23openalex-snapshot
Bisimulation Based Hierarchical System Architecture for Single-Agent Multi-modal Systems
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_38openalex-snapshot
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_50openalex-snapshot
Mixed-searching and proper-path-width
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_72openalex-snapshot
Searching a solid pseudo 3-sided orthoconvex grid
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_59openalex-snapshot
Fugitive-search games on graphs and related parameters
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_45openalex-snapshot
Visibility-based pursuit-evasion in a polygonal environment
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_32openalex-snapshot
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
inferred← citeshttps://doi.org/10.1007/978-0-8176-8355-9_18openalex-snapshot
A Nonzero-Sum Search Game with Two Competitive Searchers and a Target
inferred← citeshttps://doi.org/10.1007/978-1-4471-1580-9_9openalex-snapshot
Motion Planning with Visibility Constraints: Building Autonomous Observers
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_19openalex-snapshot
Network Decontamination
inferred← citeshttps://doi.org/10.1007/978-3-030-17402-6_17openalex-snapshot
Searching by Heterogeneous Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_6openalex-snapshot
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_12openalex-snapshot
Two-Agent Tree Evacuation
inferred← citeshttps://doi.org/10.1007/978-3-030-95519-9_8openalex-snapshot
Lions and Contamination, Triangular Grids, and Cheeger Constants
inferred← citeshttps://doi.org/10.1007/978-3-031-16078-3_20openalex-snapshot
A New Entrapment Based Invader Capture Strategy for Multi-robot Surveillance Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-16081-3_34openalex-snapshot
Fast Searching on k-Combinable Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-23101-8_23openalex-snapshot
Learning Through Imitation by Using Formal Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_24openalex-snapshot
Cops and Robber on Oriented Graphs with Respect to Push Operation
inferred← citeshttps://doi.org/10.1007/978-3-031-39344-0_18openalex-snapshot
Constrained Graph Searching on Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-52969-6_16openalex-snapshot
On the Target Pebbling Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-032-08067-7_6openalex-snapshot
Contested Route Planning
inferred← citeshttps://doi.org/10.1007/978-3-032-17156-6_11openalex-snapshot
Lower Bounds of Location Numbers
inferred← citeshttps://doi.org/10.1007/978-3-032-17156-6_3openalex-snapshot
Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-032-32519-8_12openalex-snapshot
Randomise Alone, Reach as a Team
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_5openalex-snapshot
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth
inferred← citeshttps://doi.org/10.1007/978-3-319-08016-1_6openalex-snapshot
The Complexity of Zero-Visibility Cops and Robber
inferred← citeshttps://doi.org/10.1007/978-3-319-22416-9_26openalex-snapshot
Computing Time-Optimal Clearing Strategies for Pursuit-Evasion Problems with Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_24openalex-snapshot
Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_1openalex-snapshot
On the Capture Time of Cops and Robbers Game on a Planar Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-49259-9_31openalex-snapshot
Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_36openalex-snapshot
On the Conjecture of the Smallest 3-Cop-Win Planar Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_10openalex-snapshot
Collaboration Without Communication: Evacuating Two Robots from a Disk
inferred← citeshttps://doi.org/10.1007/978-3-319-75268-6_6openalex-snapshot
G-DPS: A Game-Theoretical Decision-Making Framework for Physical Surveillance Games
inferred← citeshttps://doi.org/10.1007/978-3-319-89441-6_17openalex-snapshot
On-line Search in Two-Dimensional Environment
inferred← citeshttps://doi.org/10.1007/978-3-319-89593-2_5openalex-snapshot
Sweeping Costs of Planar Domains
inferred← citeshttps://doi.org/10.1007/978-3-319-90104-6_3openalex-snapshot
On the Cooperative Graph Searching Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_4openalex-snapshot
Computing Small Search Numbers in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_44openalex-snapshot
Equivalence of Search Capability Among Mobile Guards with Various Visibilities
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_77openalex-snapshot
Sweeping Graphs with Large Clique Number
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_4openalex-snapshot
Searching Is Not Jumping
inferred← citeshttps://doi.org/10.1007/978-3-540-68405-3_30openalex-snapshot
Visibility-Based Pursuit-Evasion with Bounded Speed
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_15openalex-snapshot
On the Fast Searching Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_20openalex-snapshot
Searching Trees with Sources and Targets
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_22openalex-snapshot
Mixed Search Number of Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_7openalex-snapshot
Vision-Based Pursuit-Evasion in a Grid
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_12openalex-snapshot
Directed Searching Digraphs: Monotonicity and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-72870-2_4openalex-snapshot
Digraph Strong Searching: Monotonicity and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_6openalex-snapshot
Graph Searching with Advice
inferred← citeshttps://doi.org/10.1007/978-3-540-73556-4_37openalex-snapshot
Arc Searching Digraphs Without Jumping
inferred← citeshttps://doi.org/10.1007/978-3-540-73556-4_6openalex-snapshot
Searching Cycle-Disjoint Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74466-5_65openalex-snapshot
A Decentralized Solution for Locating Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_29openalex-snapshot
Mixed Search Number and Linear-Width of Interval and Split Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_4openalex-snapshot
Monotonicity of Non-deterministic Graph Searching
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_30openalex-snapshot
The Cost of Monotonicity in Distributed Graph Searching
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_8openalex-snapshot
Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_36openalex-snapshot
A Distributed Algorithm for Computing and Updating the Process Number of a Forest
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_31openalex-snapshot
Tree Decontamination with Temporary Immunity
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_31openalex-snapshot
Searching for a Visible, Lazy Fugitive
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_20openalex-snapshot
Pathwidth is NP-Hard for Weighted Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_5openalex-snapshot
Edge Search Number of Cographs in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_39openalex-snapshot
A Self-stabilizing Algorithm for Graph Searching in Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-13122-6_14openalex-snapshot
Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_30openalex-snapshot
Connected Searching of Weighted Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-16958-8_9openalex-snapshot
Toward Simulating Realistic Pursuit-Evasion Using a Roadmap-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-17452-0_5openalex-snapshot
Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-17452-0_6openalex-snapshot
Multiagent Pursuit Evasion, or Playing Kabaddi
inferred← citeshttps://doi.org/10.1007/978-3-642-25044-6_5openalex-snapshot
Environment Characterization for Non-recontaminating Frontier-Based Robotic Exploration
inferred← citeshttps://doi.org/10.1007/978-3-642-25090-3_29openalex-snapshot
Roadmap-Based Level Clearing of Buildings
inferred← citeshttps://doi.org/10.1007/978-3-642-28572-1_63openalex-snapshot
Towards Experimental Analysis of Challenge Scenarios in Robotics
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_13openalex-snapshot
Graph Minors and Parameterized Algorithm Design
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_1openalex-snapshot
Fast Two-Robot Disk Evacuation with Wireless Communication
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_16openalex-snapshot
The Snow Team Problem
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_2openalex-snapshot
Graph Problems Related to Gate Matrix Layout and PLA Folding
inferred← citeshttps://doi.org/10.1007/978-90-481-9707-1_14openalex-snapshot
Cooperative Mission and Path Planning for a Team of UAVs
inferred← citeshttps://doi.org/10.1007/978-94-011-2080-7_21openalex-snapshot
A Vertex-to-Vertex Pursuit Game Played With Disjoint Sets of Edges
inferred← citeshttps://doi.org/10.1007/978-981-95-0215-8_13openalex-snapshot
Hunting a Rabbit Is Hard
inferred← citeshttps://doi.org/10.1007/bf01124984openalex-snapshot
Minimal trees of a given search number
inferred← citeshttps://doi.org/10.1007/bf01178681openalex-snapshot
Resource finding in store-and-forward networks
inferred← citeshttps://doi.org/10.1007/bfb0009491openalex-snapshot
Graph searching on chordal graphs
inferred← citeshttps://doi.org/10.1007/bfb0020424openalex-snapshot
Secure distributed computing: Theory and practice
inferred← citeshttps://doi.org/10.1007/bfb0036931openalex-snapshot
Minimizing width in linear layouts
inferred← citeshttps://doi.org/10.1007/bfb0045095openalex-snapshot
Edge and node searching problems on trees
inferred← citeshttps://doi.org/10.1007/s00224-019-09948-6openalex-snapshot
On-line Search in Two-Dimensional Environment
inferred← citeshttps://doi.org/10.1007/s002360050156openalex-snapshot
An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs
inferred← citeshttps://doi.org/10.1007/s00373-015-1579-5openalex-snapshot
Network Decontamination with a Single Agent
inferred← citeshttps://doi.org/10.1007/s00446-014-0236-1openalex-snapshot
Distributed graph searching with a sense of direction
inferred← citeshttps://doi.org/10.1007/s00453-001-0045-3openalex-snapshot
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers
inferred← citeshttps://doi.org/10.1007/s00453-011-9524-3openalex-snapshot
A Distributed Algorithm for Computing the Node Search Number in Trees
inferred← citeshttps://doi.org/10.1007/s00453-017-0387-0openalex-snapshot
Complexity of Token Swapping and Its Variants
inferred← citeshttps://doi.org/10.1007/s004530010026openalex-snapshot
Graph Searching on Some Subclasses of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/s00454-002-2886-1openalex-snapshot
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping
inferred← citeshttps://doi.org/10.1007/s10115-017-1023-7openalex-snapshot
Monitoring stealthy diffusion
inferred← citeshttps://doi.org/10.1007/s10458-011-9180-7openalex-snapshot
Hierarchical visibility for guaranteed search in large-scale outdoor terrain
inferred← citeshttps://doi.org/10.1007/s10472-013-9383-5openalex-snapshot
Cooperative exploration and protection of a workspace assisted by information networks
inferred← citeshttps://doi.org/10.1007/s10514-005-4052-0openalex-snapshot
A Sampling-Based Motion Planning Approach to Maintain Visibility of Unpredictable Targets
inferred← citeshttps://doi.org/10.1007/s10514-010-9189-9openalex-snapshot
GSST: anytime guaranteed search
inferred← citeshttps://doi.org/10.1007/s10514-011-9241-4openalex-snapshot
Search and pursuit-evasion in mobile robotics
inferred← citeshttps://doi.org/10.1007/s10514-011-9246-zopenalex-snapshot
Tracking an omnidirectional evader with a differential drive robot
inferred← citeshttps://doi.org/10.1007/s10514-011-9255-yopenalex-snapshot
Algorithms and complexity results for graph-based pursuit evasion
inferred← citeshttps://doi.org/10.1007/s10514-011-9260-1openalex-snapshot
Distributed pursuit-evasion without mapping or global localization via local frontiers
inferred← citeshttps://doi.org/10.1007/s10514-015-9477-5openalex-snapshot
Maintaining strong mutual visibility of an evader moving over the reduced visibility graph
inferred← citeshttps://doi.org/10.1007/s10514-015-9491-7openalex-snapshot
Multi-robot target detection and tracking: taxonomy and survey
inferred← citeshttps://doi.org/10.1007/s10514-019-09900-0openalex-snapshot
Graph search of a moving ground target by a UAV aided by ground sensors with local information
inferred← citeshttps://doi.org/10.1007/s10601-018-9288-3openalex-snapshot
Intruder alert! Optimization models for solving the mobile robot graph-clear problem
inferred← citeshttps://doi.org/10.1007/s10711-010-9481-zopenalex-snapshot
Total curvature and simple pursuit on domains of curvature bounded above
inferred← citeshttps://doi.org/10.1007/s10844-009-0092-9openalex-snapshot
Design of a multi_agent system for worm spreading_reduction
inferred← citeshttps://doi.org/10.1007/s10878-007-9042-zopenalex-snapshot
Monotonicity of strong searching on digraphs
inferred← citeshttps://doi.org/10.1007/s10878-014-9712-6openalex-snapshot
Zero-visibility cops and robber and the pathwidth of a graph
inferred← citeshttps://doi.org/10.1007/s10878-017-0173-6openalex-snapshot
The capture time of a planar graph
inferred← citeshttps://doi.org/10.1007/s10878-023-01012-xopenalex-snapshot
Fast searching on cactus graphs
inferred← citeshttps://doi.org/10.1007/s10957-017-1155-7openalex-snapshot
On a Characterization of Evasion Strategies for Pursuit-Evasion Games on Graphs
inferred← citeshttps://doi.org/10.1007/s11071-021-06800-wopenalex-snapshot
Pursuit on regular surfaces with application to consensus problems
inferred← citeshttps://doi.org/10.1007/s11370-009-0050-yopenalex-snapshot
Scalable and practical pursuit-evasion with networked robots
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90160-7openalex-snapshot
Vertex-to-vertex pursuit in a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90046-9openalex-snapshot
Interval graphs and seatching
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90131-2openalex-snapshot
Minimal trees of given search number
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90092-2openalex-snapshot
Minimal acyclic forbidden minors for the family of graphs with bounded path-width
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90018-dopenalex-snapshot
Single step graph search problem
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90124-zopenalex-snapshot
Solving the single step graph searching problem by solving the maximum two-independent set problem
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90234-mopenalex-snapshot
The vertex separation number of a graph equals its path-width
inferred← citeshttps://doi.org/10.1016/0166-218x(84)90073-8openalex-snapshot
A game of cops and robbers
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90016-4openalex-snapshot
On minimizing width in linear layouts
inferred← citeshttps://doi.org/10.1016/0167-9260(91)90028-jopenalex-snapshot
Fast search algorithms for layout permutation problems
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90003-hopenalex-snapshot
Monotonicity in graph searching
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90146-5openalex-snapshot
Searching and pebbling
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90028-xopenalex-snapshot
Min cut is NP-complete for edge weighted trees
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00160-kopenalex-snapshot
Mixed searching and proper-path-width
inferred← citeshttps://doi.org/10.1016/0304-3975(95)80012-3openalex-snapshot
The complexity of pursuit on a graph
inferred← citeshttps://doi.org/10.1016/j.automatica.2014.11.017openalex-snapshot
Continuous graph partitioning for camera network surveillance
inferred← citeshttps://doi.org/10.1016/j.automatica.2016.05.007openalex-snapshot
Cooperative pursuit with Voronoi partitions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.08.001openalex-snapshot
Escaping offline searchers and isoperimetric theorems
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.007openalex-snapshot
Connected graph searching in chordal graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.011openalex-snapshot
Edge searching weighted graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.020openalex-snapshot
Edge search number of cographs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.03.004openalex-snapshot
Three-fast-searchable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.020openalex-snapshot
Network decontamination under m -immunity
inferred← citeshttps://doi.org/10.1016/j.dam.2017.03.003openalex-snapshot
The fast search number of a Cartesian product of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.039openalex-snapshot
A polynomial time algorithm to compute the connected treewidth of a series–parallel graph
inferred← citeshttps://doi.org/10.1016/j.disc.2008.05.033openalex-snapshot
Sweeping graphs with large clique number
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.032openalex-snapshot
A witness version of the Cops and Robber game
inferred← citeshttps://doi.org/10.1016/j.disc.2012.07.029openalex-snapshot
Locating a robber on a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2013.10.007openalex-snapshot
Outerplanar obstructions for matroid pathwidth
inferred← citeshttps://doi.org/10.1016/j.disc.2016.05.024openalex-snapshot
Subdivisions in the Robber Locating game
inferred← citeshttps://doi.org/10.1016/j.disc.2017.08.028openalex-snapshot
Locating a robber with multiple probes
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.088openalex-snapshot
Outerplanar Obstructions for Matroid Pathwidth
inferred← citeshttps://doi.org/10.1016/j.ic.2012.08.004openalex-snapshot
Connected graph searching
inferred← citeshttps://doi.org/10.1016/j.ic.2016.11.007openalex-snapshot
Exclusive graph searching vs. pathwidth
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105302openalex-snapshot
Further results on the Hunters and Rabbit game through monotonicity
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.12.022openalex-snapshot
Maximum vertex occupation time and inert fugitive: Recontamination does help
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.11.002openalex-snapshot
Clearing directed subgraphs by mobile agents
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.06.008openalex-snapshot
Searching by heterogeneous agents
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103781openalex-snapshot
Parameterized analysis of the cops and robber problem
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.10.002openalex-snapshot
Cops and robbers in a random graph
inferred← citeshttps://doi.org/10.1016/j.mcm.2009.06.011openalex-snapshot
A graph search algorithm for indoor pursuit/evasion
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.040openalex-snapshot
Finite graph automata for linear and boundary graph languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.004openalex-snapshot
Distributed chasing of network intruders
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.036openalex-snapshot
Monotonicity of non-deterministic graph searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.037openalex-snapshot
Cleaning a network with brushes
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.040openalex-snapshot
An annotated bibliography on guaranteed graph searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.020openalex-snapshot
Graph searching with advice
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.002openalex-snapshot
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.017openalex-snapshot
Connected searching of weighted trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.035openalex-snapshot
Locating a robber on a graph via distance queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.01.032openalex-snapshot
Cops and invisible robbers: The cost of drunkenness
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.06.009openalex-snapshot
On minimum cost edge searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.12.001openalex-snapshot
k -Capture in multiagent pursuit evasion, or the lion and the hyenas
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.002openalex-snapshot
Complexity of node coverage games
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.038openalex-snapshot
Non-deterministic graph searching in trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.022openalex-snapshot
The complexity of zero-visibility cops and robber
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.04.026openalex-snapshot
The searchlight problem for road networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.017openalex-snapshot
Lower and upper competitive bounds for online directed graph exploration
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.09.016openalex-snapshot
Jumping robbers in digraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.039openalex-snapshot
Finding small-width connected path decompositions in polynomial time
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.003openalex-snapshot
Clearing an orthogonal polygon to find the evaders
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.042openalex-snapshot
Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115946openalex-snapshot
Hunting a rabbit: Complexity, approximability and some characterizations
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00175-xopenalex-snapshot
Algorithms and obstructions for linear-width and related search parameters
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00297-4openalex-snapshot
Searching expenditure and interval graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00131-5openalex-snapshot
Helicopter search problems, bandwidth and pathwidth
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00225-0openalex-snapshot
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
showing the first 200 of 398 · page through all 398
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.