G. Argiroffo, S. Bianchi, Y. Lucarini, and A. Wagler, Polyhedra associated with identifying codes in graphs, vol.245, pp.16-27, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02017458

G. Argiroffo, S. Bianchi, and A. , Wagler: Study of identifying code polyhedra for some families of split graphs, Lecture Notes in Computer Science, vol.8596, pp.13-25, 2014.

G. Argiroffo, S. Bianchi, and A. Wagler, A polyhedral approach to locatingdominating sets in graphs, Electronic Notes in Discrete Math, vol.50, pp.89-94, 2015.

N. Bertrand, I. Charon, O. Hudry, and A. Lobstein, Identifying and locating dominating codes on chains and cycles, Eur. J. Comb, vol.25, pp.969-987, 2004.

I. Charon, O. Hudry, and A. Lobstein, Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard, Theor. Comp. Sc, vol.290, pp.2109-2120, 2003.

M. Chellali and N. J. Rad, Locating-total domination critical graphs Australasian, J. Combinatorics, vol.160, pp.227-234, 2009.

C. Chen, C. Lu, and Z. Miao, Identifying codes and locating-dominating sets on paths and cycles, Discrete Applied Mathematics, vol.159, pp.1540-1547, 2011.

F. Foucaud, The complexity of the identifying code problem in restricted graph classes, Comb. Algorithms (IWOCA 2013), vol.8288, pp.150-163, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00960564

S. Gravier and J. Moncel, On graphs having a V {x}-set as an identifying code, Discrete Mathematics, vol.307, pp.432-434, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00182314

S. Gravier, J. Moncel, and A. Semri, Identifying codes in cycles, European Journal of Combinatorics, vol.27, pp.767-776, 2006.

T. W. Haynes, M. A. Henning, and J. Howard, Locating and total-dominating sets in trees, Discrete Applied Mathematics, vol.154, pp.1293-1300, 2006.

M. A. Henning and N. J. Rad, Locating-total domination in graphs, Discrete Applied Mathematics, vol.160, pp.1986-1993, 2012.

M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Trans. Inform. Theory, vol.44, pp.599-611, 1998.

A. Lobstein, Watching systems, identifying, locating-dominating and discriminating codes in graphs

T. Mueller and J. S. Sereni, Identifying and locating-dominating codes in (random) geometric networks, Comb. Probab. Comput, vol.18, issue.6, pp.925-952, 2009.

A. Pandey, Open Neighborhood Locating-Dominating Set in Graphs: Complexity and Algorithms, 2015.

A. Sassano, On the facial structure of the set covering polytope, Mathematical Programming, vol.44, pp.181-202, 1989.

S. J. Seo and P. J. Slater, Open neighborhood locating dominating sets, Australasian Journal of Combinatorics, vol.46, pp.109-119, 2010.

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