| Publication | Date of Publication | Type |
|---|
| Edge multiway cut and node multiway cut are hard for planar subcubic graphs | 2025-12-02 | Paper |
Finding d-cuts in graphs of bounded diameter, graphs of bounded radius and H-free graphs
Algorithmica | 2025-11-25 | Paper |
Complexity framework for forbidden subgraphs. IV: The Steiner forest problem
Journal of Computer and System Sciences | 2025-08-21 | Paper |
Acyclic, star and injective colouring: a complexity picture for H-free graphs
Journal of Computer and System Sciences | 2025-08-21 | Paper |
| Finding \(d\)-cuts in graphs of bounded diameter, graphs of bounded radius and \(H\)-free graphs | 2025-05-02 | Paper |
| Complexity framework for forbidden subgraphs. IV: The Steiner forest problem | 2025-02-28 | Paper |
Complexity framework for forbidden subgraphs. I: The framework
Algorithmica | 2025-02-25 | Paper |
| Graph homomorphism, monotone classes and bounded pathwidth | 2025-02-07 | Paper |
| Complexity framework for forbidden subgraphs III: when problems are tractable on subcubic graphs | 2024-12-03 | Paper |
| scientific article; zbMATH DE number 7788594 (Why is no real title available?) | 2024-01-15 | Paper |
The complexity of \(L(p, q)\)-edge-labelling
Algorithmica | 2023-11-17 | Paper |
Induced disjoint paths and connected subgraphs for \(H\)-free graphs
Algorithmica | 2023-09-27 | Paper |
QCSP on Reflexive Tournaments
(available as arXiv preprint) | 2023-09-20 | Paper |
Few induced disjoint paths for \(H\)-free graphs
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Induced disjoint paths and connected subgraphs for \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
| Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem | 2023-05-02 | Paper |
| Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs | 2023-05-01 | Paper |
Colouring graphs of bounded diameter in the absence of small cycles
Lecture Notes in Computer Science | 2023-03-22 | Paper |
scientific article; zbMATH DE number 7651161 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision | 2022-11-25 | Paper |
| Complexity Framework For Forbidden Subgraphs I: The Framework | 2022-11-23 | Paper |
Few induced disjoint paths for \(H\)-free graphs
Theoretical Computer Science | 2022-11-17 | Paper |
Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter
Theoretical Computer Science | 2022-09-01 | Paper |
Partitioning \(H\)-free graphs of bounded diameter
Theoretical Computer Science | 2022-08-25 | Paper |
| Colouring H-free graphs of bounded diameter. | 2022-07-21 | Paper |
The complexity of \(L(p, q)\)-edge-labelling
(available as arXiv preprint) | 2022-07-13 | Paper |
Acyclic, star, and injective colouring: bounding the diameter
The Electronic Journal of Combinatorics | 2022-06-13 | Paper |
Acyclic, star, and injective colouring: bounding the diameter
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
Colouring graphs of bounded diameter in the absence of small cycles
Discrete Applied Mathematics | 2022-04-20 | Paper |
Disjoint paths and connected subgraphs for \(H\)-free graphs
Lecture Notes in Computer Science | 2022-03-22 | Paper |
| Injective colouring for H-free graphs | 2022-03-21 | Paper |
Few Induced Disjoint Paths for $H$-Free Graphs
(available as arXiv preprint) | 2022-03-07 | Paper |
Hard problems that quickly become very easy
Information Processing Letters | 2021-12-14 | Paper |
Disjoint paths and connected subgraphs for \(H\)-free graphs
Theoretical Computer Science | 2021-12-01 | Paper |
Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter
(available as arXiv preprint) | 2021-11-23 | Paper |
Disjoint Paths and Connected Subgraphs for H-Free Graphs
(available as arXiv preprint) | 2021-05-13 | Paper |
Partitioning H-Free Graphs of Bounded Diameter
(available as arXiv preprint) | 2021-05-10 | Paper |
Acyclic, Star, and Injective Colouring: Bounding the Diameter
(available as arXiv preprint) | 2021-04-21 | Paper |
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
(available as arXiv preprint) | 2020-08-21 | Paper |
Finding $d$-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and $H$-Free Graphs
(available as arXiv preprint) | N/A | Paper |
