An O(n log n) algorithm for the zoo-keeper's problem
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Touring a sequence of polygons
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Finding shortest safari routes in simple polygons
Information Processing Letters
An approximative solution to the Zookeeper's Problem
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)
Shortest paths in simple polygons with polygon-meet constraints
Information Processing Letters
A 2-approximation algorithm for the zookeeper's problem
Information Processing Letters
Query-point visibility constrained shortest paths in simple polygons
Theoretical Computer Science
Inspecting a Set of Strips Optimally
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Self-organizing map for the multi-goal path planning with polygonal goals
ICANN'11 Proceedings of the 21th international conference on Artificial neural networks - Volume Part I
Optimal patrolling of fragmented boundaries
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Visiting convex regions in a polygonal map
Robotics and Autonomous Systems
| Hi-index | 0.08 |