M. Aigner and M. Fromme, A game of cops and robbers, Discrete Applied Mathematics, vol.8, issue.1, pp.1-12, 1984.
DOI : 10.1016/0166-218X(84)90073-8

D. Bienstock, Graph searching, path-width, tree-width and related problems (A survey), DIMACS Ser. Discret. Math. Theor. Comput. Sci, vol.5, p.3349, 1991.
DOI : 10.1090/dimacs/005/02

A. Bonato and R. J. Nowakowski, The game of cops and robbers on graphs, 2011.
DOI : 10.1090/stml/061

B. Bosek, P. Gordinowicz, J. Grytczuk, N. Nisse, J. Sokóo-l et al., Localization game on geometric and planar graphs, p.manuscript, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01620365

A. Brandt, J. Diemunsch, C. Erbes, J. Legrand, and C. Moffatt, Locating a robber on a tree, p.manuscript, 2015.

J. Carraher, I. Choi, M. Delcourt, L. H. Erickson, and D. B. West, Locating a robber on a graph via distance queries, Theoretical Computer Science, vol.463, pp.54-61, 2012.
DOI : 10.1016/j.tcs.2012.06.035

I. Charon, O. Hudry, and A. Lobstein, Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard, Theoretical Computer Science, vol.290, issue.3, pp.2109-2120, 2003.
DOI : 10.1016/S0304-3975(02)00536-4

G. Cohen, I. Honkala, A. Lobstein, and G. Zémor, On identifying codes, Proceedings of DIMACS Workshop on Codes and Association Schemes '99, pp.97-109, 2001.
DOI : 10.1090/dimacs/056/07

F. Foucaud, R. Klasing, and P. J. Slater, Centroidal bases in graphs, Networks, vol.4, issue.2, pp.96-108, 2014.
DOI : 10.1002/(SICI)1097-0037(199912)34:4<303::AID-NET10>3.0.CO;2-#

URL : https://hal.archives-ouvertes.fr/hal-01428804

F. Foucaud, G. B. Mertzios, R. Naserasr, A. Parreau, and P. , Identification, location???domination and metric dimension on interval and permutation graphs. I. Bounds, Theoretical Computer Science, vol.668, pp.43-58, 2017.
DOI : 10.1016/j.tcs.2017.01.006

URL : https://hal.archives-ouvertes.fr/hal-01198784

F. Foucaud, G. B. Mertzios, R. Naserasr, A. Parreau, and P. , Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity, Algorithmica, vol.103, issue.1, pp.914-944, 2017.
DOI : 10.1007/978-3-540-30179-0_16

URL : https://hal.archives-ouvertes.fr/hal-01198784

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

URL : https://doi.org/10.1016/j.tcs.2008.02.040

F. Harary and R. A. Melter, On the metric dimension of a graph, Ars Combin, vol.2, pp.191-195, 1976.

J. Haslegrave, R. A. Johnson, and S. Koch, Locating a robber with multiple probes, Discrete Mathematics, vol.341, issue.1, p.6482, 2017.
DOI : 10.1016/j.disc.2017.08.028

URL : http://arxiv.org/pdf/1703.06482

M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Transactions on Information Theory, vol.44, issue.2, p.599611, 1998.
DOI : 10.1109/18.661507

A. Lobstein, Watching systems, identifying, locatingdominating and discriminating codes in graphs: A bibliography, Available at

R. J. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Mathematics 43, pp.235-239, 1983.
DOI : 10.1016/0012-365X(83)90160-7

A. Quillot, Jeux et pointes xes sur les graphes, pp.131-145, 1978.

S. Seager, Locating a robber on a graph, Discrete Math, pp.3265-3269, 2012.

S. Seager, Locating a backtracking robber on a tree, Theoretical Computer Science, vol.539, pp.28-37, 2014.
DOI : 10.1016/j.tcs.2014.04.019

P. D. Seymour and R. Thomas, Graph Searching and a Min-Max Theorem for Tree-Width, Journal of Combinatorial Theory, Series B, vol.58, issue.1, pp.22-33, 1993.
DOI : 10.1006/jctb.1993.1027

URL : https://doi.org/10.1006/jctb.1993.1027

P. J. Slater, Leaves of trees, Proc. Sixth Southeastern Conf. Combin., Graph Theory, Computing, Congressus Numer. 14, pp.549-559, 1975.

P. J. Slater, Domination and location in acyclic graphs, Networks, vol.1, issue.1, 1987.
DOI : 10.1145/321958.321964

P. J. Slater, Dominating and reference sets in a graph Poland E-mail address: bosek@tcs.uj.edu.pl Institute of Mathematics, Lodz University of Technology, Lód´Lód´z, Poland E-mail address: pgordin@p.lodz.pl Faculty of E-mail address: nicolas.nisse@inria.fr Faculty of, Journal of Mathematical and Physical Sciences Mathematics and Information Science Mathematics and Information Science, vol.22, issue.445455, pp.30-348, 1988.