| Publication | Date of Publication | Type |
|---|
On the vertices belonging to all edge metric bases
Discrete Applied Mathematics | 2025-12-11 | Paper |
On unique error patterns in the Levenshtein's sequence reconstruction model
IEEE Transactions on Information Theory | 2025-07-14 | Paper |
| On a tight bound for the maximum number of vertices that belong to every metric basis | 2025-06-20 | Paper |
Levenshtein's sequence reconstruction problem and results for larger alphabet sizes
Theoretical Computer Science | 2025-06-02 | 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 |
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 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 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 |
Optimal locating-total dominating sets in strips of height 3
Discussiones Mathematicae Graph Theory | 2015-08-04 | Paper |
Information retrieval with unambiguous output
Information and Computation | 2015-06-01 | Paper |
New lower bound for 2-identifying code in the square grid
Discrete Applied Mathematics | 2014-04-22 | Paper |
| Adaptive identification of sets of vertices in graphs | 2014-03-25 | 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 |
| 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 |
Upper bounds for binary identifying codes
Advances in Applied Mathematics | 2009-04-14 | Paper |
| Locating vertices using codes | 2009-03-24 | Paper |
Iiro Honkala's contributions to identifying codes
(available as arXiv preprint) | N/A | Paper |
