| Publication | Date of Publication | Type |
|---|
Isometric path complexity of graphs
| 2024-12-03 | Paper |
Kempe equivalent list colorings revisited
Journal of Graph Theory | 2024-09-16 | Paper |
Complexity and algorithms for isometric path cover on chordal graphs and beyond
| 2024-09-11 | Paper |
Cutting Barnette graphs perfectly is hard
Theoretical Computer Science | 2024-08-20 | Paper |
Distance-based covering problems for graphs of given cyclomatic number
| 2024-05-29 | Paper |
Recognizing geometric intersection graphs stabbed by a line
Theoretical Computer Science | 2024-03-28 | Paper |
\(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
Discrete Applied Mathematics | 2024-01-09 | Paper |
$\chi$-binding functions for squares of bipartite graphs and its subclasses
| 2023-12-14 | Paper |
scientific article; zbMATH DE number 7765365 (Why is no real title available?)
| 2023-11-14 | Paper |
Algorithms and complexity for geodetic sets on partial grids
Theoretical Computer Science | 2023-10-26 | Paper |
Finding geometric representations of apex graphs is \textsf{NP}-hard
Theoretical Computer Science | 2023-08-18 | Paper |
\(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Triangle-free projective-planar graphs with diameter two: domination and characterization
Discrete Applied Mathematics | 2023-03-29 | Paper |
Cutting Barnette graphs perfectly is hard
| 2023-02-22 | Paper |
Isometric path complexity of graphs
| 2022-12-31 | Paper |
Triangle-free projective-planar graphs with diameter two: domination and characterization
| 2022-12-08 | Paper |
Finding geometric representations of apex graphs is NP-hard
| 2022-07-13 | Paper |
On dominating set of some subclasses of string graphs
Computational Geometry | 2022-06-13 | Paper |
Twin-width VIII: delineation and win-wins
| 2022-04-01 | Paper |
Algorithms and complexity of \(s\)-club cluster vertex deletion
| 2022-03-22 | Paper |
On rectangle intersection graphs with stab number at most two
Discrete Applied Mathematics | 2020-12-29 | Paper |
Hardness and approximation for the geodetic set problem in some graph classes
| 2020-07-21 | Paper |
On the stab number of rectangle intersection graphs
Theory of Computing Systems | 2020-07-02 | Paper |
Dominating set on overlap graphs of rectangles intersecting a line
| 2020-02-24 | Paper |
Approximating minimum dominating set on string graphs
| 2020-02-24 | Paper |
On rectangle intersection graphs with stab number at most two
Algorithms and Discrete Applied Mathematics | 2019-10-10 | Paper |
Bounds on the bend number of split and cocomparability graphs
Theory of Computing Systems | 2019-09-05 | Paper |
Bottleneck bichromatic full Steiner trees
Information Processing Letters | 2018-12-05 | Paper |
On local structures of cubicity 2 graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On a special class of boxicity 2 graphs
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
Kempe Equivalent List Colorings Revisited
| N/A | Paper |
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
| N/A | Paper |
