| Publication | Date of Publication | Type |
|---|
| On the ensemble of optimal identifying codes in a twin-free graph | 2016-04-11 | 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 |
| Weighted perfect codes in Lee metric | 2013-10-10 | Paper |
| Minimum sizes of identifying codes in graphs differing by one vertex | 2013-08-02 | Paper |
| Watching systems in the King grid | 2013-06-26 | Paper |
| Locally identifying colourings for graphs with given maximum degree | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3094530 | 2011-10-25 | Paper |
| An optimal strongly identifying code in the infinite triangular grid | 2010-08-12 | 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 |
| On a new class of identifying codes in graphs | 2010-01-29 | Paper |
| Weighted codes in Lee metrics | 2009-10-14 | Paper |
| On identifying codes in the hexagonal mesh | 2009-07-09 | Paper |
| On \(r\)-locating-dominating sets in paths | 2009-06-17 | Paper |
| On identifying codes in the King grid that are robust against edge deletions | 2009-04-07 | Paper |
| On robust and dynamic identifying codes | 2008-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3536272 | 2008-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5429563 | 2007-11-30 | Paper |
| On identifying codes that are robust against edge changes | 2007-07-16 | Paper |
| Structural properties of twin-free graphs | 2007-03-12 | Paper |
| On codes identifying vertices in the two-dimensional square lattice with diagonals | 2007-01-09 | Paper |
| A family of optimal identifying codes in \(\mathbb Z^2\) | 2006-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3412137 | 2006-12-05 | Paper |
| An optimal locating-dominating set in the infinite triangular grid | 2006-10-30 | Paper |
| On locating--dominating sets in infinite grids | 2006-03-22 | Paper |
| Two families of optimal identifying codes in binary Hamming spaces | 2005-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667607 | 2005-04-20 | Paper |
| On Identifying Codes in the Triangular and Square Grids | 2005-02-21 | Paper |
| An optimal edge-robust identifying code in the triangular lattice | 2005-01-03 | Paper |
| On identification in the triangular grid | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474266 | 2004-08-04 | Paper |
| Codes for identification in the king lattice | 2004-03-04 | Paper |
| The minimum density of an identifying code in the king lattice. | 2004-02-14 | Paper |
| Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori | 2003-09-09 | Paper |
| On the complexity of the identification problem in Hamming spaces | 2003-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4948746 | 2003-08-06 | Paper |
| On the identification of sets of points in the square lattice | 2003-03-17 | 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 |
| On strongly identifying codes | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4510800 | 2002-07-22 | Paper |
| Short dominating paths and cycles in the binary hypercube | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529532 | 2002-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4330632 | 2002-05-14 | Paper |
| Multicovering Bounds from Relative Covering Radii | 2002-04-23 | Paper |
| On the probability of undetected error for binary codes used for combined correction and detection | 2002-04-03 | Paper |
| Bounds for the multicovering radii of Reed-Muller codes with applications to stream ciphers | 2002-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502621 | 2002-03-18 | Paper |
| General bounds for identifying codes in some infinite regular graphs | 2002-02-07 | Paper |
| Bounds on identifying codes | 2002-01-08 | Paper |
| On codes identifying sets of vertices in Hamming spaces | 2001-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741420 | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2717197 | 2001-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2713644 | 2001-06-10 | Paper |
| Bounds for Codes Identifying Vertices in the Hexagonal Grid | 2001-03-19 | Paper |
| On relations between covering radius and dual distance | 2000-09-07 | Paper |
| The probability of undetected error can have several local maxima | 2000-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954408 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242020 | 2000-02-01 | Paper |
| New bounds for codes identifying vertices in graphs | 1999-03-31 | Paper |
| Long packing and covering codes | 1998-11-04 | Paper |
| On covering radius and discrete Chebyshev polynomials | 1998-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352782 | 1998-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365138 | 1997-10-30 | Paper |
| Long binary narrow-sense BCH codes are normal | 1997-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4342497 | 1997-06-22 | Paper |
| Weighted coverings and packings | 1997-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882552 | 1996-06-18 | Paper |
| Football Pools--A Game for Mathematicians | 1996-05-09 | Paper |
| Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points | 1996-01-24 | Paper |
| On the normality of multiple covering codes | 1994-11-22 | Paper |
| On \((p,1)\)-subnormal \(q\)-ary covering codes | 1994-11-22 | Paper |
| Normal and abnormal codes | 1994-10-04 | Paper |
| A Graham-Sloane type construction for \(s\)-surjective matrices | 1994-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4276323 | 1994-01-27 | Paper |
| Bounds for binary multiple covering codes | 1993-08-29 | Paper |
| On lengthening of covering codes | 1993-01-16 | Paper |
| All binary codes with covering radius one are subnormal | 1992-06-28 | Paper |
| On (k, t)-subnormal covering codes | 1991-01-01 | Paper |
| Bounds for abnormal binary codes with covering radius one | 1991-01-01 | Paper |
| Modified bounds for covering codes | 1991-01-01 | Paper |
| Lower bounds for q-ary covering codes | 1990-01-01 | Paper |
| A new construction for covering codes | 1989-01-01 | Paper |
| Lower bounds for binary covering codes | 1988-01-01 | Paper |
| Some lower bounds for constant weight codes | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3765793 | 1987-01-01 | Paper |
| A modification of the Zinoviev lower bound for constant weight codes | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3722417 | 1985-01-01 | Paper |
