Random walks, universal traversal sequences, and the complexity of maze problems, Proc. Annual Symposium on Foundations of Computer Science FOCS'1979, pp.218-223 ,
The Rendezvous Search Problem, SIAM Journal on Control and Optimization, vol.33, issue.3, pp.673-683, 1995. ,
DOI : 10.1137/S0363012993249195
Rendezvous search on labeled networks, Naval Research Logistics, vol.48, issue.3, pp.256-274, 2002. ,
DOI : 10.1002/nav.10011
The theory of search games and rendezvous, 2002. ,
Rendezvous search on a graph, Journal of Applied Probability, vol.10, issue.01, pp.223-231, 1999. ,
DOI : 10.1137/S0363012993249195
The rendezvous problem on discrete locations, Journal of Applied Probability, vol.28, pp.839-851, 1990. ,
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
Two Dimensional Rendezvous Search, Operations Research, vol.49, issue.1, pp.107-118, 2001. ,
DOI : 10.1287/opre.49.1.107.11191
A transformation for extracting new descriptors of shape, Proc. Symp. Models for Perception of Speech and Visual Form, pp.362-380, 1967. ,
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
Asynchronous deterministic rendezvous in graphs, Theoretical Computer Science, vol.355, issue.3, pp.315-326, 2006. ,
DOI : 10.1016/j.tcs.2005.12.016
Finding the Medial Axis of a Simple Polygon in Linear Time, Discrete Comput. Geom, pp.382-391, 1995. ,
How to meet asynchronously (almost) everywhere, Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp.22-30, 2010. ,
DOI : 10.1145/2344422.2344427
URL : https://hal.archives-ouvertes.fr/hal-00418775
Deterministic Rendezvous in Graphs, Algorithmica, vol.46, issue.1, pp.69-96, 2006. ,
DOI : 10.1007/s00453-006-0074-2
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
Rendezvous Search on the Line, Operations Research, vol.47, issue.6, pp.974-976, 1999. ,
DOI : 10.1287/opre.47.6.974
Optimal shortest path queries in a simple polygon, Journal of Computer and System Sciences, vol.39, issue.2, pp.126-152, 1989. ,
DOI : 10.1016/0022-0000(89)90041-X
An Optimal Algorithm for Euclidean Shortest Paths in the Plane, SIAM Journal on Computing, vol.28, issue.6, pp.2215-2256, 1997. ,
DOI : 10.1137/S0097539795289604
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring, Theoretical Computer Science, vol.411, issue.34-36, pp.3235-3246, 2010. ,
DOI : 10.1016/j.tcs.2010.05.020
URL : https://hal.archives-ouvertes.fr/hal-00519069
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
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
Mobile agent rendezvous in a ring, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., pp.592-599 ,
DOI : 10.1109/ICDCS.2003.1203510
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
The medial axis of a simple polygon, Mathematical Foundations of Computer ScienceLNCS), vol.53, pp.443-450, 1977. ,
DOI : 10.1007/3-540-08353-7_166
The strategy of conflict, 1960. ,
Asynchronous Deterministic Rendezvous on the??Line, SOFSEM, vol.43, pp.497-508 ,
DOI : 10.1007/3-540-61440-0_163
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
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