Optimal constrained graph exploration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Tree exploration with little memory
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Lifelong Planning for Mobile Robots
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Optimal Graph Exploration without Good Maps
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Deterministic broadcasting time with partial knowledge of the network
Theoretical Computer Science
Performance bounds for planning in unknown terrain
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Tree exploration with little memory
Journal of Algorithms
Distributed Colouring and Communication in Rings with Local Knowledge
Combinatorics, Probability and Computing
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)
Tree exploration with logarithmic memory
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
Fast periodic graph exploration with constant memory
Journal of Computer and System Sciences
Note: Setting port numbers for fast graph exploration
Theoretical Computer Science
Impact of memory size on graph exploration capability
Discrete Applied Mathematics
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Information and Computation
Remembering without memory: Tree exploration by asynchronous oblivious robots
Theoretical Computer Science
Fast periodic graph exploration with constant memory
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Optimal map construction of an unknown torus
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Tree exploration with logarithmic memory
ACM Transactions on Algorithms (TALG)
Constructing a map of an anonymous graph: applications of universal sequences
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
An agent exploration in unknown undirected graphs with whiteboards
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Online graph exploration: new results on old and new algorithms
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Setting port numbers for fast graph exploration
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
More efficient periodic traversal in anonymous undirected graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Black hole search in directed graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Periodic data retrieval problem in rings containing a malicious host
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
On the power of waiting when exploring public transportation systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Collaborative search on the plane without communication
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science
Memory lower bounds for randomized collaborative search and implications for biology
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Exploring an unknown dangerous graph using tokens
Theoretical Computer Science
Perspective: Simple agents learn to find their way: An introduction on mapping polygons
Discrete Applied Mathematics
| Hi-index | 0.01 |