L. Babai, On the Complexity of Canonical Labeling of Strongly Regular Graphs, SIAM Journal on Computing, vol.9, issue.1, pp.212-216, 1980.
DOI : 10.1137/0209018

Z. Beerliova, F. Eberhard, T. Erlebach, A. Hall, M. Hoffmann et al., Network Discovery and Verification, IEEE Journal on Selected Areas in Communications, vol.24, issue.12, pp.2168-2181, 2006.
DOI : 10.1109/JSAC.2006.884015
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.9121

K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, vol.13, issue.3, pp.335-379, 1976.
DOI : 10.1016/S0022-0000(76)80045-1

N. Bousquet, A. Lagoutte, Z. Li, A. Parreau, and S. Thomassé, Identifying codes in hereditary classes of graphs and VC-dimension. Manuscript, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01038012

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. Chartrand, L. Eroh, M. Johnson, and O. Oellermann, Resolvability in graphs and the metric dimension of a graph, Discrete Applied Mathematics, vol.105, issue.1-3, pp.1-399, 2000.
DOI : 10.1016/S0166-218X(00)00198-0

C. Colbourn, P. J. Slater, and L. K. Stewart, Locating-dominating sets in series-parallel networks, Congr. Numer, vol.56, pp.135-162, 1987.

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765

J. Diaz, O. Pottonen, M. Serna, and E. Jan-van-leeuwen, On the Complexity of Metric Dimension, Proc. ESA 2012, pp.419-430, 2012.
DOI : 10.1007/978-3-642-33090-2_37

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity, 2013.
DOI : 10.1007/978-1-4471-5559-1

L. Epstein, A. Levin, and G. J. Woeginger, The (weighted) metric dimension of graphs: hard and easy cases. Algorithmica

H. Fernau, P. Heggernes, P. Van-'t-hof, D. Meister, and R. Saei, Computing the metric dimension for chain graphs, Information Processing Letters, vol.115, issue.9, pp.671-676, 2015.
DOI : 10.1016/j.ipl.2015.04.006

C. Flotow, On powers of m-trapezoid graphs, Discrete Applied Mathematics, vol.63, issue.2, pp.187-192, 1995.
DOI : 10.1016/0166-218X(95)00062-V

F. Foucaud, Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes, Journal of Discrete Algorithms, vol.31, pp.48-68, 2015.
DOI : 10.1016/j.jda.2014.08.004
URL : https://hal.archives-ouvertes.fr/hal-00923356

F. Foucaud, S. Gravier, R. Naserasr, A. Parreau, and P. Valicov, Identifying Codes in Line Graphs, Journal of Graph Theory, vol.12, issue.1, pp.425-448, 2013.
DOI : 10.1002/jgt.21686
URL : https://hal.archives-ouvertes.fr/hal-00605406

F. Foucaud, G. 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.103, issue.1, 2014.
DOI : 10.1007/s00453-016-0184-1
URL : https://hal.archives-ouvertes.fr/hal-01198784

F. Foucaud, R. Naserasr, A. Parreau, and P. Valicov, On powers of interval graphs and their orders
URL : https://hal.archives-ouvertes.fr/hal-01198830

M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, 1979.

M. C. Golumbic, Algorithmic graph theory and perfect graphs, 2004.

S. Gravier, R. Klasing, and J. , Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs, Algorithmic Oper. Res, vol.3, issue.1, pp.43-50, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00306997

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

S. Hartung and T. Berlin, Exploring parameter spaces in coping with computational intractability

S. Hartung and A. Nichterlein, On the Parameterized and Approximation Hardness of Metric Dimension, 2013 IEEE Conference on Computational Complexity, pp.266-276, 2013.
DOI : 10.1109/CCC.2013.36

S. Hoffmann and E. Wanke, Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete, Proc. ALGOSENSORS, vol.2012, pp.90-92, 2012.
DOI : 10.1007/978-3-642-36092-3_10
URL : http://arxiv.org/abs/1306.2187

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.
DOI : 10.1007/978-1-4684-2001-2_9

J. H. Kim, O. Pikhurko, J. Spencer, and O. Verbitsky, How complex are random graphs in First Order logic? Random Struct, Alg, vol.26, issue.12, pp.119-145, 2005.

P. Manuel, B. Rajan, I. Rajasingh, C. Monica, and M. , On minimum metric dimension of honeycomb networks, Journal of Discrete Algorithms, vol.6, issue.1, pp.20-27, 2008.
DOI : 10.1016/j.jda.2006.09.002

T. Müller and J. Sereni, Identifying and Locating???Dominating Codes in (Random) Geometric Networks, Combinatorics, Probability and Computing, vol.22, issue.06, pp.925-952, 2009.
DOI : 10.1016/S0304-3975(02)00536-4

R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

A. Raychaudhuri, On powers of interval graphs and unit interval graphs, Congr. Numer, vol.59, pp.235-242, 1987.

P. J. Slater, Leaves of trees, Congr. Numer, vol.14, pp.549-559, 1975.

P. J. Slater, Domination and location in acyclic graphs, Networks, vol.1, issue.1, pp.55-64, 1987.
DOI : 10.1002/net.3230170105

P. J. Slater, Dominating and reference sets in a graph, J. of Math. and Phys. Sci, vol.22, issue.4, pp.445-455, 1988.

J. Suomela, Approximability of identifying codes and locating???dominating codes, Information Processing Letters, vol.103, issue.1, pp.28-33, 2007.
DOI : 10.1016/j.ipl.2007.02.001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.6365

R. Ungrangsi, A. Trachtenberg, and D. Starobinski, An Implementation of Indoor Location Detection Systems Based on Identifying Codes, Proc. INTELLCOMM 2004, pp.175-189, 2004.
DOI : 10.1007/978-3-540-30179-0_16