Optimal robot localization in trees
Proceedings of the twelfth annual symposium on Computational geometry
Polylogarithmic-overhead piecemeal graph exploration
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Optimal robot localization in trees
Information and Computation
Tree exploration with little memory
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Spanning-tree based coverage of continuous areas by a mobile robot
Annals of Mathematics and Artificial Intelligence
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Searching Rectilinear Streets Completely
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Optimal Graph Exploration without Good Maps
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Tree exploration with little memory
Journal of Algorithms
Optimal graph exploration without good maps
Theoretical Computer Science
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
Optimal constrained graph exploration
ACM Transactions on Algorithms (TALG)
Information and Computation
Exploring an unknown graph efficiently
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Optimal exploration of terrains with obstacles
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
Online multi-robot exploration of grid graphs with rectangular obstacles
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |