| Publication | Date of Publication | Type |
|---|
| Sparse graphs without long induced paths | 2024-03-14 | Paper |
| Local certification of geometric graph classes | 2023-11-28 | Paper |
| Corrigendum to: ``Twin-width and generalized coloring numbers | 2023-10-30 | Paper |
| A lower bound for constant-size local certification | 2023-08-18 | Paper |
| Lower bound for constant-size local certification | 2023-06-12 | Paper |
| Long induced paths in minor-closed graph classes and beyond | 2023-02-17 | Paper |
| Lean Tree-Cut Decompositions: Obstructions and Algorithms | 2022-07-18 | Paper |
| Enumerating Minimal Dominating Sets in Triangle-Free Graphs | 2022-07-18 | Paper |
| Twin-width and generalized coloring numbers | 2022-01-13 | Paper |
| Long induced paths in minor-closed graph classes and beyond | 2022-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009589 | 2021-08-04 | Paper |
| Enumerating minimal dominating sets in \(K_t\)-free graphs and variants | 2021-05-03 | Paper |
| Packing and covering induced subdivisions | 2021-04-28 | Paper |
| A Menger-like property of tree-cut width | 2021-03-08 | Paper |
| Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes | 2021-02-15 | Paper |
| A tight Erdős-Pósa function for planar minors | 2020-10-20 | Paper |
| On the tractability of optimization problems on \(H\)-graphs | 2020-09-03 | Paper |
| Linear kernels for edge deletion problems to immersion-closed graph classes | 2020-05-27 | Paper |
| A tight Erdős-Pósa function for planar minors | 2019-10-15 | Paper |
| Cutwidth: obstructions and algorithmic aspects | 2019-02-14 | Paper |
| Induced minors and well-quasi-ordering | 2018-12-20 | Paper |
| Hitting minors, subdivisions, and immersions in tournaments | 2018-12-10 | Paper |
| Well-quasi-ordering \(H\)-contraction-free graphs | 2018-09-17 | Paper |
| A tight Erdős-Pósa function for wheel minors | 2018-09-14 | Paper |
| Multigraphs without large bonds are wqo by contraction | 2018-08-16 | Paper |
| An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) | 2018-05-23 | Paper |
| Cutwidth: obstructions and algorithmic aspects | 2018-04-10 | Paper |
| Polynomial expansion and sublinear separators | 2017-12-21 | Paper |
| On the tractability of optimization problems on H-graphs | 2017-09-27 | Paper |
| Recent techniques and results on the Erdős-Pósa property | 2017-09-12 | Paper |
| Minors in graphs of large \(\theta_r\)-girth | 2017-08-31 | Paper |
| Packing and covering immersion-expansions of planar sub-cubic graphs | 2017-08-31 | Paper |
| Low polynomial exclusion of planar graph patterns | 2017-02-01 | Paper |
| Packing and covering immersion models of planar subcubic graphs | 2016-12-22 | Paper |
| Induced minors and well-quasi-ordering | 2016-10-14 | Paper |
| Scattered packings of cycles | 2016-09-01 | Paper |
| An edge variant of the Erdős-Pósa property | 2016-05-18 | Paper |
| An \(O(\log \mathrm{OPT})\)-approximation for covering/packing minor models of \(\theta _{r}\) | 2016-02-26 | Paper |
| Polynomial gap extensions of the Erdős-Pósa theorem | 2014-06-11 | Paper |
