R. 1. Das, P. Flocchini, S. Kutten, A. Nayak, and N. Santoro, Map construction of unknown graphs by multiple agents, Theoretical Computer Science, vol.385, issue.1-3, pp.34-48, 2007.
DOI : 10.1016/j.tcs.2007.05.011

G. Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc et al., Asynchronous deterministic rendezvous in graphs, Theoretical Computer Science, vol.355, issue.3, pp.315-326, 2006.
DOI : 10.1016/j.tcs.2005.12.016
URL : http://doi.org/10.1016/j.tcs.2005.12.016

S. Devismes, F. Petit, and S. Tixeuil, Optimal probabilistic ring exploration by asynchronous oblivious robots, Proceedings of SIROCCO 2009, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01295189

Y. Dieudonné, O. Labbani-igbida, and F. Petit, Circle formation of weak mobile robots, TAAS, vol.3, issue.16, 2008.

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Computing without communicating: Ring exploration by asynchronous oblivious robots, 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, N. Pelc, and A. Santoro, Remembering without memory: Tree exploration by asynchronous oblivious robots, SIROCCO, vol.5058, pp.33-47, 2008.
DOI : 10.1016/j.tcs.2010.01.007
URL : https://hal.archives-ouvertes.fr/hal-00341465

P. Flocchini, E. Kranakis, D. Krizanc, N. Santoro, and C. Sawchuk, Multiple Mobile Agent Rendezvous in a Ring, 2004.
DOI : 10.1007/978-3-540-24698-5_62

P. Flocchini, P. Prencipe, N. Santoro, and P. Widmayer, Arbitrary pattern formation by asynchronous, anonymous, oblivious robots, Theoretical Computer Science, vol.407, issue.1-3, pp.412-447, 2008.
DOI : 10.1016/j.tcs.2008.07.026
URL : http://doi.org/10.1016/j.tcs.2008.07.026

R. Klasing, A. Kosowski, and A. Navarra, Taking advantage of symmetries: Gathering of asynchronous oblivious robots on a ring, OPODIS, pp.446-462, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00342931

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

D. Kowalski and A. Pelc, Polynomial Deterministic Rendezvous in Arbitrary Graphs, pp.644-656, 2004.
DOI : 10.1007/978-3-540-30551-4_56
URL : http://hdl.handle.net/11858/00-001M-0000-000F-294A-D

G. Prencipe, Corda: Distributed coordination of a set of autonomous mobile robots, Proc. 4th European Research Seminar on Advances in Distributed Systems (ERSADS'01), pp.185-190, 2001.

I. Suzuki and M. Yamashita, Distributed Anonymous Mobile Robots: Formation of Geometric Patterns, SIAM Journal on Computing, vol.28, issue.4, pp.1347-1363, 1999.
DOI : 10.1137/S009753979628292X