| Publication | Date of Publication | Type |
|---|
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
The Electronic Journal of Combinatorics | 2026-03-20 | Paper |
Optimal local identifying and local locating-dominating codes
Fundamenta Informaticae | 2024-10-07 | Paper |
The Levenshtein's sequence reconstruction problem and the length of the list
IEEE Transactions on Information Theory | 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
Discussiones Mathematicae Graph Theory | 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
Discrete Applied Mathematics | 2022-08-04 | Paper |
Improved lower bound for locating-dominating codes in binary Hamming spaces
Designs, Codes and Cryptography | 2022-01-19 | Paper |
On Levenshtein’s Channel and List Size in Information Retrieval
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
On the Metric Dimensions for Sets of Vertices
(available as arXiv preprint) | 2020-03-04 | Paper |
The solid-metric dimension
Theoretical Computer Science | 2020-01-16 | Paper |
Tolerant location detection in sensor networks
Advances in Applied Mathematics | 2019-12-17 | Paper |
On \(t\)-revealing codes in binary Hamming spaces
Information and Computation | 2019-09-17 | Paper |
On a conjecture regarding identification in Hamming graphs
The Electronic Journal of Combinatorics | 2019-07-11 | Paper |
Optimal bounds on codes for location in circulant graphs
Cryptography and Communications | 2019-07-10 | Paper |
On Stronger Types of Locating-dominating Codes
(available as arXiv preprint) | 2019-05-23 | Paper |
| On Stronger Types of Locating-dominating Codes | 2019-05-23 | Paper |
Solving Two Conjectures regarding Codes for Location in Circulant Graphs
(available as arXiv preprint) | 2019-01-21 | Paper |
| Solving Two Conjectures regarding Codes for Location in Circulant Graphs | 2019-01-21 | Paper |
On {ℓ}-Metric Dimensions in Graphs
Fundamenta Informaticae | 2018-10-02 | Paper |
On regular and new types of codes for location-domination
Discrete Applied Mathematics | 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
Fundamenta Informaticae | 2017-07-28 | Paper |
Codes for Information Retrieval With Small Uncertainty
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Information Retrieval With Varying Number of Input Clues
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Information retrieval and the average number of input clues
Advances in Mathematics of Communications | 2017-03-09 | Paper |
The metric dimension for resolving several objects
Information Processing Letters | 2016-07-27 | Paper |
Information retrieval with unambiguous output
Information and Computation | 2015-06-01 | Paper |
Graphs where every \(k\)-subset of vertices is an identifying set
(available as arXiv preprint) | 2014-05-02 | 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
Advances in Mathematics of Communications | 2014-03-10 | Paper |
Optimal identification of sets of edges using 2-factors
Discrete Mathematics | 2014-01-22 | Paper |
Tolerant identification with Euclidean balls
Networks | 2013-08-06 | Paper |
Optimal identifying codes in cycles and paths
Graphs and Combinatorics | 2012-12-27 | Paper |
Optimal lower bound for 2-identifying codes in the hexagonal grid
The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
Optimal lower bound for 2-identifying codes in the hexagonal grid
The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
Locally identifying colourings for graphs with given maximum degree
Discrete Mathematics | 2012-05-30 | Paper |
| On vertex-robust identifying codes of level three. | 2011-10-25 | Paper |
| Locating-dominating codes in cycles | 2011-08-31 | Paper |
Locating-dominating codes in paths
Discrete Mathematics | 2011-08-09 | Paper |
| On location-domination of set of vertices in cycles and paths | 2011-07-13 | Paper |
Identification in \(\mathbb Z^2\) using Euclidean balls
Discrete Applied Mathematics | 2011-03-10 | Paper |
Improved bounds on identifying codes in binary Hamming spaces
European Journal of Combinatorics | 2010-04-27 | Paper |
On a new class of identifying codes in graphs
Information Processing Letters | 2010-01-29 | Paper |
On identifying codes in the hexagonal mesh
Information Processing Letters | 2009-07-09 | Paper |
On the size of identifying codes in binary hypercubes
Journal of Combinatorial Theory. Series A | 2009-06-18 | Paper |
Upper bounds for binary identifying codes
Advances in Applied Mathematics | 2009-04-14 | Paper |
On identifying codes in the King grid that are robust against edge deletions
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On identifying codes in the King grid that are robust against edge deletions
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
| Locating vertices using codes | 2009-03-24 | Paper |
Improved Upper Bounds on Binary Identifying Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| scientific article; zbMATH DE number 5370111 (Why is no real title available?) | 2008-11-21 | Paper |
New bounds on binary identifying codes
Discrete Applied Mathematics | 2008-09-29 | Paper |
| On graphs admitting codes identifying sets of vertices | 2008-08-12 | Paper |
On cages admitting identifying codes
European Journal of Combinatorics | 2008-04-22 | Paper |
| scientific article; zbMATH DE number 5228468 (Why is no real title available?) | 2008-01-18 | Paper |
On identifying codes that are robust against edge changes
Information and Computation | 2007-07-16 | Paper |
Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
Graphs and Combinatorics | 2007-05-24 | Paper |
On robust identification in the square and King grids
Discrete Applied Mathematics | 2007-01-09 | Paper |
On locating--dominating sets in infinite grids
European Journal of Combinatorics | 2006-03-22 | Paper |
On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Two families of optimal identifying codes in binary Hamming spaces
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
| scientific article; zbMATH DE number 2159641 (Why is no real title available?) | 2005-04-20 | Paper |
On Identifying Codes in the Triangular and Square Grids
SIAM Journal on Computing | 2005-02-21 | Paper |
On identification in the triangular grid
Journal of Combinatorial Theory. Series B | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2081125 (Why is no real title available?) | 2004-08-04 | Paper |
Codes for identification in the king lattice
Graphs and Combinatorics | 2004-03-04 | Paper |
Optimal codes for strong identification
European Journal of Combinatorics | 2003-05-19 | Paper |
On the identification of sets of points in the square lattice
Discrete & Computational Geometry | 2003-03-17 | Paper |
On strongly identifying codes
Discrete Mathematics | 2002-08-29 | Paper |
Families of optimal codes for strong identification
Discrete Applied Mathematics | 2002-08-29 | Paper |
Sequences of optimal identifying codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1522570 (Why is no real title available?) | 2002-07-16 | Paper |
On the probability of undetected error for binary codes used for combined correction and detection
Journal of Discrete Mathematical Sciences & Cryptography | 2002-04-03 | Paper |
On codes identifying sets of vertices in Hamming spaces
Designs, Codes and Cryptography | 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 |
| scientific article; zbMATH DE number 1543059 (Why is no real title available?) | 2001-02-26 | Paper |
On relations between covering radius and dual distance
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
The probability of undetected error can have several local maxima
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
New Bounds On Covering Radius as a Function of Dual Distance
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
On upper bounds for minimum distance and covering radius of non-binary codes
Designs, Codes and Cryptography | 1998-11-17 | Paper |
On covering radius and discrete Chebyshev polynomials
Applicable Algebra in Engineering, Communication and Computing | 1998-05-13 | Paper |
