| Publication | Date of Publication | Type |
|---|
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
Journal of Computer and System Sciences | 2026-05-08 | Paper |
Erdős-Pósa property of \(A\)-paths in unoriented group-labelled graphs
Combinatorica | 2026-03-20 | Paper |
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
Journal of Combinatorial Theory. Series B | 2026-03-16 | Paper |
A new width parameter of graphs based on edge cuts: -edge-crossing width
Discrete Applied Mathematics | 2025-12-16 | Paper |
A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
Mathematische Annalen | 2025-11-21 | Paper |
| Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes | 2025-07-24 | Paper |
A half-integral Erdős-Pósa theorem for directed odd cycles
Journal of Combinatorial Theory. Series B | 2025-03-28 | Paper |
A characterization of graphs of radius-r flip-width at most 2
Discrete Mathematics | 2025-02-11 | Paper |
Tree pivot-minors and linear rank-width
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| Directed tangle tree-decompositions and applications | 2024-07-19 | Paper |
| Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) | 2024-04-23 | Paper |
| Classes of intersection digraphs with good algorithmic properties | 2024-04-23 | Paper |
A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
Journal of the London Mathematical Society | 2024-02-23 | Paper |
| Computing pivot-minors | 2023-11-08 | Paper |
A polynomial kernel for 3-leaf power deletion
Algorithmica | 2023-10-06 | Paper |
Graphs of bounded depth‐2 rank‐brittleness
Journal of Graph Theory | 2023-09-29 | Paper |
| On a variant of dichromatic number for digraphs with prescribed sets of arcs | 2023-07-12 | Paper |
| A characterization of graphs of radius-r flip-width at most 2 | 2023-06-27 | Paper |
| Group vertex-arboricity of group-labelled graphs | 2023-05-02 | Paper |
| A new width parameter of graphs based on edge cuts: $\alpha$-edge-crossing width | 2023-02-09 | Paper |
| A unified Erd\H{o}s-P\'{o}sa theorem for cycles in graphs labelled by multiple abelian groups | 2022-09-20 | Paper |
| Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes | 2022-07-14 | Paper |
| Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond) | 2022-02-23 | Paper |
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
(available as arXiv preprint) | 2021-09-25 | Paper |
| The canonical directed tree decomposition and its applications to the directed disjoint paths problem | 2020-09-28 | Paper |
| A half-integral Erd\H{o}s-P\'osa theorem for directed odd cycles | 2020-07-23 | Paper |
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width
Algorithmica | 2020-04-14 | Paper |
Well-partitioned chordal graphs: obstruction set and disjoint paths
(available as arXiv preprint) | 2020-02-25 | Paper |
A polynomial kernel for 3-leaf power deletion
(available as arXiv preprint) | 2019-11-11 | Paper |
| Graphs of bounded depth-2 rank-brittleness | 2019-06-13 | Paper |
| Erd\"os-P\'osa property of minor-models with prescribed vertex sets | 2019-04-01 | Paper |
Chi-boundedness of graph classes excluding wheel vertex-minors
Journal of Combinatorial Theory. Series B | 2019-02-08 | Paper |
Generalized distance domination problems and their complexity on graphs of bounded mim-width
(available as arXiv preprint) | 2018-03-09 | Paper |
Chi-boundedness of graph classes excluding wheel vertex-minors
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
A width parameter useful for chordal and co-comparability graphs
Theoretical Computer Science | 2017-11-16 | Paper |
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width
Lecture Notes in Computer Science | 2017-09-22 | Paper |
A width parameter useful for chordal and co-comparability graphs
Lecture Notes in Computer Science | 2017-05-05 | Paper |
Characterizing width two for variants of treewidth
Discrete Applied Mathematics | 2016-11-24 | Paper |
Tree-depth and vertex-minors
European Journal of Combinatorics | 2016-05-11 | Paper |
| An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width | 2014-12-18 | Paper |
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
(available as arXiv preprint) | N/A | Paper |
