R. Belmonte, V. Fedor, P. A. Fomin, M. S. Golovach, and . Ramanujan, Metric dimension of bounded tree-length graphs, SIAM J. Discrete Math, vol.31, issue.2, p.12171243, 2017.

Y. Ben-haim, S. Gravier, A. Lobstein, and J. Moncel, Adaptive identication in graphs, Journal of Combinatorial Theory, Series A, vol.115, issue.7, p.11141126, 2008.

J. Bensmail, D. Mazauric, F. Mc-inerney, N. Nisse, and S. Pérennes, Sequential metric dimension, Proceedings of the 16th Workshop on Approximation and Online Algorithms, WAOA 2018, vol.11312, p.3650, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01883712

B. Bosek, P. Gordinowicz, J. Grytczuk, N. Nisse, J. Sokól et al., Centroidal localization game. Electronic Journal of Combinatorics, vol.25, issue.4, 2018.

B. Bosek, P. Gordinowicz, J. Grytczuk, N. Nisse, J. Sokól et al., Localization game on geometric and planar graphs, Discrete Applied Mathematics, vol.251, p.3039, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01620365

A. Brandt, J. Diemunsch, C. Erbes, J. Legrand, and C. Moatt, A robber locating strategy for trees, Discrete Applied Mathematics, vol.232, pp.99-106, 2017.

J. M. Carraher, I. Choi, M. Delcourt, L. H. Erickson, and D. B. West, Locating a robber on a graph via distance queries, Theor. Comput. Sci, vol.463, p.5461, 2012.

J. Díaz, O. Pottonen, M. J. Serna, and E. J. Van-leeuwen, Complexity of metric dimension on planar graphs, J. Comput. Syst. Sci, vol.83, issue.1, p.132158, 2017.

F. Foucaud, R. Klasing, and P. J. Slater, Centroidal bases in graphs, Networks, vol.64, issue.2, p.96108, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01428804

F. Foucaud, G. B. Mertzios, and R. Naserasr, Aline Parreau, and Petru Valicov. Identication, location-domination and metric dimension on interval and permutation graphs. i. bounds. Theor, Comput. Sci, vol.668, p.4358, 2017.

F. Foucaud, G. B. Mertzios, and R. Naserasr, Aline Parreau, and Petru Valicov. Identication, location-domination and metric dimension on interval and permutation graphs, II. algorithms and complexity. Algorithmica, vol.78, issue.3, p.914944, 2017.

M. R. Garey and D. S. Johnson, Computers and Intractability -A guide to NPcompleteness, 1979.

F. Harary and R. A. Melter, On the metric dimension of a graph, Ars Combinatoria, vol.2, 1976.

S. Hartung and A. Nichterlein, On the parameterized and approximation hardness of metric dimension, Proceedings of the 28th Conference on Computational Complexity, CCC, p.266276, 2013.

J. Haslegrave, A. B. Richard, S. Johnson, and . Koch, Locating a robber with multiple probes, Discrete Mathematics, vol.341, issue.1, p.184193, 2018.

G. Mark, K. Karpovsky, L. B. Chakrabarty, and . Levitin, On a new class of codes for identifying vertices in graphs, IEEE Trans. Information Theory, vol.44, issue.2, p.611, 1998.

S. M. Seager, Locating a robber on a graph

, Discrete Mathematics, vol.312, issue.22, p.32653269, 2012.

S. M. Seager, A sequential locating game on graphs, Ars Comb, vol.110, p.4554, 2013.

S. M. Seager, Locating a backtracking robber on a tree, Theor. Comput. Sci, vol.539, p.2837, 2014.

J. Peter and . Slater, Leaves of trees, Congressus Numerantium, No. XIV, p.549559, 1975.

J. Peter and . Slater, Domination and location in acyclic graphs, Networks, vol.17, issue.1, p.5564, 1987.