Amortized efficiency of list update and paging rules
Communications of the ACM
Shortest watchman routes in simple polygons
Discrete & Computational Geometry
Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
How to learn an unknown environment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Walking an unknown street with bounded detour
Computational Geometry: Theory and Applications
Information and Computation
Competitive searching in a generalized street
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On-line search in a simple polygon
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Going Home Through an Unknown Street
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Constructing Shortest Watchman Routes by Divide-and-Conquer
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Finding the Shortest Watchman Route in a Simple Polygon
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polylogarithmic-overhead piecemeal graph exploration
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Visibility-based pursuit-evasion in a polygonal room with a door
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal constrained graph exploration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An O(n log n) algorithm for the zoo-keeper's problem
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Performance bounds for planning in unknown terrain
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Approximating a Shortest Watchman Route
Fundamenta Informaticae
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Information Processing Letters
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
Approximating a Shortest Watchman Route
Fundamenta Informaticae
| Hi-index | 0.00 |