M. Aigner and M. Fromme, A game of cops and robbers, Discrete Appl. Math, vol.8, pp.1-12, 1984.

P. Bahl and V. N. Padmanabhan, RADAR: an in-building RF-based user location and tracking system, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies Proceedings, pp.775-784, 2000.

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.

A. Bonato and R. J. Nowakowski, The game of cops and robbers on graphs, Student Mathematical Library, vol.61, 2011.

A. Brandt, J. Diemunsch, C. Erbes, J. Legrand, and C. Moffatt, Locating a robber on a tree, 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.

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.

G. Cohen, I. Honkala, A. Lobstein, and G. Zémor, On Identifying Codes, Proceedings of DIMACS Workshop on Codes and Association Schemes '99, vol.56, pp.97-109, 2001.

F. V. Fomin and D. M. Thilikos, An annotated bibliography on guaranteed graph searching, Theor. Computer Science, vol.399, pp.236-245, 2008.

Y. Gu, A. Lo, and I. Niemegeers, A Survey of Indoor Positioning Systems for Wireless Personal Networks, IEEE Communications Surveys & Tutorials, issue.1, pp.13-32, 2009.

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

R. A. Johnson and S. Koch, Subgraphs and Colourability of Locatable Graphs

R. J. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Mathematics, vol.43, pp.235-239, 1983.

R. Olsen, J. Figueiras, J. Rasmussen, and H. Schwefel, How precise should localization be? A quantitative analysis of the impact of the delay and mobility on reliability of location information, Proceedings of IEEE GLOBECOM, pp.1-6, 2010.

A. Quillot, Jeux et pointes xes sur les graphes. Th ese de 3 eme cycle, pp.131-145, 1978.

S. Seager, Locating a robber on a graph, Discrete Math, vol.312, pp.3265-3269, 2012.
DOI : 10.1016/j.disc.2012.07.029
URL : https://doi.org/10.1016/j.disc.2012.07.029

S. Seager, Locating a backtracking robber on a tree, Theor. 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, J. Combin. Theory Ser. B, vol.58, 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, vol.14, pp.549-559, 1975.