I. Abraham, D. Dolev, and D. Malkhi, LLS, Proceedings of the 2004 joint workshop on Foundations of mobile computing , DIALM-POMC '04, pp.75-84
DOI : 10.1145/1022630.1022643

S. Alpern, The Rendezvous Search Problem, SIAM Journal on Control and Optimization, vol.33, issue.3, pp.673-683, 1995.
DOI : 10.1137/S0363012993249195

S. Alpern and S. Gal, The theory of search games and rendezvous. Int. Series in Operations research and Management Science, number 55, 2002.

J. Alpern, V. Baston, and S. Essegaier, Rendezvous search on a graph, Journal of Applied Probability, vol.10, issue.01, pp.223-231, 1999.
DOI : 10.1137/S0363012993249195

E. Anderson and S. Fekete, Asymmetric rendezvous on the plane, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.365-373, 1998.
DOI : 10.1145/276884.276925

E. Anderson and S. Fekete, Two Dimensional Rendezvous Search, Operations Research, vol.49, issue.1, pp.107-118, 2001.
DOI : 10.1287/opre.49.1.107.11191

V. Baston and S. Gal, Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution, SIAM Journal on Control and Optimization, vol.36, issue.6, pp.1880-1889, 1998.
DOI : 10.1137/S0363012996314130

V. Baston and S. Gal, Rendezvous search when marks are left at the starting points, Naval Research Logistics, vol.40, issue.8, pp.722-731, 2001.
DOI : 10.1002/nav.1044

P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, wireless networks, Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications , DIALM '99, pp.609-616, 2001.
DOI : 10.1145/313239.313282

K. Buchin, Constructing Delaunay Triangulations along Space-Filling Curves, Proc. ESA, pp.119-130, 2009.
DOI : 10.1007/978-3-642-04128-0_11
URL : http://repository.tue.nl/668788

R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg, Label-guided graph exploration by a finite automaton, ACM Transactions on Algorithms, vol.4, issue.4, pp.1-18, 2008.
DOI : 10.1145/1383369.1383373
URL : https://hal.archives-ouvertes.fr/hal-00339772

A. Collins, J. Czyzowicz, L. Gasieniec, and A. Labourel, Tell Me Where I Am So I Can Meet You Sooner, Proc. of ICALP, 2010.
DOI : 10.1007/978-3-642-14162-1_42
URL : https://hal.archives-ouvertes.fr/hal-00866392

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

J. Czyzowicz, S. Dobrev, L. Gasieniec, D. Ilcinkas, J. Jansson et al., More Efficient Periodic Traversal in Anonymous Undirected Graphs, Proc SIROCCO'09, pp.167-181
URL : https://hal.archives-ouvertes.fr/hal-00371489

J. Czyzowicz, A. Labourel, and A. Pelc, How to meet asynchronously (almost) everywhere, Proc. of SODA 2010, pp.22-30
DOI : 10.1145/2344422.2344427
URL : https://hal.archives-ouvertes.fr/hal-00418775

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

A. Dessmark, P. Fraigniaud, D. Kowalski, and A. Pelc, Deterministic Rendezvous in Graphs, Algorithmica, vol.46, issue.1, pp.69-96, 2006.
DOI : 10.1007/s00453-006-0074-2

S. Dobrev, J. Jansson, K. Sadakane, and W. Sung, Finding short right-handon-the-wall walks in graphs, Proc. SIROCCO'05, pp.127-139

Y. Emek, L. Gasieniec, E. Kantor, A. Pelc, D. Peleg et al., Broadcasting in UDG radio networks with unknown topology, Distributed Computing, vol.53, issue.5, pp.331-351, 2009.
DOI : 10.1007/s00446-008-0075-z

Y. Emek, E. Kantor, and D. Peleg, On the effect of the deployment setting on broadcasting in Euclidean radio networks, Proc. PODC, pp.223-232, 2008.

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Gathering of Asynchronous Oblivious Robots with Limited Visibility, Proc. STACS'01, pp.247-258
DOI : 10.1007/3-540-44693-1_22

