Art gallery theorems and algorithms
Art gallery theorems and algorithms
The complexity of searching a graph
Journal of the ACM (JACM)
Finding minimal convex nested polygons
Information and Computation
An efficient algorithm for link-distance problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Shortest watchman routes in simple polygons
Discrete & Computational Geometry
Polygon visibility algorithms for weak visibility and link distance problems
Polygon visibility algorithms for weak visibility and link distance problems
The Art Gallery theorem for polygons with holes
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
An O(n log n) algorithm for computing the link center of a simple polygon
Discrete & Computational Geometry
Ray shooting and parametric search
SIAM Journal on Computing
Arrangements and their applications in robotics: recent developments
WAFR Proceedings of the workshop on Algorithmic foundations of robotics
Handbook of discrete and computational geometry
Ray shooting and lines in space
Handbook of discrete and computational geometry
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Visibility-Based Pursuit-Evasion in a Polygonal Environment
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
Minimum link paths in polygons and related problems
Minimum link paths in polygons and related problems
An algorithm for searching a polygonal region with a flashlight
Proceedings of the sixteenth annual symposium on Computational geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Randomized Pursuit-Evasion in Graphs
Combinatorics, Probability and Computing
Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements
Computer Vision and Image Understanding - Special issue on omnidirectional vision and camera networks
Sweeping simple polygons with the minimum number of chain guards
Information Processing Letters
Reconfiguration methods for mobile sensor networks
ACM Transactions on Sensor Networks (TOSN)
A unified and efficient solution to the room search problem
Computational Geometry: Theory and Applications
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Escaping offline searchers and isoperimetric theorems
Computational Geometry: Theory and Applications
An efficient algorithm for the three-guard problem
Discrete Applied Mathematics
Link Distance and Shortest Path Problems in the Plane
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Surveillance strategies for target detection with sweep lines
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
An approximate morphing between polylines
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Searching a polygonal region by two guards
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Escaping off-line searchers and a discrete isoperimetric theorem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
ACM Transactions on Sensor Networks (TOSN)
Optimum sweeps of simple polygons with two guards
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Link distance and shortest path problems in the plane
Computational Geometry: Theory and Applications
Hide-and-seek: algorithms for polygonWalk problems
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
The two-guard problem revisited and its generalization
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Minimization of the maximum distance between the two guards patrolling a polygonal region
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Studying the stochastic capturing of moving intruders by mobile sensors
Computers & Mathematics with Applications
Capture bounds for visibility-based pursuit evasion
Proceedings of the twenty-ninth annual symposium on Computational geometry
Multi-UAV motion planning for guaranteed search
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Optimum sweeps of simple polygons with two guards
Information Processing Letters
| Hi-index | 0.00 |