N. Agmon and D. , Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots, SIAM Journal on Computing, vol.36, issue.1, pp.56-82, 2006.
DOI : 10.1137/050645221
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.4666

S. Albers and M. R. Henzinger, Exploring Unknown Environments, SIAM Journal on Computing, vol.29, issue.4, pp.1164-1188, 2000.
DOI : 10.1137/S009753979732428X

I. Averbakh and O. Berman, A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree, Discrete Applied Mathematics, vol.68, issue.1-2, pp.17-32, 1996.
DOI : 10.1016/0166-218X(95)00054-U

I. Averbakh and O. Berman, (p ??? 1)(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective, Discrete Applied Mathematics, vol.75, issue.3, pp.201-216, 1997.
DOI : 10.1016/S0166-218X(97)89161-5

B. Awerbuch, M. Betke, R. Rivest, and M. Singh, Piecemeal graph learning by a mobile robot, Proc. 8th Conf. on Comput. Learning Theory, pp.321-328, 1995.

M. A. Bender, A. Fernandez, D. Ron, A. Sahai, and S. Vadhan, The power of a pebble, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.269-278, 1998.
DOI : 10.1145/276698.276759

M. A. Bender and D. Slonim, The power of team exploration: two robots can learn unlabeled directed graphs, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.75-85, 1994.
DOI : 10.1109/SFCS.1994.365703

M. Betke, R. Rivest, and M. Singh, Piecemeal learning of an unknown environment, Machine Learning, vol.18, pp.231-254, 1995.

M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro, Solving the Robots Gathering Problem, Proc. 30th Int. Col. Automata, Languages and Programming (ICALP 2003), pp.1181-1196
DOI : 10.1007/3-540-45061-0_90

R. Cohen and D. Peleg, Robot Convergence via Center-of-Gravity Algorithms, Proc. 11th Int. Col. on Structural Information and Communication Complexity (SIROCCO 2004), pp.79-88
DOI : 10.1007/978-3-540-27796-5_8

J. Czyzowicz, L. Gasieniec, and A. Pelc, Gathering few fat mobile robots in the plane, Proc. 10th Int. Conf. on Principles of Distributed Systems (OPODIS'2006), pp.744-753

S. 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, 2007.
DOI : 10.1016/j.tcs.2007.05.011

X. Défago and A. Konagaya, Circle formation for oblivious anonymous mobile robots with no common sense of orientation, Proceedings of the second ACM international workshop on Principles of mobile computing , POMC '02, pp.97-104, 2002.
DOI : 10.1145/584490.584509

X. Deng and C. H. Papadimitriou, Exploring an unknown graph, Journal of Graph Theory, vol.28, issue.3, pp.265-297, 1999.
DOI : 10.1002/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8

A. Dessmark and A. Pelc, Optimal graph exploration without good maps, Proc. 10th European Symp. on Algorithms, pp.374-386, 2002.

K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc, Tree exploration with little memory, Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp.588-597, 2002.
DOI : 10.1016/j.jalgor.2003.10.002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.8049

C. A. Duncan, S. G. Kobourov, and V. S. Kumar, Optimal constrained graph exploration, Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp.807-814, 2001.
DOI : 10.1145/1159892.1159897
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.1462

R. Fleischer and G. Trippen, Exploring an Unknown Graph Efficiently, Proc. 13th European Symp. on Algorithms, pp.11-22, 2005.
DOI : 10.1007/11561071_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.7651

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Hard tasks for weak robot, Proc. 10th Int. Symp. on Algorithm and Computation (ISAAC 1999), pp.93-102

P. Fraigniaud, L. Gasieniec, D. Kowalski, and A. Pelc, Collective tree exploration, Proc. Latin American Theoretical Informatics (LATIN'2004), pp.141-151
DOI : 10.1002/net.20127
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.6599

G. N. Frederickson, M. S. Hecht, and C. E. Kim, Approximation Algorithms for Some Routing Problems, SIAM Journal on Computing, vol.7, issue.2, pp.178-193, 1978.
DOI : 10.1137/0207017

L. Gasieniec, A. Pelc, T. Radzik, and X. Zhang, Tree exploration with logarithmic memory, Proc. 18th Annual ACM-SIAM Symp. on Discrete Algorithms, 2007.

R. Klasing, E. Markou, and A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Proc. 17th Int. Symp. on Algorithms and Computation, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00307234

X. Li and N. Santoro, An Integrated Self-deployment and Coverage Maintenance Scheme for Mobile Sensor Networks, Proc of 2nd Int. Conf. on Mobile Ad-Hoc and Sensors Networks, 2006.
DOI : 10.1007/11943952_71

P. Panaite and A. Pelc, Exploring Unknown Undirected Graphs, Journal of Algorithms, vol.33, issue.2, pp.281-295, 1999.
DOI : 10.1006/jagm.1999.1043

G. Prencipe, On the Feasibility of Gathering by Autonomous Mobile Robots, Proc. 12th Int. Col. on Structural Information and Communication Complexity (SIROCCO 2005), pp.246-261
DOI : 10.1007/11429647_20

G. Prencipe and N. Santoro, Distributed algorithms for mobile robots, Proc. 5th IFIP Int. Conf. on Theoretical Computer Science, pp.47-62, 2006.

S. M. Ruiz, A Result on Prime Numbers, Math. Gaz, vol.81, issue.269, 1997.

S. Souissi, X. Défago, and M. Yamashita, Gathering Asynchronous Mobile Robots with Inaccurate Compasses, Proc. 10th Int. Conf. on Principles of Distributed Systems (OPODIS 2006), pp.333-349
DOI : 10.1007/11945529_24

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