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

P. Bahl and V. N. Padmanabhan, RADAR: an in-building RF-based user location and tracking system, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), pp.775-784, 2000.
DOI : 10.1109/INFCOM.2000.832252

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

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. 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

Y. Gu, A. Lo, and I. Niemegeers, A survey of indoor positioning systems for wireless personal networks, IEEE Communications Surveys & Tutorials, vol.11, issue.1, pp.13-32, 2009.
DOI : 10.1109/SURV.2009.090103

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

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

R. Olsen, J. Figueiras, J. Rasmussen, and H. Schwefel, How Precise Should Localization Be? A Quantitative Analysis of the Impact of Delay and Mobility on Reliability of Location Information, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010, pp.1-6, 2010.
DOI : 10.1109/GLOCOM.2010.5683940

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

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