| Publication | Date of Publication | Type |
|---|
| A graph searching game for block treedepth and a cubic kernel by vertex cover | 2024-08-21 | Paper |
| Directed tangle tree-decompositions and applications | 2024-07-19 | Paper |
| Excluding a planar matching minor in bipartite graphs | 2024-01-29 | Paper |
| Excluding Single-Crossing Matching Minors in Bipartite Graphs | 2022-12-19 | Paper |
| Block elimination distance | 2022-08-08 | Paper |
| Lean Tree-Cut Decompositions: Obstructions and Algorithms | 2022-07-18 | Paper |
| Block elimination distance | 2022-06-08 | Paper |
| A Flat Wall Theorem for Matching Minors in Bipartite Graphs | 2021-10-14 | Paper |
| Two Disjoint Alternating Paths in Bipartite Graphs | 2021-10-05 | Paper |
| A Menger-like property of tree-cut width | 2021-03-08 | Paper |
| Block Elimination Distance | 2021-03-02 | Paper |
| Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes | 2021-02-15 | Paper |
| The Directed Flat Wall Theorem | 2021-02-02 | Paper |
| The canonical directed tree decomposition and its applications to the directed disjoint paths problem | 2020-09-28 | Paper |
| Neighborhood complexity and kernelization for nowhere dense classes of graphs | 2020-05-27 | Paper |
| Linear kernels for edge deletion problems to immersion-closed graph classes | 2020-05-27 | Paper |
| Cutwidth: obstructions and algorithmic aspects | 2019-02-14 | Paper |
| Uniform kernelization complexity of hitting forbidden minors | 2018-11-05 | Paper |
| Cutwidth: obstructions and algorithmic aspects | 2018-04-10 | Paper |
| FPT algorithms for plane completion problems | 2018-03-21 | Paper |
| Matching connectivity: on the structure of graphs with perfect matchings | 2018-01-18 | Paper |
| Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs | 2017-09-29 | Paper |
| Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs | 2017-09-07 | Paper |
| Packing and covering immersion-expansions of planar sub-cubic graphs | 2017-08-31 | Paper |
| Tree deletion set has a polynomial kernel (but no \(\mathrm {OPT}^{\mathcal O(1)}\) approximation) | 2017-04-25 | Paper |
| New geometric representations and domination problems on tolerance and multitolerance graphs. | 2017-01-24 | Paper |
| Packing and covering immersion models of planar subcubic graphs | 2016-12-22 | Paper |
| New geometric representations and domination problems on tolerance and multitolerance graphs | 2016-09-09 | Paper |
| Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation) | 2016-07-22 | Paper |
| The Structure of $W_4$-Immersion-Free Graphs | 2016-02-05 | Paper |
| Uniform kernelization complexity of hitting forbidden minors | 2015-10-27 | Paper |
| Computing tree-depth faster than \(2^n\) | 2015-09-03 | Paper |
| Forbidding Kuratowski graphs as immersions | 2015-01-21 | Paper |
| Effective computation of immersion obstructions for unions of graph classes | 2014-01-28 | Paper |
| Optimizing the graph minors weak structure theorem | 2014-01-21 | Paper |
| Computing Tree-Depth Faster Than 2 n | 2013-12-10 | Paper |
| Excluding graphs as immersions in surface embedded graphs | 2013-12-06 | Paper |
| A min-max theorem for LIFO-search | 2013-11-01 | Paper |
| Obstructions for tree-depth | 2013-10-10 | Paper |
| LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth | 2012-10-26 | Paper |
| Effective computation of immersion obstructions for unions of graph classes | 2012-08-14 | Paper |
| New lower bound on Max Cut of hypergraphs with an application to \(r\)-Set Splitting | 2012-06-29 | Paper |
| Forbidden graphs for tree-depth | 2012-05-04 | Paper |
| Braces of Perfect Matching Width 2 | N/A | Paper |
