Frédéric Maffray, Julien Moncel, and Ahmed Semri. Locating-domination and identifying codes in trees, Australasian Journal of Combinatorics, vol.39, pp.219-232, 2007. ,
A linear algorithm for minimum 1-identifying codes in oriented trees, Discrete Applied Mathematics, vol.154, issue.8, pp.1246-1253, 2006. ,
DOI : 10.1016/j.dam.2005.11.007
URL : https://hal.archives-ouvertes.fr/hal-00360156
Identifying and locating-dominating codes: NP-completeness results for directed graphs, IEEE Transactions on Information Theory, vol.48, issue.8, pp.2192-2200, 2002. ,
DOI : 10.1109/TIT.2002.800490
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
A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid, Electron. J. Combin, vol.16, issue.16, 2009. ,
New bounds on the minimum density of an identifying code for the infinite hexagonal grid, Discrete Applied Mathematics, vol.161, issue.18, pp.2910-2924, 2013. ,
DOI : 10.1016/j.dam.2013.06.002
Identifying codes for infinite triangular grids with a finite number of rows, Discrete Mathematics, vol.340, issue.7, pp.1584-1597, 2017. ,
DOI : 10.1016/j.disc.2017.02.015
URL : https://hal.archives-ouvertes.fr/hal-01358064
Minimum density of identifying codes of king grids, Electronic Notes in Discrete Mathematics, vol.62, pp.51-56, 2017. ,
DOI : 10.1016/j.endm.2017.10.010
URL : https://hal.archives-ouvertes.fr/hal-01634305
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
Identifying Codes in Line Graphs, Journal of Graph Theory, vol.12, issue.1, pp.425-448, 2013. ,
DOI : 10.1007/BF01593791
URL : https://hal.archives-ouvertes.fr/hal-00605406
Extremal graphs for the identifying code problem, European Journal of Combinatorics, vol.32, issue.4, pp.628-638, 2011. ,
DOI : 10.1016/j.ejc.2011.01.002
URL : https://hal.archives-ouvertes.fr/hal-00477467
A guide to the theory of NP-completeness, Series of Books in the Mathematical Sciences, 1979. ,
Some simplified np-complete graph problems, Theoretical Computer Science, vol.1, issue.3, pp.237-267, 1976. ,
On graphs having a <mml:math altimg="si3.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>V</mml:mi><mml:mo>???</mml:mo><mml:mo stretchy="false">{</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">}</mml:mo></mml:math> set as an identifying code, Discrete Mathematics, vol.307, issue.3-5, pp.432-434, 2007. ,
DOI : 10.1016/j.disc.2005.09.035
A quantitative analysis of secondary rna structure using domination based parameters on trees, BMC Bioinformatics, vol.7, issue.1, p.108, 2006. ,
DOI : 10.1186/1471-2105-7-108
Reducibility among Combinatorial Problems, pp.85-103, 1972. ,
On a new class of codes for identifying vertices in graphs, IEEE Trans. Information Theory, vol.44, issue.2, pp.599-611, 1998. ,
Joint monitoring and routing in wireless sensor networks using robust identifying codes, Fourth International Conference on Broadband Communications, Networks and Systems, pp.10-14, 2007. ,
Joint monitoring and routing in wireless sensor networks using robust identifying codes, pp.415-432, 2009. ,
DOI : 10.1109/broadnets.2007.4550425
URL : http://people.bu.edu/staro/JournalVersionRevA.pdf
Robust location detection in emergency sensor networks, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 2003. ,
DOI : 10.1109/INFCOM.2003.1208941
URL : http://www.ieee-infocom.org/2003/papers/26_01.PDF
A simplified NP-complete satisfiability problem, Discrete Applied Mathematics, vol.8, issue.1, pp.85-89, 1984. ,
DOI : 10.1016/0166-218X(84)90081-7