P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, and D. Peleg, Graph exploration by a finite automaton, Theoretical Computer Science, vol.345, issue.2-3, pp.331-344, 2005.
DOI : 10.1016/j.tcs.2005.07.014
URL : https://hal.archives-ouvertes.fr/hal-00339763

S. Gal, Rendezvous Search on the Line, Operations Research, vol.47, issue.6, pp.974-976, 1999.
DOI : 10.1287/opre.47.6.974

L. Gasieniec, R. Klasing, R. A. Martin, A. Navarra, and X. Zhang, Fast periodic graph exploration with constant memory, Journal of Computer and System Sciences, vol.74, issue.5, pp.808-822, 2008.
DOI : 10.1016/j.jcss.2007.09.004
URL : https://hal.archives-ouvertes.fr/hal-00306994

C. Gotsman and M. Lindenbaum, On the metric properties of discrete space-filling curves, IEEE Transactions on Image Processing, vol.5, issue.5, pp.794-797, 1996.
DOI : 10.1109/83.499920

D. Ilcinkas, Setting port numbers for fast graph exploration, Theoretical Computer Science, vol.401, issue.1-3, pp.236-242, 2008.
DOI : 10.1016/j.tcs.2008.03.035
URL : https://hal.archives-ouvertes.fr/hal-00339843

A. Israeli and M. Jalfon, Token management schemes and random walks yield self-stabilizing mutual exclusion, Proceedings of the ninth annual ACM symposium on Principles of distributed computing , PODC '90, pp.119-131
DOI : 10.1145/93385.93409

R. Klasing, A. Kosowski, and A. Navarra, Taking advantage of symmetries: gathering of asynchronous oblivious robots on a ring, Proc. 12th International Conference on Principles of Distributed Systems, 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

A. Kosowski and A. Navarra, Graph Decomposition for Improving Memoryless Periodic Exploration, Proc. MFCS'09, pp.501-512
DOI : 10.1016/j.tcs.2008.03.035

D. Kowalski and A. Malinowski, How to meet in anonymous network, Theoretical Computer Science, vol.399, issue.1-2, pp.141-156, 2008.
DOI : 10.1016/j.tcs.2008.02.010

G. Kozma, Z. Lotker, M. Sharir, and G. Stupp, Geometrically aware communication in random wireless networks, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.310-319, 2004.
DOI : 10.1145/1011767.1011813

E. Kranakis, D. Krizanc, N. Santoro, and C. Sawchuk, Mobile agent rendezvous in a ring, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., pp.592-599
DOI : 10.1109/ICDCS.2003.1203510

F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, Geometric ad-hoc routing, Proceedings of the twenty-second annual symposium on Principles of distributed computing , PODC '03, pp.63-72
DOI : 10.1145/872035.872044

W. Lim and S. Alpern, Minimax Rendezvous on the Line, SIAM Journal on Control and Optimization, vol.34, issue.5, pp.1650-1665, 1996.
DOI : 10.1137/S036301299427816X

B. Moon, H. V. Jagadish, C. Faloutsos, and J. H. Saltz, Analysis of the clustering properties of the Hilbert space-filling curve, IEEE Transactions on Knowledge and Data Engineering, vol.13, issue.1, pp.124-141, 2001.
DOI : 10.1109/69.908985

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

T. Schelling, The strategy of conflict, 1960.

G. Stachowiak, Asynchronous Deterministic Rendezvous on the??Line, SOFSEM, vol.43, pp.497-508
DOI : 10.1007/3-540-61440-0_163

A. Ta-shma and U. Zwick, Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences, Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.599-608, 2007.
DOI : 10.1145/2601068
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.433.734

L. Thomas, Finding Your Kids When They Are Lost, Journal of the Operational Research Society, vol.43, issue.6, pp.637-639, 1992.
DOI : 10.1057/jors.1992.89

B. Xu and D. Z. , Chen Density-Based Data Clustering Algorithms for Lower Dimensions Using Space-Filling Curves, Proc. PAKDD, pp.997-1005, 2007.

X. Yu and M. Yung, Agent rendezvous: A dynamic symmetry-breaking problem, Proc. International Colloquium on Automata, Languages, and Programming (ICALP'1996), pp.610-621
DOI : 10.1007/3-540-61440-0_163