| Publication | Date of Publication | Type |
|---|
| b-coloring parameterized by clique-width | 2026-04-21 | Paper |
Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard
Theoretical Computer Science | 2026-04-16 | Paper |
Dynamic programming on bipartite tree decompositions
Journal of Computer and System Sciences | 2025-12-11 | Paper |
Treewidth is NP-complete on cubic graphs
The Electronic Journal of Combinatorics | 2025-09-25 | Paper |
| Dynamic programming on bipartite tree decompositions | 2025-09-24 | Paper |
| Treewidth is NP-complete on cubic graphs | 2025-09-24 | Paper |
| Structural parameterizations of b-coloring | 2025-07-24 | Paper |
| XNLP-completeness for parameterized problems on graphs with a linear structure | 2025-06-23 | Paper |
| On the hardness of generalized domination problems parameterized by mim-width | 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 |
Taming graphs with no large creatures and skinny ladders
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
\(b\)-coloring parameterized by clique-width
Theory of Computing Systems | 2024-10-07 | Paper |
Diverse pairs of matchings
Algorithmica | 2024-05-30 | 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 |
| A logic-based algorithmic meta-theorem for mim-width | 2024-05-14 | Paper |
| Classes of intersection digraphs with good algorithmic properties | 2024-04-23 | Paper |
Classes of intersection digraphs with good algorithmic properties
Journal of Graph Theory | 2024-03-25 | Paper |
Diverse Pairs of Matchings
(available as arXiv preprint) | 2023-11-14 | Paper |
What Is Known About Vertex Cover Kernelization?
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
On the maximum number of edges in planar graphs of bounded degree and matching number
Discrete Mathematics | 2023-05-31 | Paper |
Typical sequences revisited -- computing width parameters of graphs
Theory of Computing Systems | 2023-04-27 | Paper |
| Three problems on well-partitioned chordal graphs | 2023-03-22 | Paper |
scientific article; zbMATH DE number 7650942 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Treewidth is NP-Complete on Cubic Graphs (and related results) | 2023-01-24 | Paper |
Fine-grained parameterized complexity analysis of graph coloring problems
Discrete Applied Mathematics | 2023-01-11 | Paper |
Well-partitioned chordal graphs: obstruction set and disjoint paths
(available as arXiv preprint) | 2022-12-21 | Paper |
A complexity dichotomy for critical values of the b-chromatic number of graphs
(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 |
scientific article; zbMATH DE number 7559421 (Why is no real title available?)
(available as arXiv preprint) | 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 |
Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
Artificial Intelligence | 2022-03-02 | Paper |
Generalized distance domination problems and their complexity on graphs of bounded mim-width
(available as arXiv preprint) | 2021-08-04 | Paper |
A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
(available as arXiv preprint) | 2020-08-05 | Paper |
Polynomial-time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim-width
(available as arXiv preprint) | 2020-05-27 | Paper |
Structural Parameterizations of Clique Coloring
(available as arXiv preprint) | 2020-05-10 | Paper |
Mim-width. I. Induced path problems
Discrete Applied Mathematics | 2020-04-21 | Paper |
A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs
Theoretical Computer Science | 2020-04-06 | Paper |
Well-partitioned chordal graphs: obstruction set and disjoint paths
(available as arXiv preprint) | 2020-02-25 | Paper |
Mim-width. II. The feedback vertex set problem
Algorithmica | 2020-01-16 | Paper |
Mim-width. III. Graph powers and generalized distance domination problems
Theoretical Computer Science | 2019-11-13 | Paper |
Typical Sequences Revisited --- Computing Width Parameters of Graphs
(available as arXiv preprint) | 2019-05-09 | Paper |
| On weak isomorphism of rooted vertex-colored graphs | 2018-11-22 | Paper |
Generalized distance domination problems and their complexity on graphs of bounded mim-width
(available as arXiv preprint) | 2018-03-09 | Paper |
Definability equals recognizability for k-outerplanar graphs
(available as arXiv preprint) | 2017-09-29 | Paper |
Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
European Journal of Combinatorics | 2017-09-11 | Paper |
Fine-grained parameterized complexity analysis of graph coloring problems
Lecture Notes in Computer Science | 2017-07-21 | Paper |
| MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs | 2015-03-05 | Paper |
