| Publication | Date of Publication | Type |
|---|
Long induced paths and forbidden patterns: polylogarithmic bounds
SIAM Journal on Discrete Mathematics | 2026-01-20 | Paper |
| Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius | 2025-12-02 | Paper |
| Feedback vertex set for pseudo-disk graphs in subexponential FPT time | 2025-05-02 | Paper |
Sparse graphs without long induced paths
Journal of Combinatorial Theory. Series B | 2024-03-14 | Paper |
| Local certification of geometric graph classes | 2023-11-28 | Paper |
Corrigendum to: ``Twin-width and generalized coloring numbers''
Discrete Mathematics | 2023-10-30 | Paper |
A lower bound for constant-size local certification
Theoretical Computer Science | 2023-08-18 | Paper |
Lower bound for constant-size local certification
Lecture Notes in Computer Science | 2023-06-12 | Paper |
Long induced paths in minor-closed graph classes and beyond
The Electronic Journal of Combinatorics | 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
Discrete Mathematics | 2022-01-13 | Paper |
Long induced paths in minor-closed graph classes and beyond
(available as arXiv preprint) | 2022-01-11 | Paper |
scientific article; zbMATH DE number 7378700 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Enumerating minimal dominating sets in \(K_t\)-free graphs and variants
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Packing and covering induced subdivisions
SIAM Journal on Discrete Mathematics | 2021-04-28 | Paper |
A Menger-like property of tree-cut width
Journal of Combinatorial Theory. Series B | 2021-03-08 | Paper |
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
SIAM Journal on Discrete Mathematics | 2021-02-15 | Paper |
A tight Erdős-Pósa function for planar minors
Advances in Combinatorics | 2020-10-20 | Paper |
On the tractability of optimization problems on \(H\)-graphs
Algorithmica | 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
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Cutwidth: obstructions and algorithmic aspects
Algorithmica | 2019-02-14 | Paper |
Induced minors and well-quasi-ordering
Journal of Combinatorial Theory. Series B | 2018-12-20 | Paper |
Hitting minors, subdivisions, and immersions in tournaments
(available as arXiv preprint) | 2018-12-10 | Paper |
| Hitting minors, subdivisions, and immersions in tournaments | 2018-12-10 | Paper |
Well-quasi-ordering \(H\)-contraction-free graphs
Discrete Applied Mathematics | 2018-09-17 | Paper |
A tight Erdős-Pósa function for wheel minors
SIAM Journal on Discrete Mathematics | 2018-09-14 | Paper |
Multigraphs without large bonds are wqo by contraction
Journal of Graph Theory | 2018-08-16 | Paper |
An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
Algorithmica | 2018-05-23 | Paper |
Cutwidth: obstructions and algorithmic aspects
(available as arXiv preprint) | 2018-04-10 | Paper |
Polynomial expansion and sublinear separators
European Journal of Combinatorics | 2017-12-21 | Paper |
On the tractability of optimization problems on H-graphs
(available as arXiv preprint) | 2017-09-27 | Paper |
Recent techniques and results on the Erdős-Pósa property
Discrete Applied Mathematics | 2017-09-12 | Paper |
Minors in graphs of large \(\theta_r\)-girth
European Journal of Combinatorics | 2017-08-31 | Paper |
Packing and covering immersion-expansions of planar sub-cubic graphs
European Journal of Combinatorics | 2017-08-31 | Paper |
Packing and covering immersion-expansions of planar sub-cubic graphs
European Journal of Combinatorics | 2017-08-31 | Paper |
Low polynomial exclusion of planar graph patterns
Journal of Graph Theory | 2017-02-01 | Paper |
Packing and covering immersion models of planar subcubic graphs
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Induced minors and well-quasi-ordering
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Scattered packings of cycles
Theoretical Computer Science | 2016-09-01 | Paper |
An edge variant of the Erdős-Pósa property
Discrete Mathematics | 2016-05-18 | Paper |
An \(O(\log \mathrm{OPT})\)-approximation for covering/packing minor models of \(\theta _{r}\)
Approximation and Online Algorithms | 2016-02-26 | Paper |
Polynomial gap extensions of the Erdős-Pósa theorem
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
