S. Alpern and S. Gal, The theory of search games and rendezvous, International Series in Operations Research & Management Science, vol.55, 2002.

R. A. Baeza-yates, J. C. Culberson, and G. J. Rawlins, Searching with uncertainty extended abstract, Scandinavian Workshop on Algorithm Theory, SWAT 1988, pp.176-189, 1988.
DOI : 10.1007/3-540-19487-8_20

R. A. Baeza-yates, J. C. Culberson, and G. J. Rawlins, Searching in the Plane, Information and Computation, vol.106, issue.2, pp.234-252, 1993.
DOI : 10.1006/inco.1993.1054

R. A. Baeza-yates and R. Schott, Parallel searching in the plane, Computational Geometry, vol.5, issue.3, pp.143-154, 1995.
DOI : 10.1016/0925-7721(95)00003-R

J. Barajas and O. Serra, The lonely runner with seven runners, Electr. J. Comb, vol.15, issue.1, 2008.

A. Beck, On the linear search problem, Israel Journal of Mathematics, vol.2, issue.4, pp.221-228, 1964.
DOI : 10.1007/BF02759737

R. Bellman, An Optimal Search, SIAM Review, vol.5, issue.3, pp.274-274, 1963.
DOI : 10.1137/1005070

M. A. Bender, A. Fernández, D. Ron, A. Sahai, and S. P. Vadhan, The power of a pebble, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.1-21, 2002.
DOI : 10.1145/276698.276759

M. A. Bender and D. K. 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

P. Bose, J. D. Carufel, and S. Durocher, Searching on a line: A complete characterization of the optimal solution, Theoretical Computer Science, vol.569, pp.24-42, 2015.
DOI : 10.1016/j.tcs.2014.12.007

M. Chrobak, L. G?sieniec, T. Gorry, R. Martin, G. F. Italiano et al., Group Search on the Line, Theory and Practice of Computer Science, SOFSEM 2015, pp.164-176, 2015.
DOI : 10.1007/978-3-662-46078-8_14

J. Czyzowicz, L. G?sieniec, T. Gorry, E. Kranakis, R. Martin et al., Evacuating Robots via Unknown Exit in a Disk, Distributed Computing, DISC 2014, pp.122-136, 2014.
DOI : 10.1007/978-3-662-45174-8_9

J. Czyzowicz, L. G?sieniec, A. Kosowski, and E. Kranakis, Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds, ESA 2011, pp.701-712, 2011.
DOI : 10.1007/978-3-642-23719-5_59
URL : https://hal.archives-ouvertes.fr/hal-00646910

D. Dereniowski, Y. Disser, A. Kosowski, D. Paj?k, and P. Uzna?ski, Fast collaborative graph exploration, Information and Computation, vol.243, pp.37-49, 2015.
DOI : 10.1016/j.ic.2014.12.005
URL : https://hal.archives-ouvertes.fr/hal-01251826

G. Dudek, K. Romanik, and S. Whitesides, Localizing a Robot with Minimum Travel, SIAM Journal on Computing, vol.27, issue.2, pp.583-604, 1998.
DOI : 10.1137/S0097539794279201

O. Feinerman, A. Korman, Z. Lotker, and J. Sereni, Collaborative search on the plane without communication, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, pp.77-86, 2012.
DOI : 10.1145/2332432.2332444
URL : https://hal.archives-ouvertes.fr/hal-01241094

F. V. Fomin and D. M. Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, issue.3, pp.236-245, 2008.
DOI : 10.1016/j.tcs.2008.02.040

P. Fraigniaud, L. G?sieniec, D. R. Kowalski, and A. Pelc, Collective tree exploration, Networks, vol.36, issue.3, pp.166-177, 2006.
DOI : 10.1002/net.20127

P. Jaillet and M. Stafford, Online Searching, Operations Research, vol.49, issue.4, pp.501-515, 2001.
DOI : 10.1287/opre.49.4.501.11227

A. Kawamura and Y. Kobayashi, Fence patrolling by mobile agents with distinct speeds, Distributed Computing, vol.37, issue.2, pp.147-154, 2015.
DOI : 10.1007/s00446-014-0226-3

P. J. Nahin, Chases and Escapes: The Mathematics of Pursuit and Evasion, 2012.

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

J. M. Wills, Zwei S???tze ???ber inhomogene diophantische Approximation von Irrationalzehlen, Monatshefte f???r Mathematik, vol.71, issue.3, pp.263-269, 1967.
DOI : 10.1007/BF01298332