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, Rendezvous search on labeled networks, Naval Research Logistics, vol.48, issue.3, pp.256-274, 2002.
DOI : 10.1002/nav.10011

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

E. Anderson and R. Weber, The rendezvous problem on discrete locations, Journal of Applied Probability, vol.28, pp.839-851, 1990.

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

E. Bampas, J. Czyzowicz, L. Gasieniec, D. Ilcinkas, and A. , Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids, Proc. 24th International Symposium on Distributed Computing, pp.297-311, 2010.
DOI : 10.1007/978-3-642-15763-9_28
URL : https://hal.archives-ouvertes.fr/hal-00534263

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

J. Chalopin, S. Das, and P. Widmayer, Deterministic symmetric rendezvous in arbitrary graphs: Overcoming anonymity, failures and uncertainty, In " Search Theory: A Game Theoretic Perspective, pp.175-195, 2013.

M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro, Distributed Computing by Mobile Robots: Gathering, SIAM Journal on Computing, vol.41, issue.4, pp.41-829, 2012.
DOI : 10.1137/100796534

J. Czyzowicz, A. Kosowski, and A. Pelc, How to meet when you forget, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.165-178, 2012.
DOI : 10.1145/1835698.1835801
URL : https://hal.archives-ouvertes.fr/hal-00725875

J. Czyzowicz, A. Labourel, and A. Pelc, How to meet asynchronously (almost) everywhere, ACM Transactions on Algorithms, vol.8, issue.4, 2012.
DOI : 10.1145/2344422.2344427
URL : https://hal.archives-ouvertes.fr/hal-00418775

S. Das, Mobile Agent Rendezvous in a Ring Using Faulty Tokens, Proc. 9th International Conference on Distributed Computing and Networking, pp.292-297, 2008.
DOI : 10.1007/978-3-540-77444-0_29

S. Das, M. Mihalak, R. Sramek, E. Vicari, and P. Widmayer, Rendezvous of Mobile Agents When Tokens Fail Anytime, Proc. 12th International Conference on Principles of Distributed Systems, pp.463-480, 2008.
DOI : 10.1109/71.481599

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

Y. Dieudonné and A. Pelc, Deterministic network exploration by a single agent with Byzantine tokens, Information Processing Letters, vol.112, issue.12, pp.467-470, 2012.
DOI : 10.1016/j.ipl.2012.03.017

Y. Dieudonné, A. Pelc, and D. Peleg, Gathering despite mischief, Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp.527-540, 2012.

Y. Dieudonné, A. Pelc, and V. Villain, How to meet asynchronously at polynomial cost, Proc. 32nd Annual ACM Symposium on Principles of Distributed Computing, pp.92-99, 2013.

P. Flocchini, E. Kranakis, D. Krizanc, F. L. Luccio, N. Santoro et al., Mobile Agents Rendezvous When Tokens Fail, Proc. 11th Int. Colloquium on Structural Information and Communication Complexity, pp.161-172, 2004.
DOI : 10.1007/978-3-540-27796-5_15

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Gathering of asynchronous robots with limited visibility, Theoretical Computer Science, vol.337, issue.1-3, pp.147-168, 2005.
DOI : 10.1016/j.tcs.2005.01.001

P. Fraigniaud and A. Pelc, Delays induce an exponential memory gap for rendezvous in trees, ACM Transactions on Algorithms, vol.9, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00922693

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, 1990.
DOI : 10.1145/93385.93409

M. Kouck´ykouck´y, Universal traversal sequences with backtracking, Journal of Computer and System Sciences, vol.65, issue.4, pp.717-726, 2002.
DOI : 10.1016/S0022-0000(02)00023-5

D. Kowalski and A. Malinowski, How to meet in anonymous network, Proc. 13th Int. Colloquium on Structural Information and Communication Complexity, pp.44-58, 2006.

E. Kranakis, D. Krizanc, and P. Morin, Randomized Rendez-Vous with Limited Memory, Proc. 8th Latin American Theoretical Informatics, pp.605-616, 2008.
DOI : 10.1007/978-3-540-78773-0_52

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, 2003.
DOI : 10.1109/ICDCS.2003.1203510

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

N. L. Lynch, Distributed algorithms, 1996.

A. Pelc, Deterministic rendezvous in networks: A comprehensive survey, Networks, vol.7, issue.3, pp.331-347, 2012.
DOI : 10.1002/net.21453

O. Reingold, Undirected connectivity in log-space, Journal of the ACM, vol.55, issue.4, 2008.
DOI : 10.1145/1391289.1391291

A. Ta-shma and U. Zwick, Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences, Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, pp.599-608, 2007.
DOI : 10.1145/2601068

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