| Publication | Date of Publication | Type |
|---|
Identifying codes in triangle-free graphs of bounded maximum degree
Journal of Graph Theory | 2026-06-11 | Paper |
| Tight (double) exponential bounds for identification problems: locating-dominating set and test cover | 2026-06-08 | Paper |
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
Discrete Applied Mathematics | 2026-04-17 | Paper |
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 |
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 full-separating sets and related codes in graphs
Discrete Applied Mathematics | 2025-12-11 | Paper |
| Structural parameterization of locating-dominating set and test cover | 2025-11-11 | Paper |
On open-separating dominating codes in graphs
Discrete Applied Mathematics | 2025-07-31 | Paper |
| On full-separating sets in graphs | 2025-06-20 | Paper |
| Open-separating dominating codes in graphs | 2025-02-07 | Paper |
A linear algorithm for radio k-coloring of powers of paths having small diameters
Journal of Computer and System Sciences | 2024-10-29 | Paper |
On three domination-based identification problems in block graphs
Fundamenta Informaticae | 2024-10-07 | Paper |
Progress towards the two-thirds conjecture on locating-total dominating sets
Discrete Mathematics | 2024-09-27 | Paper |
On locating and neighbor-locating colorings of sparse graphs
Discrete Applied Mathematics | 2024-09-26 | Paper |
A linear algorithm for radio \(k\)-coloring powers of paths having small diameter
Lecture Notes in Computer Science | 2023-12-22 | Paper |
| Location-Domination Type Problems Under the Mycielski Construction | 2023-11-23 | Paper |
New bounds and constructions for neighbor-locating colorings of graphs
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
On three domination-based identification problems in block graphs
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
| Contracting edges to destroy a pattern: A complexity study | 2023-02-27 | Paper |
| Progress towards the two-thirds conjecture on locating-total dominating sets | 2022-11-25 | Paper |
On clique numbers of colored mixed graphs
Discrete Applied Mathematics | 2022-11-11 | Paper |
| On radio k-chromatic number of powers of paths having small diameter | 2021-06-14 | Paper |
Open-separating dominating codes in graphs
(available as arXiv preprint) | N/A | Paper |
Identifying codes in graphs of given maximum degree. I. Trees
(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 |
