Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
Improved exploration of rectilinear polygons
Nordic Journal of Computing
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)
On the complexity of approximating tsp with neighborhoods and related problems
Computational Complexity
Competitive exploration of rectilinear polygons
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Approximating a Shortest Watchman Route
Fundamenta Informaticae
Reconfiguration methods for mobile sensor networks
ACM Transactions on Sensor Networks (TOSN)
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
International Journal of Computer Vision
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
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
Approximate guarding of monotone and rectilinear polygons
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
Approximating a Shortest Watchman Route
Fundamenta Informaticae
Optimal patrolling of fragmented boundaries
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Three-dimensional coverage planning for an underwater inspection robot
International Journal of Robotics Research
Watchman routes for lines and line segments
Computational Geometry: Theory and Applications
| Hi-index | 0.89 |