Piecemeal graph learning by a mobile robot, Information and Computation, vol.152, pp.155-172, 1999. ,
Maximal exploration of trees with energy-constrained agents, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01523302
Rendezvous and election of mobile agents: Impact of sense of direction. Theory of Computing Systems, vol.40, pp.143-162, 2007. ,
Optimal construction of sense of direction in a torus by a mobile agent, Int. J. Found. Comput. Sci, vol.18, issue.3, pp.529-546, 2007. ,
The power of a pebble: Exploring and mapping directed graphs, Proc. 30th ACM Symp. on Theory of Computing (STOC'98), pp.269-287, 1998. ,
On the power of the compass (or, why mazes are easier to search than graphs), 19th Symposium on Foundations of Computer Science (FOCS'78), pp.132-142, 1978. ,
Multirobot tree and graph exploration, IEEE Trans. Robotics, vol.27, issue.4, pp.707-717, 2011. ,
, Automata and labyrinths. Math. Nachrichten, pp.195-282, 1978.
Constructing a map of an anonymous graph: Applications of universal sequences, 14th International Conference on Principles of Distributed Systems (OPODIS), vol.6490, pp.119-134, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00726071
Rendezvous of mobile agents in unknown graphs with faulty links, Proceedings of 21st International Symposium on Distributed Computing (DISC), pp.108-122, 2007. ,
Label-guided graph exploration by a finite automaton, ACM Trans. Algorithms, vol.4, issue.4, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00339772
Collision-free network exploration, J. Comput. Syst. Sci, vol.86, pp.70-81, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-00736276
More efficient periodic traversal in anonymous undirected graphs, Theor. Comput. Sci, vol.444, pp.60-76, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00371489
How to meet when you forget: log-space rendezvous in arbitrary graphs, Distributed Computing, vol.25, issue.2, pp.165-178, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00725875
Collaborative exploration of trees by energy-constrained mobile robots, Theory Comput. Syst, vol.62, issue.5, pp.1223-1240, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02082153
Energy constrained depth first search. CoRR, abs/1709.10146, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-02082201
Map construction of unknown graphs by multiple agents, Theoretical Computer Science, vol.385, issue.1-3, pp.34-48, 2007. ,
Effective elections for anonymous mobile agents, Proceeding of 17th International Symposium on Algorithms and Computation (ISAAC), pp.732-743, 2006. ,
Rendezvous of mobile agents when tokens fail anytime, Proc. 12th International Conference on Principles of Distributed Systems (OPODIS), pp.463-480, 2008. ,
Exploring an unknown graph, Journal of Graph Theory, vol.32, issue.3, pp.265-297, 1999. ,
Fast collaborative graph exploration, Information and Computation, vol.243, pp.37-49, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01251826
Gathering despite mischief, ACM Transactions on Algorithms, vol.11, issue.1, p.1, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01330397
Tree exploration with little memory, Journal of Algorithms, vol.51, pp.38-63, 2004. ,
Undirected graph exploration with (log log n) pebbles, Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.25-39, 2016. ,
Black hole search in common interconnection networks, Networks, vol.47, issue.2, pp.61-71, 2006. ,
Optimal constrained graph exploration, 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.807-814, 2001. ,
Why robots need maps, Proc. 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.41-50, 2007. ,
Decontamination of hypercubes by mobile agents, Networks, vol.52, issue.3, pp.167-178, 2008. ,
Collective tree exploration. Networks, vol.48, pp.166-177, 2006. ,
Graph exploration by a finite automaton, Theoretical Computer Science, vol.345, issue.2-3, pp.331-344, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00339763
Graph decomposition for memoryless periodic exploration, Algorithmica, vol.63, issue.1-2, pp.26-38, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00725922
Time and space optimality of rotor-router graph exploration, Inf. Process. Lett, vol.127, pp.17-20, 2017. ,
Online multi-robot exploration of grid graphs with rectangular obstacles, 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp.27-36, 2012. ,
Exploring unknown undirected graphs, J. Algorithms, vol.33, pp.281-295, 1999. ,
Undirected connectivity in log-space, J. ACM, vol.55, issue.4, 2008. ,
Automaten in planaren graphen, Acta Informatica, vol.13, issue.3, pp.287-298, 1980. ,
Presentation of a maze-solving machine, 8th Conference of the Josiah Macy Jr. Found. (Cybernetics), pp.173-180, 1951. ,
Depth first search and linear graph algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972. ,
Computing on anonymous networks: Part icharacterizing the solvable cases, IEEE Trans. Parallel Distrib. Syst, vol.7, issue.1, pp.69-89, 1996. ,
A distributed ant algorithm for efficiently patrolling a network, Algorithmica, vol.37, issue.3, pp.165-186, 2003. ,