| Publication | Date of Publication | Type |
|---|
| Computing tree decompositions with small independence number | 2026-01-14 | Paper |
| Two-sets cut-uncut on planar graphs | 2026-01-14 | Paper |
| Stability in graphs with matroid constraints | 2025-12-02 | Paper |
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
SIAM Journal on Discrete Mathematics | 2025-10-29 | Paper |
| Dynamic treewidth | 2025-08-15 | Paper |
| A single-exponential time 2-approximation algorithm for treewidth | 2025-08-13 | Paper |
| Computing paths of large rank in planar frameworks deterministically | 2025-07-24 | Paper |
Fixed-parameter tractability of maximum colored path and beyond
ACM Transactions on Algorithms | 2025-02-21 | Paper |
Shortest cycles with monotone submodular costs
ACM Transactions on Algorithms | 2025-02-21 | Paper |
Computing paths of large rank in planar frameworks deterministically
SIAM Journal on Discrete Mathematics | 2025-01-22 | Paper |
| Polynomial-time approximation of independent set parameterized by treewidth | 2025-01-06 | Paper |
| Fully dynamic approximation schemes on planar and apex-minor-free graphs | 2024-11-28 | Paper |
| Induced-minor-free graphs: separator theorem, subexponential algorithms, and improved hardness of recognition | 2024-11-28 | Paper |
| Tight lower bounds for problems parameterized by rank-width | 2024-10-08 | Paper |
Fast FPT-approximation of branchwidth
SIAM Journal on Computing | 2024-08-27 | Paper |
| Shortest cycles with monotone submodular costs | 2024-05-14 | Paper |
| Fixed-parameter tractability of maximum colored path and beyond | 2024-05-14 | Paper |
| An improved parameterized algorithm for treewidth | 2024-05-08 | Paper |
| New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth | 2024-05-03 | Paper |
| Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor | 2023-12-13 | Paper |
Fast FPT-approximation of branchwidth
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| scientific article; zbMATH DE number 7764113 (Why is no real title available?) | 2023-11-13 | Paper |
| scientific article; zbMATH DE number 7764121 (Why is no real title available?) | 2023-11-13 | Paper |
| On Induced Versions of Menger's Theorem on Sparse Graphs | 2023-09-15 | Paper |
| Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition | 2023-08-09 | Paper |
Grid induced minor theorem for graphs of small degree
Journal of Combinatorial Theory. Series B | 2023-03-23 | Paper |
Finding optimal triangulations parameterized by edge clique cover
Algorithmica | 2022-08-03 | Paper |
| Computing Tree Decompositions with Small Independence Number | 2022-07-20 | Paper |
Grid Induced Minor Theorem for Graphs of Small Degree
(available as arXiv preprint) | 2022-03-24 | Paper |
| Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover | 2020-11-23 | Paper |
Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
(available as arXiv preprint) | N/A | Paper |
Minor Containment and Disjoint Paths in almost-linear time
(available as arXiv preprint) | N/A | Paper |
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
(available as arXiv preprint) | N/A | Paper |
