Touring a sequence of polygons
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Information Processing Letters
Finding shortest safari routes in simple polygons
Information Processing Letters
Approximation algorithms for the watchman route and zookeeper's problems
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Approximation algorithms for TSP with neighborhoods in the plane
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
A 2-approximation algorithm for the zookeeper's problem
Information Processing Letters
Efficiently determining a locally exact shortest path on polyhedral surfaces
Computer-Aided Design
An approximate algorithm for solving the watchman route problem
RobVis'08 Proceedings of the 2nd international conference on Robot vision
Computing multiple watchman routes
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Linear-Time 2-approximation algorithm for the watchman route problem
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Watchman tours for polygons with holes
Computational Geometry: Theory and Applications
Complexity of minimum corridor guarding problems
Information Processing Letters
Watchman routes for lines and segments
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Multi-robot repeated area coverage
Autonomous Robots
Watchman routes for lines and line segments
Computational Geometry: Theory and Applications
Hi-index | 0.90 |