E. Bampas, J. Czyzowicz, L. G?sieniec, D. Ilcinkas, and A. Labourel, Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids, Proc. of 24th DISC, pp.297-311, 2010.
DOI : 10.1007/978-3-642-15763-9_28
URL : https://hal.archives-ouvertes.fr/hal-00534263

L. Blin, J. Burman, and N. Nisse, Brief Announcement: Distributed Exclusive and Perpetual Tree Searching, Proc of 26th DISC, pp.403-404, 2012.
DOI : 10.1007/978-3-642-33651-5_29
URL : https://hal.archives-ouvertes.fr/hal-00741982

L. Blin, A. Milani, M. Potop-butucaru, and S. Tixeuil, Exclusive Perpetual Ring Exploration without Chirality, Proc. of 24th 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

J. Chalopin and S. Das, Rendezvous of Mobile Agents without Agreement on Local Orientation, Proc of 37th ICALP, pp.515-526, 2010.
DOI : 10.1007/978-3-642-14162-1_43
URL : https://hal.archives-ouvertes.fr/hal-01198883

J. Chalopin, P. Flocchini, B. Mans, and N. Santoro, Network Exploration by Silent and Oblivious Robots, 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG), pp.208-219, 2010.
DOI : 10.1137/S009753979628292X
URL : https://hal.archives-ouvertes.fr/hal-01198880

G. D. Angelo, G. D. Stefano, R. Klasing, and A. Navarra, Gathering of robots on anonymous grids without multiplicity detection, Proc. of 19th 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 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, Proc. of 26th DISC, pp.330-344, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00728979

G. D. Angelo, G. D. Stefano, and A. Navarra, Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model, Search Theory: A Game Theoretic Perspective, pp.197-222, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00755407

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, Proc. of 15th IEEE IPDPS APDCM, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00845546

Y. Dieudonne, A. Pelc, and D. Peleg, Gathering despite mischief, Proc. of 23rd SODA, pp.527-540, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01008764

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots, 11th International Conference on Principles of Distributed Systems (OPODIS), pp.105-118, 2007.
DOI : 10.1007/978-3-540-77096-1_8
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.
URL : https://hal.archives-ouvertes.fr/hal-00341465

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, How many oblivious robots can explore a line, Information Processing Letters, vol.111, issue.20, pp.1027-1031, 2011.
DOI : 10.1016/j.ipl.2011.07.018
URL : https://hal.archives-ouvertes.fr/hal-00643668

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

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

T. Izumi, T. Izumi, S. Kamei, and F. Ooshita, Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings, Proc. of 17th 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, Proc. of 18th SIROCCO, pp.150-161, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01009454

S. Kamei, A. Lamani, F. Ooshita, and S. Tixeuil, Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection, Proc. of 37th MFCS, pp.542-553, 2012.
DOI : 10.1007/978-3-642-32589-2_48
URL : https://hal.archives-ouvertes.fr/hal-00934132

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

E. Kranakis, D. Krizanc, and E. Markou, The Mobile Agent Rendezvous Problem in the Ring, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010.
DOI : 10.2200/S00278ED1V01Y201004DCT001

G. Prencipe, Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Sset of Autonomous Mobile Robots, ICTCS, pp.154-171, 2001.
DOI : 10.1007/3-540-45446-2_10