New competitive strategies for searching in unknown star-shaped polygons
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Position-independent near optimal searching and on-line recognition in star polygons
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Online Parallel Heuristics and Robot Searching under the Competitive Framework
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Position-Independent Street Searching
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
The Ultimate Strategy to Search on m Rays?
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Theoretical Computer Science
Online searching with turn cost
Theoretical Computer Science - Approximation and online algorithms
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
An optimal strategy for searching in unknown streets
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the optimality of spiral search
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
| Hi-index | 0.00 |