P. Flocchini, G. Prencipe, and N. Santoro, Distributed Computing by Oblivious Mobile Robots, Synthesis Lectures on Distributed Computing Theory, vol.3, issue.2, 2012.
DOI : 10.2200/S00440ED1V01Y201208DCT010

G. Prencipe, Impossibility of gathering by a set of autonomous mobile robots, Theoretical Computer Science, vol.384, issue.2-3, pp.222-231, 2007.
DOI : 10.1016/j.tcs.2007.04.023

R. Baldoni, F. Bonnet, A. Milani, and M. , Anonymous graph exploration without collision by mobile robots, Information Processing Letters, vol.109, issue.2, pp.98-103, 2008.
DOI : 10.1016/j.ipl.2008.08.011
URL : https://hal.archives-ouvertes.fr/inria-00333179

C. Ambühl, L. , A. Pelc, T. Radzik, and X. Zhang, Tree exploration with logarithmic memory, ACM Transactions on Algorithms, vol.7, issue.2, pp.1-17, 2011.
DOI : 10.1145/1921659.1921663

E. Bampas, J. Czyzowicz, L. , D. Ilcinkas, and A. Labourel, Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids, 24th Int. Symp. on Distributed Computing (DISC), ser. LNCS, pp.297-311, 2010.
DOI : 10.1007/978-3-642-15763-9_28
URL : https://hal.archives-ouvertes.fr/hal-00534263

R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg, Label-Guided Graph Exploration by a Finite Automaton, ACM Trans. Algorithms, vol.4, issue.42, pp.1-4218, 2008.
DOI : 10.1007/11523468_28
URL : https://hal.archives-ouvertes.fr/hal-00339772

J. Czyzowicz, L. , and A. Pelc, Gathering few fat mobile robots in the plane, Theoretical Computer Science, vol.410, pp.6-7, 2009.

F. V. Fomin and D. M. Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, issue.3, pp.236-245, 2008.
DOI : 10.1016/j.tcs.2008.02.040

D. Ilcinkas, N. Nisse, and D. Soguet, The cost of monotonicity in distributed graph searching, Distributed Computing, pp.117-127, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00341415

A. Pelc, Deterministic rendezvous in networks: A comprehensive survey, Networks, vol.7, issue.3, pp.331-347, 2012.
DOI : 10.1002/net.21453

S. Devismes, F. Petit, and S. Tixeuil, Optimal probabilistic ring exploration by semi-synchronous oblivious robots, 16th Int. Coll. on Structural Information and Communication Complexity (SIROCCO), ser. LNCS, pp.195-208, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00930045

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Computing without communicating: Ring exploration by asynchronous oblivious robots, Algorithmica
URL : https://hal.archives-ouvertes.fr/hal-00339884

R. Baldoni, F. Bonnet, A. Milani, and M. , On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots, 12th Int. Conf. On Principles Of Distributed Systems (OPODIS), ser. LNCS, pp.428-445, 2008.
DOI : 10.1109/AINA.2007.44
URL : https://hal.archives-ouvertes.fr/inria-00277344

L. Blin, A. Milani, M. Potop-butucaru, and S. Tixeuil, Exclusive Perpetual Ring Exploration without Chirality, 24th Int. Symp. on Distributed Computing (DISC), ser. LNCS, pp.312-327, 2010.
DOI : 10.1007/978-3-642-15763-9_29
URL : https://hal.archives-ouvertes.fr/hal-00992700

F. Bonnet, A. Milani, M. Potop-butucaru, and S. Tixeuil, Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction, 15th Int. Conf. On Principles Of Distributed Systems (OPODIS), ser. LNCS, pp.251-265, 2011.
DOI : 10.1007/978-3-642-25873-2_18
URL : https://hal.archives-ouvertes.fr/hal-00992679

L. Blin, J. Burman, and N. Nisse, Distributed exclusive and perpetual tree searching, 26th Int. Symp. on Distributed Computing (DISC), ser. LNCS, pp.403-404, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00741982

G. D. Angelo, G. D. Stefano, R. Klasing, and A. Navarra, Gathering of robots on anonymous grids without multiplicity detection, 19th Int. Coll. on Structural Information and Communication Complexity (SIROCCO), ser. LNCS, pp.327-338, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00728988

R. Klasing, E. Markou, and A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Theoretical Computer Science, vol.390, issue.1, pp.27-39, 2008.
DOI : 10.1016/j.tcs.2007.09.032
URL : https://hal.archives-ouvertes.fr/hal-00307234

G. D. Angelo, G. D. Stefano, and A. Navarra, Gathering of six robots on anonymous symmetric rings, 18th Int. Coll. on Structural Inf. and Com. Complexity (SIROCCO), ser. LNCS, pp.174-185, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00644039

R. Klasing, A. Kosowski, and A. Navarra, Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring, Theoretical Computer Science, vol.411, issue.34-36, pp.3235-3246, 2010.
DOI : 10.1016/j.tcs.2010.05.020
URL : https://hal.archives-ouvertes.fr/hal-00519069

G. D. Angelo, G. D. Stefano, and A. Navarra, How to gather asynchronous oblivious robots on anonymous rings, 26th Int. Symp. on Distributed Computing (DISC), ser. LNCS, pp.330-344, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00728979

T. Izumi, T. Izumi, S. Kamei, and F. Ooshita, Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings, 17th Int. Coll. on Structural Information and Communication Complexity (SIROCCO), ser. LNCS, pp.101-113, 2010.
DOI : 10.1007/978-3-642-13284-1_9

S. Kamei, A. Lamani, F. Ooshita, and S. Tixeuil, Asynchronous mobile robot gathering from symmetric configurations, 18th Int. Coll. on Structural Information and Communication Complexity (SIROCCO), ser. LNCS, pp.150-161, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01009454

G. D. Angelo, G. D. Stefano, A. Navarra, N. Nisse, and K. Suchan, A unified approach for different tasks on rings in robot-based computing systems, INRIA, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00845546

D. Bienstock and P. D. Seymour, Monotonicity in graph searching, Journal of Algorithms, vol.12, issue.2, pp.239-245, 1991.
DOI : 10.1016/0196-6774(91)90003-H