| Publication | Date of Publication | Type |
|---|
| Optimal local identifying and local locating-dominating codes | 2024-10-07 | Paper |
| The Levenshtein's sequence reconstruction problem and the length of the list | 2024-07-22 | Paper |
| New Optimal Results on Codes for Location in Graphs | 2023-06-13 | Paper |
| Optimal local identifying and local locating-dominating codes | 2023-02-26 | Paper |
| On the metric dimensions for sets of vertices | 2022-12-02 | Paper |
| The Levenshtein's Sequence Reconstruction Problem and the Length of the List | 2022-11-16 | Paper |
| On the unicyclic graphs having vertices that belong to all their (strong) metric bases | 2022-09-06 | Paper |
| On vertices contained in all or in no metric basis | 2022-08-04 | Paper |
| Improved lower bound for locating-dominating codes in binary Hamming spaces | 2022-01-19 | Paper |
| On Levenshtein’s Channel and List Size in Information Retrieval | 2021-07-23 | Paper |
| On the Metric Dimensions for Sets of Vertices | 2020-03-04 | Paper |
| The solid-metric dimension | 2020-01-16 | Paper |
| Tolerant location detection in sensor networks | 2019-12-17 | Paper |
| On \(t\)-revealing codes in binary Hamming spaces | 2019-09-17 | Paper |
| On a conjecture regarding identification in Hamming graphs | 2019-07-11 | Paper |
| Optimal bounds on codes for location in circulant graphs | 2019-07-10 | Paper |
| On Stronger Types of Locating-dominating Codes | 2019-05-23 | Paper |
| Solving Two Conjectures regarding Codes for Location in Circulant Graphs | 2019-01-21 | Paper |
| On {ℓ}-Metric Dimensions in Graphs | 2018-10-02 | Paper |
| On regular and new types of codes for location-domination | 2018-09-06 | Paper |
| Solving a Conjecture on Identification in Hamming Graphs | 2018-05-04 | Paper |
| Minimum Number of Input Clues in Robust Information Retrieval | 2017-07-28 | Paper |
| Codes for Information Retrieval With Small Uncertainty | 2017-06-08 | Paper |
| Information Retrieval With Varying Number of Input Clues | 2017-04-28 | Paper |
| Information retrieval and the average number of input clues | 2017-03-09 | Paper |
| The metric dimension for resolving several objects | 2016-07-27 | Paper |
| Information retrieval with unambiguous output | 2015-06-01 | Paper |
| Graphs where every k-subset of vertices is an identifying set | 2014-05-02 | Paper |
| An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid | 2014-03-10 | Paper |
| Optimal identification of sets of edges using 2-factors | 2014-01-22 | Paper |
| Tolerant identification with Euclidean balls | 2013-08-06 | Paper |
| Optimal identifying codes in cycles and paths | 2012-12-27 | Paper |
| Optimal lower bound for 2-identifying codes in the hexagonal grid | 2012-10-24 | Paper |
| Locally identifying colourings for graphs with given maximum degree | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3094530 | 2011-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3090475 | 2011-08-31 | Paper |
| Locating-dominating codes in paths | 2011-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3015586 | 2011-07-13 | Paper |
| Identification in \(\mathbb Z^2\) using Euclidean balls | 2011-03-10 | Paper |
| Improved bounds on identifying codes in binary Hamming spaces | 2010-04-27 | Paper |
| On a new class of identifying codes in graphs | 2010-01-29 | Paper |
| On identifying codes in the hexagonal mesh | 2009-07-09 | Paper |
| On the size of identifying codes in binary hypercubes | 2009-06-18 | Paper |
| Upper bounds for binary identifying codes | 2009-04-14 | Paper |
| On identifying codes in the King grid that are robust against edge deletions | 2009-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615964 | 2009-03-24 | Paper |
| Improved Upper Bounds on Binary Identifying Codes | 2008-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3536272 | 2008-11-21 | Paper |
| New bounds on binary identifying codes | 2008-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517160 | 2008-08-12 | Paper |
| On cages admitting identifying codes | 2008-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5437393 | 2008-01-18 | Paper |
| On identifying codes that are robust against edge changes | 2007-07-16 | Paper |
| Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice | 2007-05-24 | Paper |
| On robust identification in the square and King grids | 2007-01-09 | Paper |
| On locating--dominating sets in infinite grids | 2006-03-22 | Paper |
| On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes | 2005-09-16 | 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 |
| On identification in the triangular grid | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474243 | 2004-08-04 | Paper |
| Codes for identification in the king lattice | 2004-03-04 | Paper |
| Optimal codes for strong identification | 2003-05-19 | Paper |
| On the identification of sets of points in the square lattice | 2003-03-17 | Paper |
| On strongly identifying codes | 2002-08-29 | Paper |
| Families of optimal codes for strong identification | 2002-08-29 | Paper |
| Sequences of optimal identifying codes | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4510805 | 2002-07-16 | Paper |
| On the probability of undetected error for binary codes used for combined correction and detection | 2002-04-03 | Paper |
| On codes identifying sets of vertices in Hamming spaces | 2001-10-16 | Paper |
| Codes for strong identification | 2001-10-14 | Paper |
| On an algebraic method for bounding the covering radius | 2001-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520514 | 2001-02-26 | 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 |
| New Bounds On Covering Radius as a Function of Dual Distance | 1999-06-27 | Paper |
| On upper bounds for minimum distance and covering radius of non-binary codes | 1998-11-17 | Paper |
| On covering radius and discrete Chebyshev polynomials | 1998-05-13 | Paper |
