| Publication | Date of Publication | Type |
|---|
| Some results about a conjecture on identifying codes in complete suns | 2023-11-27 | Paper |
| Some rainbow problems in graphs have complexity equivalent to satisfiability problems | 2023-11-27 | Paper |
| Locating-Domination and Identification | 2021-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133053 | 2020-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133215 | 2020-11-12 | Paper |
| The compared costs of domination location-domination and identification | 2020-01-08 | Paper |
| Unique (optimal) solutions: complexity results for identifying and locating-dominating codes | 2019-03-26 | Paper |
| More results on the complexity of domination problems in graphs | 2018-08-24 | Paper |
| On the ensemble of optimal identifying codes in a twin-free graph | 2016-04-11 | Paper |
| More results on the complexity of identifying problems in graphs | 2016-03-31 | Paper |
| Maximum size of a minimum watching system and the graphs achieving the bound | 2015-09-22 | Paper |
| On the ensemble of optimal dominating and locating-dominating codes in a graph | 2015-06-02 | Paper |
| On the number of optimal identifying codes in a twin-free graph | 2014-11-28 | Paper |
| Minimum sizes of identifying codes in graphs differing by one edge | 2014-06-20 | Paper |
| Watching systems in graphs: an extension of identifying codes | 2014-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2864455 | 2013-12-06 | Paper |
| Minimum sizes of identifying codes in graphs differing by one vertex | 2013-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2918543 | 2012-10-08 | Paper |
| On the sizes of graphs and their powers: the undirected case | 2011-10-27 | Paper |
| Adaptive identification in Torii in the King lattice | 2011-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3001191 | 2011-05-31 | Paper |
| Complexity results for identifying codes in planar graphs | 2011-05-20 | Paper |
| On the existence of a cycle of length at least 7 in a (1,≤ 2)-twin-free graph | 2011-05-09 | Paper |
| New identifying codes in the binary Hamming space | 2010-04-27 | Paper |
| Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs | 2010-03-10 | Paper |
| Erratum to ``Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. | 2010-03-08 | Paper |
| Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity | 2009-02-19 | Paper |
| Adaptive identification in graphs | 2008-12-08 | Paper |
| Discriminating codes in (bipartite) planar graphs | 2008-05-29 | Paper |
| Links Between Discriminating and Identifying Codes in the Binary Hamming Space | 2008-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5429563 | 2007-11-30 | Paper |
| On the Structure of Identifiable Graphs | 2007-05-29 | Paper |
| Structural properties of twin-free graphs | 2007-03-12 | Paper |
| Extremal cardinalities for identifying and locating-dominating codes in graphs | 2007-02-13 | Paper |
| On codes identifying vertices in the two-dimensional square lattice with diagonals | 2007-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5487899 | 2006-09-13 | Paper |
| A linear algorithm for minimum 1-identifying codes in oriented trees | 2006-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3025212 | 2005-07-13 | Paper |
| Identifying and locating-dominating codes: NP-completeness results for directed graphs | 2005-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4664649 | 2005-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4659582 | 2005-03-21 | Paper |
| Identifying and locating-dominating codes on chains and cycles | 2004-10-13 | Paper |
| The minimum density of an identifying code in the king lattice. | 2004-02-14 | Paper |
| On the complexity of the identification problem in Hamming spaces | 2003-09-01 | Paper |
| Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. | 2003-08-17 | Paper |
| On generalized concatenated constructions of perfect binary nonlinear codes | 2003-02-02 | Paper |
| On the density of identifying codes in the square lattice | 2002-12-10 | Paper |
| On identifying codes in binary Hamming spaces | 2002-09-12 | Paper |
| Intersection matrices for partitions by binary perfect codes | 2002-08-04 | Paper |
| Identifying codes with small radius in some infinite regular graphs | 2002-04-25 | Paper |
| General bounds for identifying codes in some infinite regular graphs | 2002-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2717197 | 2001-09-18 | Paper |
| Bounds for Codes Identifying Vertices in the Hexagonal Grid | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501027 | 2000-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954410 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954432 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249639 | 1999-06-17 | Paper |
| New bounds for codes identifying vertices in graphs | 1999-03-31 | Paper |
| Covering radius 1985-1994 | 1997-10-20 | Paper |
| On new perfect binary nonlinear codes | 1997-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4342497 | 1997-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038762 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023377 | 1993-01-23 | Paper |
| On perfect arithmetic codes | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484769 | 1990-01-01 | Paper |
| The hardness of solving subset sum with preprocessing | 1990-01-01 | Paper |
| The hardness of solving subset sum with preprocessing | 1990-01-01 | Paper |
| On normal and subnormal q-ary codes | 1989-01-01 | Paper |
| On modular weights in arithmetic codes | 1988-01-01 | Paper |
| Comments on "A note on perfect arithmetic codes | 1988-01-01 | Paper |
| Sur la complexité d'un problème de codage | 1987-01-01 | Paper |
| Further results on the covering radius of codes | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798666 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3748199 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758721 | 1984-01-01 | Paper |
