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, pp.1217-1243, 2017.

Y. Ben-haim, S. Gravier, A. Lobstein, and J. Moncel, Adaptive identification in graphs, Journal of Combinatorial Theory, Series A, vol.115, issue.7, pp.1114-1126, 2008.

J. Bensmail, D. Mazauric, F. Mc-inerney, N. Nisse, and S. Pérennes, Sequential metric dimension, INRIA, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01717629

B. Bosek, P. Gordinowicz, J. Grytczuk, N. Nisse, J. Sokól et al., , 2017.

B. Bosek, P. Gordinowicz, J. Grytczuk, N. Nisse, J. Sokól et al., , 2017.

A. Brandt, J. Diemunsch, C. Erbes, J. Legrand, and C. Moffatt, 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, pp.54-61, 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, pp.132-158, 2017.

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

F. Foucaud, G. B. Mertzios, R. Naserasr, A. Parreau, and P. Valicov, Identification, location-domination and metric dimension on interval and permutation graphs. i. bounds. Theor, Comput. Sci, vol.668, pp.43-58, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01198784

F. Foucaud, G. B. Mertzios, R. Naserasr, A. Parreau, and P. Valicov, Identification, location-domination and metric dimension on interval and permutation graphs, II. algorithms and complexity. Algorithmica, vol.78, issue.3, pp.914-944, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01198784

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, pp.191-195, 1976.

S. Hartung and A. Nichterlein, On the parameterized and approximation hardness of metric dimension, Proceedings of the 28th Conference on Computational Complexity, pp.266-276, 2013.

J. Haslegrave, A. B. Richard, S. Johnson, and . Koch, Locating a robber with multiple probes, Discrete Mathematics, vol.341, issue.1, pp.184-193, 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, pp.599-611, 1998.

S. M. Seager, Locating a robber on a graph, Discrete Mathematics, issue.22, pp.3265-3269, 2012.

S. M. Seager, A sequential locating game on graphs, Ars Comb, vol.110, pp.45-54, 2013.

S. M. Seager, Locating a backtracking robber on a tree, Theor. Comput. Sci, vol.539, pp.28-37, 2014.

J. Peter and . Slater, Leaves of trees, Congressus Numerantium, pp.549-559, 1975.

J. Peter and . Slater, Domination and location in acyclic graphs, Networks, vol.17, issue.1, pp.55-64, 1987.