| Publication | Date of Publication | Type |
|---|
| Classes of intersection digraphs with good algorithmic properties | 2024-03-25 | Paper |
| Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) | 2023-03-23 | Paper |
| Three problems on well-partitioned chordal graphs | 2023-03-22 | Paper |
| Well-partitioned chordal graphs: obstruction set and disjoint paths | 2022-12-21 | Paper |
| The grid theorem for vertex-minors | 2022-11-23 | Paper |
| Measuring what matters: a hybrid approach to dynamic programming with treewidth | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089163 | 2022-07-18 | Paper |
| Lean Tree-Cut Decompositions: Obstructions and Algorithms | 2022-07-18 | Paper |
| Well-partitioned chordal graphs | 2022-06-14 | Paper |
| Rainbow independent sets on dense graph classes | 2022-03-24 | Paper |
| Tree pivot-minors and linear rank-width | 2022-01-07 | Paper |
| A system of disjoint representatives of line segments with given \(k\) directions | 2021-09-30 | Paper |
| Generalized distance domination problems and their complexity on graphs of bounded mim-width | 2021-08-04 | Paper |
| Measuring what matters: a hybrid approach to dynamic programming with treewidth | 2021-07-06 | Paper |
| A polynomial kernel for distance-hereditary vertex deletion | 2021-06-30 | Paper |
| Obstructions for bounded shrub-depth and rank-depth | 2021-06-18 | Paper |
| Packing and covering induced subdivisions | 2021-04-28 | Paper |
| A Menger-like property of tree-cut width | 2021-03-08 | Paper |
| Branch-depth: generalizing tree-depth of graphs | 2021-02-08 | Paper |
| The Directed Flat Wall Theorem | 2021-02-02 | Paper |
| Erdős-Pósa property of chordless cycles and its applications | 2020-09-24 | Paper |
| Graphs without two vertex-disjoint \(S\)-cycles | 2020-08-12 | Paper |
| A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width | 2020-08-05 | Paper |
| Neighborhood complexity and kernelization for nowhere dense classes of graphs | 2020-05-27 | Paper |
| Polynomial-time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim-width | 2020-05-27 | Paper |
| Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms | 2020-05-27 | Paper |
| Mim-width. I. Induced path problems | 2020-04-21 | Paper |
| An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width | 2020-04-14 | Paper |
| Scattered classes of graphs | 2020-04-07 | Paper |
| Mim-width. II. The feedback vertex set problem | 2020-01-16 | Paper |
| Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded | 2020-01-15 | Paper |
| On low rank-width colorings | 2019-11-28 | Paper |
| Mim-width. III. Graph powers and generalized distance domination problems | 2019-11-13 | Paper |
| Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms | 2019-09-10 | Paper |
| Digraphs of bounded width | 2019-03-04 | Paper |
| Chi-boundedness of graph classes excluding wheel vertex-minors | 2019-02-08 | Paper |
| Computing small pivot-minors | 2018-11-22 | Paper |
| Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions | 2018-09-07 | Paper |
| A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion | 2018-09-07 | Paper |
| A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion | 2018-03-21 | Paper |
| Erdős-Pósa property of chordless cycles and its applications | 2018-03-15 | Paper |
| Chi-boundedness of graph classes excluding wheel vertex-minors | 2018-01-18 | Paper |
| On low rank-width colorings | 2018-01-04 | Paper |
| A width parameter useful for chordal and co-comparability graphs | 2017-11-16 | Paper |
| An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion | 2017-10-10 | Paper |
| A polynomial kernel for block graph deletion | 2017-10-10 | Paper |
| A polynomial kernel for block graph deletion | 2017-09-29 | Paper |
| An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion | 2017-09-29 | Paper |
| An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width | 2017-09-22 | Paper |
| A polynomial kernel for distance-hereditary vertex deletion | 2017-09-22 | Paper |
| Packing and covering immersion-expansions of planar sub-cubic graphs | 2017-08-31 | Paper |
| Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm | 2017-05-11 | Paper |
| A width parameter useful for chordal and co-comparability graphs | 2017-05-05 | Paper |
| Excluded vertex-minors for graphs of linear rank-width at most \(k\). | 2017-01-30 | Paper |
| Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors | 2017-01-26 | Paper |
| Packing and covering immersion models of planar subcubic graphs | 2016-12-22 | Paper |
| Parameterized vertex deletion problems for hereditary graph classes with a block property | 2016-12-22 | Paper |
| Linear rank-width of distance-hereditary graphs | 2015-09-09 | Paper |
| Unavoidable vertex-minors in large prime graphs | 2014-09-02 | Paper |
| Excluded vertex-minors for graphs of linear rank-width at most \(k\) | 2014-09-02 | Paper |
| Graphs of small rank-width are pivot-minors of graphs of small tree-width | 2014-04-02 | Paper |
