| Publication | Date of Publication | Type |
|---|
Identifying codes in graphs of given maximum degree. I. Trees
(available as arXiv preprint) | N/A | Paper |
Resolving Sets in Temporal Graphs
(available as arXiv preprint) | N/A | Paper |
Identifying codes in graphs of given maximum degree. II. Triangle-free graphs
(available as arXiv preprint) | N/A | Paper |
| On (1, l)-locating-dominating codes in infinite triangular grid | 2026-09-29 | Paper |
New optimal results on codes for location in graphs
Fundamenta Informaticae | 2026-08-27 | Paper |
On the density of (1, )-locating-dominating codes in the infinite square grid
Discrete Mathematics | 2026-08-13 | Paper |
Reconstructing graphs with subgraph compositions
Discrete Applied Mathematics | 2026-06-12 | Paper |
Identifying codes in triangle-free graphs of bounded maximum degree
Journal of Graph Theory | 2026-06-11 | Paper |
The generalized double pouring problem: analysis, bounds and algorithms
Discrete Applied Mathematics | 2026-05-08 | Paper |
Identifying codes in graphs of given maximum degree: characterizing trees
Discrete Mathematics | 2025-12-15 | Paper |
Identifying codes in bipartite graphs of given maximum degree
Procedia Computer Science | 2025-12-11 | Paper |
On unique error patterns in the Levenshtein's sequence reconstruction model
IEEE Transactions on Information Theory | 2025-07-14 | Paper |
Levenshtein's sequence reconstruction problem and results for larger alphabet sizes
Theoretical Computer Science | 2025-06-02 | Paper |
| Resolving sets in temporal graphs | 2025-02-28 | Paper |
Partition strategies for the maker-breaker domination game
Algorithmica | 2025-02-14 | 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 |
Super domination: graph classes, products and enumeration
Discrete Applied Mathematics | 2024-04-02 | Paper |
Neighbourhood complexity of graphs of bounded twin-width
European Journal of Combinatorics | 2023-10-25 | Paper |
Bounds and extremal graphs for total dominating identifying codes
The Electronic Journal of Combinatorics | 2023-08-18 | Paper |
The \textsc{Red-Blue Separation} problem on graphs
Theoretical Computer Science | 2023-08-08 | Paper |
| New Optimal Results on Codes for Location in Graphs | 2023-06-13 | Paper |
On radio k-labeling of the power of the infinite path
Information Processing Letters | 2023-06-05 | Paper |
| Optimal local identifying and local locating-dominating codes | 2023-02-26 | Paper |
| The Levenshtein's Sequence Reconstruction Problem and the Length of the List | 2022-11-16 | Paper |
Revisiting and improving upper bounds for identifying codes
SIAM Journal on Discrete Mathematics | 2022-11-15 | Paper |
Locating-dominating sets: from graphs to oriented graphs
Discrete Mathematics | 2022-11-02 | Paper |
| The \textsc{red-blue separation} problem on graphs | 2022-08-30 | 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 a conjecture regarding identification in Hamming graphs
The Electronic Journal of Combinatorics | 2019-07-11 | 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 |
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 |
