| Publication | Date of Publication | Type |
|---|
Tree decompositions meet induced matchings: beyond Max Weight Independent Set
(available as arXiv preprint) | N/A | Paper |
| On algorithmic applications of \(\mathcal{F}\)-branchwidth | 2026-08-31 | Paper |
| Maximum list r-colorable induced subgraphs in kp₃-free graphs | 2026-08-31 | Paper |
| Tree decompositions meet induced matchings: beyond max weight independent set | 2026-05-26 | Paper |
| b-coloring parameterized by clique-width | 2026-04-21 | Paper |
Maximum list r-colorable induced subgraphs in kP₃-free graphs
Algorithmica | 2026-01-01 | Paper |
| Longest path transversals in claw-free and P₅-free graphs | 2025-11-11 | Paper |
Treewidth is NP-complete on cubic graphs
The Electronic Journal of Combinatorics | 2025-09-25 | Paper |
| Treewidth is NP-complete on cubic graphs | 2025-09-24 | Paper |
| Structural parameterizations of b-coloring | 2025-07-24 | Paper |
Odd cycle transversal on P₅-free graphs in polynomial time
ACM Transactions on Algorithms | 2025-07-22 | Paper |
| XNLP-completeness for parameterized problems on graphs with a linear structure | 2025-06-23 | Paper |
| Taming graphs with no large creatures and skinny ladders | 2025-06-19 | Paper |
XNLP-completeness for parameterized problems on graphs with a linear structure
Algorithmica | 2025-03-28 | Paper |
Maximum list r-colorable induced subgraphs in kP₃-free graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
| Odd cycle transversal on P₅-free graphs in quasi-polynomial time | 2024-11-28 | Paper |
\(b\)-coloring parameterized by clique-width
Theory of Computing Systems | 2024-10-07 | Paper |
| On the complexity of rainbow vertex colouring diametral path graphs | 2024-09-11 | Paper |
| Reducing the vertex cover number via edge contractions | 2024-08-06 | Paper |
| A tight quasi-polynomial bound for \textsc{Global Label Min-Cut} | 2024-05-14 | Paper |
| Fixed-parameter tractability of \textsc{Directed Multicut} with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation | 2024-05-14 | Paper |
Non-empty intersection of longest paths in P₅-free and claw-free graphs
(available as arXiv preprint) | 2024-01-01 | Paper |
Reducing the vertex cover number via edge contractions
Journal of Computer and System Sciences | 2023-06-12 | Paper |
On the maximum number of edges in planar graphs of bounded degree and matching number
Discrete Mathematics | 2023-05-31 | Paper |
| Three problems on well-partitioned chordal graphs | 2023-03-22 | Paper |
scientific article; zbMATH DE number 7650254 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Treewidth is NP-Complete on Cubic Graphs (and related results) | 2023-01-24 | Paper |
Treewidth is NP-Complete on Cubic Graphs (and related results)
(available as arXiv preprint) | 2023-01-01 | Paper |
Well-partitioned chordal graphs: obstruction set and disjoint paths
(available as arXiv preprint) | 2022-12-21 | Paper |
On the maximum number of edges in chordal graphs of bounded degree and matching number
Algorithmica | 2022-12-08 | Paper |
Using edge contractions to reduce the semitotal domination number
Theoretical Computer Science | 2022-11-17 | Paper |
Graph square roots of small distance from degree one graphs
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
On the maximum number of edges in chordal graphs of bounded degree and matching number
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
Graph square roots of small distance from degree one graphs
Theory of Computing Systems | 2022-07-26 | Paper |
A complexity dichotomy for critical values of the b-chromatic number of graphs
(available as arXiv preprint) | 2022-07-21 | Paper |
Reducing the domination number of graphs via edge contractions
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559420 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes | 2022-07-18 | Paper |
| Reducing graph transversals via edge contractions | 2022-07-18 | Paper |
Well-partitioned chordal graphs
Discrete Mathematics | 2022-06-14 | Paper |
| Taming graphs with no large creatures and skinny ladders | 2022-05-02 | Paper |
Structural parameterizations of clique coloring
Algorithmica | 2022-03-25 | Paper |
Algorithms for the rainbow vertex coloring problem on graph classes
Theoretical Computer Science | 2021-09-27 | Paper |
| Rainbow vertex coloring bipartite graphs and chordal graphs | 2021-08-04 | Paper |
Reducing graph transversals via edge contractions
Journal of Computer and System Sciences | 2021-06-30 | Paper |
Reducing graph transversals via edge contractions
Journal of Computer and System Sciences | 2021-06-30 | Paper |
Reducing the domination number of graphs via edge contractions and vertex deletions
Discrete Mathematics | 2021-01-21 | Paper |
Graph Square Roots of Small Distance from Degree One Graphs
(available as arXiv preprint) | 2020-10-12 | Paper |
| Parameterized aspects of strong subgraph closure | 2020-08-25 | Paper |
Finding connected secluded subgraphs
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Intersection of longest paths in graph classes
Discrete Applied Mathematics | 2020-05-29 | Paper |
Finding connected secluded subgraphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Parameterized aspects of strong subgraph closure
Algorithmica | 2020-05-21 | Paper |
Parameterized aspects of strong subgraph closure
Algorithmica | 2020-05-21 | Paper |
Structural Parameterizations of Clique Coloring
(available as arXiv preprint) | 2020-05-10 | Paper |
A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs
Theoretical Computer Science | 2020-04-06 | Paper |
Algorithms for the rainbow vertex coloring problem on graph classes
(available as arXiv preprint) | 2020-03-06 | Paper |
Well-partitioned chordal graphs: obstruction set and disjoint paths
(available as arXiv preprint) | 2020-02-25 | Paper |
Transversals of longest paths
Discrete Mathematics | 2020-01-22 | Paper |
Blocking dominating sets for $H$-free graphs via edge contractions
(available as arXiv preprint) | 2019-06-28 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Algorithmica | 2019-05-21 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Algorithmica | 2019-05-21 | Paper |
Classifying \(k\)-edge colouring for \(H\)-free graphs
Information Processing Letters | 2019-04-26 | Paper |
Reducing the domination number of graphs via edge contractions
(available as arXiv preprint) | 2019-03-05 | Paper |
| On the Parameterized Complexity of k-Edge Colouring | 2019-01-07 | Paper |
On the Parameterized Complexity of $k$-Edge Colouring
(available as arXiv preprint) | 2019-01-01 | Paper |
Transversals of longest paths
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Intersection of longest paths in graph classes
Electronic Notes in Discrete Mathematics | 2017-02-14 | Paper |
