| Publication | Date of Publication | Type |
|---|
Parameterizing path partitions
Theoretical Computer Science | 2025-01-16 | Paper |
Isometric path complexity of graphs
| 2024-12-03 | 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 |
Complexity and algorithms for isometric path cover on chordal graphs and beyond
| 2024-09-11 | Paper |
On graphs coverable by \(k\) shortest paths
| 2024-09-11 | Paper |
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
On graphs coverable by \({k}\) shortest paths
SIAM Journal on Discrete Mathematics | 2024-06-25 | Paper |
Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
| 2024-05-31 | Paper |
Distance-based covering problems for graphs of given cyclomatic number
| 2024-05-29 | Paper |
Extremal Digraphs for open neighbourhood location-domination and identifying codes
Discrete Applied Mathematics | 2024-02-27 | Paper |
Extended double covers and homomorphism bounds of signed graphs
The Electronic Journal of Combinatorics | 2024-02-23 | Paper |
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
| 2023-12-16 | Paper |
Discriminating Codes in Geometric Setups
| 2023-11-14 | Paper |
scientific article; zbMATH DE number 7765365 (Why is no real title available?)
| 2023-11-14 | Paper |
Neighbourhood complexity of graphs of bounded twin-width
European Journal of Combinatorics | 2023-10-25 | Paper |
Parameterizing path partitions
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Bounds and extremal graphs for total dominating identifying codes
The Electronic Journal of Combinatorics | 2023-08-18 | Paper |
New bounds and constructions for neighbor-locating colorings of graphs
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
Monitoring edge-geodetic sets in 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 |
Relation between broadcast domination and multipacking numbers on chordal graphs
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
The \textsc{Red-Blue Separation} problem on graphs
Theoretical Computer Science | 2023-08-08 | Paper |
Algorithms and hardness for Metric Dimension on digraphs
| 2023-07-18 | Paper |
Complexity and approximation for discriminating and identifying code problems in geometric setups
Algorithmica | 2023-06-28 | Paper |
scientific article; zbMATH DE number 7650223 (Why is no real title available?)
| 2023-02-03 | Paper |
Isometric path complexity of graphs
| 2022-12-31 | Paper |
Progress towards the two-thirds conjecture on locating-total dominating sets
| 2022-11-25 | Paper |
Revisiting and improving upper bounds for identifying codes
SIAM Journal on Discrete Mathematics | 2022-11-15 | Paper |
On the complexity of \textsc{broadcast domination} and \textsc{Multipacking} in digraphs
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Problems related to a conjecture on location-domination in twin-free graphs
| 2022-09-09 | Paper |
The \textsc{red-blue separation} problem on graphs
| 2022-08-30 | Paper |
Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)
Discrete Applied Mathematics | 2022-08-04 | Paper |
Monitoring the edges of a graph using distances
Discrete Applied Mathematics | 2022-08-04 | Paper |
On graphs coverable by k shortest paths
| 2022-06-30 | Paper |
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
Algorithmica | 2022-05-03 | Paper |
On the complexity of broadcast domination and multipacking in digraphs
Algorithmica | 2021-09-02 | Paper |
Characterizing extremal graphs for open neighbourhood location-domination
Discrete Applied Mathematics | 2021-08-02 | Paper |
Complexity and algorithms for injective edge-coloring in graphs
Information Processing Letters | 2021-06-16 | Paper |
Complexity and algorithms for injective edge-coloring in graphs
| 2021-04-16 | Paper |
Exact square coloring of subcubic planar graphs
Discrete Applied Mathematics | 2021-03-25 | Paper |
Hardness and approximation for the geodetic set problem in some graph classes
| 2020-07-21 | Paper |
Smallest \(C_{2l+1}\)-critical graphs of odd-girth \(2k+1\)
| 2020-07-21 | Paper |
Monitoring the edges of a graph using distances
Lecture Notes in Computer Science | 2020-07-21 | Paper |
Domination and location in twin-free digraphs
Discrete Applied Mathematics | 2020-07-07 | Paper |
Complexity of planar signed graph homomorphisms to cycles
Discrete Applied Mathematics | 2020-07-07 | Paper |
Complexity of conjunctive regular path query homomorphisms
| 2020-05-12 | Paper |
Broadcast domination and multipacking: bounds and the integrality gap
| 2019-09-19 | Paper |
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
Discrete Mathematics | 2019-09-11 | Paper |
Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs
Discrete Applied Mathematics | 2019-05-17 | Paper |
Parameterized and approximation complexity of \textsc{Partial VC Dimension}
Theoretical Computer Science | 2019-03-14 | Paper |
Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
Journal of Combinatorial Theory. Series B | 2018-10-29 | Paper |
Complexity of Grundy coloring and its variants
Discrete Applied Mathematics | 2018-05-24 | Paper |
Centroidal bases in graphs
Networks | 2018-05-23 | Paper |
Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
SIAM Journal on Discrete Mathematics | 2018-04-20 | Paper |
Parameterized and approximation complexity of the detection pair problem in graphs
Journal of Graph Algorithms and Applications | 2017-10-24 | Paper |
Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
Algorithmica | 2017-10-09 | Paper |
The complexity of tropical graph homomorphisms
Discrete Applied Mathematics | 2017-07-27 | Paper |
Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
Theoretical Computer Science | 2017-02-27 | Paper |
On the approximability of partial VC dimension
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Structural properties of recursively partitionable graphs with connectivity 2
Discussiones Mathematicae Graph Theory | 2017-01-23 | Paper |
Random subgraphs make identification affordable
Journal of Combinatorics | 2017-01-10 | Paper |
The complexity of signed graph and edge-coloured graph homomorphisms
Discrete Mathematics | 2016-12-14 | Paper |
Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Location-domination in line graphs
Discrete Mathematics | 2016-10-21 | Paper |
Locating-total dominating sets in twin-free graphs: a conjecture
The Electronic Journal of Combinatorics | 2016-09-13 | Paper |
Locating-dominating sets in twin-free graphs
Discrete Applied Mathematics | 2016-01-21 | Paper |
Location-domination and matching in cubic graphs
Discrete Mathematics | 2016-01-21 | Paper |
Large subgraphs without short cycles
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Complexity of Grundy coloring and its variants
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Locating-dominating sets and identifying codes in graphs of girth at least 5
The Electronic Journal of Combinatorics | 2015-05-18 | Paper |
On powers of interval graphs and their orders
| 2015-05-13 | Paper |
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
Journal of Discrete Algorithms | 2015-03-24 | Paper |
On the structure of arbitrarily partitionable graphs with given connectivity
Discrete Applied Mathematics | 2014-09-12 | Paper |
On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths
Lecture Notes in Computer Science | 2014-08-19 | Paper |
Identifying path covers in graphs
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Random subgraphs make identification affordable
| 2014-06-11 | Paper |
The complexity of homomorphisms of signed graphs and signed constraint satisfaction
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
Advances in Mathematics of Communications | 2014-03-10 | Paper |
The complexity of the identifying code problem in restricted graph classes
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Edge identifying codes
| 2013-11-01 | Paper |
Identifying codes in line graphs
Journal of Graph Theory | 2013-07-31 | Paper |
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
Graphs and Combinatorics | 2013-06-26 | Paper |
On the size of identifying codes in triangle-free graphs
Discrete Applied Mathematics | 2012-06-18 | Paper |
Bounds for identifying codes in terms of degree parameters
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Locally identifying colourings for graphs with given maximum degree
Discrete Mathematics | 2012-05-30 | Paper |
Extremal graphs for the identifying code problem
European Journal of Combinatorics | 2011-04-08 | Paper |
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
| N/A | Paper |
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
| N/A | Paper |
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
| N/A | Paper |
Identifying codes in graphs of given maximum degree. I. Trees
| N/A | Paper |
Identifying codes in graphs of given maximum degree. II. Triangle-free graphs
| N/A | Paper |
