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

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), pp.428-445, 2008.
DOI : 10.1109/AINA.2007.44
URL : https://hal.archives-ouvertes.fr/inria-00277344

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

L. Blin, J. Burman, and N. Nisse, Perpetual Graph Searching
URL : https://hal.archives-ouvertes.fr/hal-00675233

L. Blin, A. Milani, M. Potop-butucaru, and S. Tixeuil, Exclusive Perpetual Ring Exploration without Chirality, 24th Int. Symp. on Distributed Computing (DISC), 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), pp.251-265, 2011.
DOI : 10.1007/978-3-642-25873-2_18
URL : https://hal.archives-ouvertes.fr/hal-00992679

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), pp.327-338, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00728988

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), pp.174-185, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00644039

G. D. Angelo, G. D. Stefano, and A. Navarra, How to gather asynchronous oblivious robots on anonymous rings
URL : https://hal.archives-ouvertes.fr/hal-00728979

S. Devismes, F. Petit, and S. Tixeuil, Optimal probabilistic ring exploration by semisynchronous oblivious robots, 16th Int. Coll. on Structural Information and Communication Complexity (SIROCCO), pp.195-208, 2009.
DOI : 10.1007/978-3-642-11476-2_16
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

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Remembering without memory: Tree exploration by asynchronous oblivious robots, Theor. Comput. Sci, vol.411, pp.14-151583, 2010.
DOI : 10.1016/j.tcs.2010.01.007
URL : https://hal.archives-ouvertes.fr/hal-00341465

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots, 10th Int. Symp. on Algorithms and Computation (ISAAC), volume 1741 of LNCS, pp.93-102, 1999.
DOI : 10.1007/3-540-46632-0_10

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, vol.410, issue.14, pp.117-127, 2009.
DOI : 10.1007/s00446-009-0089-1
URL : https://hal.archives-ouvertes.fr/hal-00412063

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), 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), pp.150-161, 2011.
DOI : 10.1007/978-3-642-22212-2_14
URL : https://hal.archives-ouvertes.fr/hal-01009454

S. Kamei, A. Lamani, F. Ooshita, and S. Tixeuil, Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection, 37th Int. Symp. on Mathematical Foundations of Computer Science (MFCS, 2012.
DOI : 10.1007/11429647_20
URL : https://hal.archives-ouvertes.fr/hal-01009454

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

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. 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