Polynomial time algorithms for the min cut problem on degree restricted trees
SIAM Journal on Computing
A polynomial algorithm for the min-cut linear arrangement of trees
Journal of the ACM (JACM)
Theoretical Computer Science
Asymptotically tight bounds on time-space trade-offs in a pebble game
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Layout problems and their complexity
Layout problems and their complexity
Recontamination does not help to search a graph
Journal of the ACM (JACM)
Distributed pursuit-evasion: some aspects of privacy and security in distributed computing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
Journal of the ACM (JACM)
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Locating Information with Uncertainty in Fully Interconnected Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Searching with Mobile Agents in Networks with Liars
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Bisimulation Based Hierarchical System Architecture for Single-Agent Multi-modal Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
On the Monotonicity of Games Generated by Symmetric Submodular Functions
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Computing Optimal Linear Layouts of Trees in Linear Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
On the monotonicity of games generated by symmetric submodular functions
Discrete Applied Mathematics - Submodularity
Randomized Pursuit-Evasion in Graphs
Combinatorics, Probability and Computing
Searching expenditure and interval graphs
Discrete Applied Mathematics
Randomized pursuit-evasion with limited visibility
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Contiguous Search in the Hypercube for Capturing an Intruder
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Visibility-based Pursuit-evasion with Limited Field of View
International Journal of Robotics Research
Analytic modeling of detection latency in mobile sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
A 3-approximation for the pathwidth of Halin graphs
Journal of Discrete Algorithms
Capturing an intruder in product networks
Journal of Parallel and Distributed Computing
Node-searching problem on block graphs
Discrete Applied Mathematics
Distributed chasing of network intruders
Theoretical Computer Science
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Monotonicity of non-deterministic graph searching
Theoretical Computer Science
Cleaning a network with brushes
Theoretical Computer Science
Digraph searching, directed vertex separation and directed pathwidth
Discrete Applied Mathematics
Digraph Strong Searching: Monotonicity and Complexity
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Searching Trees with Sources and Targets
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Mixed Search Number of Permutation Graphs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
On the Monotonicity of Weak Searching
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Vision-Based Pursuit-Evasion in a Grid
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Escaping offline searchers and isoperimetric theorems
Computational Geometry: Theory and Applications
Monotonicity in digraph search problems
Theoretical Computer Science
Monotony properties of connected visible graph searching
Information and Computation
Computing and Updating the Process Number in Trees
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Efficient Multi-robot Search for a Moving Target
International Journal of Robotics Research
Theoretical Computer Science
Edge searching weighted graphs
Discrete Applied Mathematics
Connected graph searching in chordal graphs
Discrete Applied Mathematics
Edge Search Number of Cographs in Linear Time
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Visibility-based pursuit-evasion with limited field of view
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Markovian search games in heterogeneous spaces
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Algorithms and complexity results for pursuit-evasion problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Multi-step multi-sensor hider-seeker games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Reconfiguration of the routing in WDM networks with two classes of services
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
A Self-stabilizing Algorithm for Graph Searching in Trees
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Lower Bounds on Fast Searching
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A PSO solution for pursuit-evasion problem of randomly mobile agents
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Surveillance strategies for target detection with sweep lines
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Parallel cleaning of a network with brushes
Discrete Applied Mathematics
Intruder capture in Sierpinski graphs
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Distributed hybrid control for multiple-pursuer multiple-evader games
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Directed searching digraphs: monotonicity and complexity
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Pursuit-evasion on trees by robot teams
IEEE Transactions on Robotics
Monotonicity of non-deterministic graph searching
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Pathwidth of circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Mixed search number and linear-width of interval and split graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Searching cycle-disjoint graphs
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Arc searching digraphs without jumping
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
The cost of monotonicity in distributed graph searching
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Detection of intelligent mobile target in a mobile sensor network
IEEE/ACM Transactions on Networking (TON)
GSST: anytime guaranteed search
Autonomous Robots
Improving the Efficiency of Clearing with Multi-agent Teams
International Journal of Robotics Research
CSP duality and trees of bounded pathwidth
Theoretical Computer Science
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Decontamination of chordal rings and tori
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Network decontamination with local immunization
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Network decontamination with temporal immunity by cellular automata
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Secure upgrade of hardware security modules in bank networks
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Fast edge-searching and related problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Fast edge searching and fast searching on graphs
Theoretical Computer Science
Approximation algorithms for domination search
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Vision-Based Pursuit-Evasion in a Grid
SIAM Journal on Discrete Mathematics
Characterization of graphs and digraphs with small process numbers
Discrete Applied Mathematics
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Theoretical Computer Science
Search and pursuit-evasion in mobile robotics
Autonomous Robots
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
Fast searching games on graphs
Journal of Combinatorial Optimization
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Monotony properties of connected visible graph searching
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Capturing an intruder in the pyramid
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distributed chasing of network intruders
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Graph searching and search time
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Boundary-Optimal triangulation flooding
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Sweeping graphs with large clique number
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Cops and robber game without recharging
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Edge search number of cographs
Discrete Applied Mathematics
Cleaning an arbitrary regular network with mobile agents
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Connected treewidth and connected graph searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A graph search algorithm for indoor pursuit/evasion
Mathematical and Computer Modelling: An International Journal
Model checking knowledge in pursuit evasion games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Information and Computation
Approximate search strategies for weighted trees
Theoretical Computer Science
Lower bounds on edge searching
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Efficient algorithms for pursuing moving evaders in terrains
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Hierarchical visibility for guaranteed search in large-scale outdoor terrain
Autonomous Agents and Multi-Agent Systems
Multi-UAV motion planning for guaranteed search
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Discrete Applied Mathematics
| Hi-index | 0.02 |
T. Parsons originally proposed and studied the following pursuit-evasion problem on graphs: Members of a team of searchers traverse the edges of a graph G in pursuit of a fugitive, who moves along the edges of the graph with complete knowledge of the locations of the pursuers. What is the smallest number s(G) of searchers that will suffice for guaranteeing capture of the fugitive? It is shown that determining whether s(G) ≤ K, for a given integer K, is NP-complete for general graphs but can be solved in linear time for trees. We also provide a structural characterization of those graphs G with s(G) ≤ K for K = 1, 2, 3.