Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Visibility-based pursuit-evasion in a polygonal room with a door
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Visibility-Based Pursuit-Evasion in a Polygonal Environment
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Efficient Algorithms for Searching a Polygonal Room with a Door
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Characterization of Rooms Searchable by Two Guards
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Searching a Simple Polygon by a k-Searcher
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the domination search number
Discrete Applied Mathematics
Searching a polygonal region by a group of stationary k-searchers
Information Processing Letters
Hide-and-seek: algorithms for polygonWalk problems
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Domination search on graphs with low dominating-target-number
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |