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

S. Bouchard, M. Bournat, Y. Dieudonné, S. Dubois, and F. Petit, Asynchronous approach in the plane : A deterministic polynomial algorithm, Proceedings of DISC 2017, pp.1-8, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01672916

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

A. Dessmark, P. Fraigniaud, D. R. Kowalski, and A. Pelc, Deterministic Rendezvous in Graphs, Algorithmica, vol.46, issue.1, pp.69-96, 2006.
DOI : 10.1007/s00453-006-0074-2
URL : http://edoc.mpg.de/get.epl?fid=35769&did=314448&ver=0

Y. Dieudonné and A. Pelc, Deterministic polynomial approach in the plane, Distributed Computing, vol.59, issue.2, pp.111-129, 2015.
DOI : 10.1002/net.21453