| Publication | Date of Publication | Type |
|---|
Braces of Perfect Matching Width 2 (available as arXiv preprint) | N/A | Paper |
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem (available as arXiv preprint) | N/A | Paper |
Unavoidable induced subgraphs in graphs with complete bipartite induced minors (available as arXiv preprint) | N/A | Paper |
Computing $\vec{\mathcal{S}}$-DAGs and Parity Games (available as arXiv preprint) | N/A | Paper |
| Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs | 2026-08-11 | Paper |
| The Erdős-Pósa property for circle graphs as vertex-minors | 2026-07-13 | Paper |
| On graphs coverable by chubby shortest paths | 2026-07-10 | Paper |
| Cycles of well-linked sets and an elementary bound for the directed grid theorem | 2026-06-23 | Paper |
Odd coloring graphs with linear neighborhood complexity (available as arXiv preprint) | 2026-01-01 | Paper |
Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem (available as arXiv preprint) | 2026-01-01 | Paper |
An Erdős-Pósa theorem for cycles and faces of distinct lengths (available as arXiv preprint) | 2026-01-01 | Paper |
A directed flat wall theorem excluding a crossrow grid (available as arXiv preprint) | 2026-01-01 | Paper |
Minimal Cayley graphs with large chromatic number (available as arXiv preprint) | 2026-01-01 | Paper |
Potatoes and Onions (available as arXiv preprint) | 2026-01-01 | Paper |
Graphs with two moplexes Procedia Computer Science | 2025-12-02 | Paper |
Girth in \(\mathsf{GF}(q)\)-representable matroids Bulletin of the London Mathematical Society | 2025-11-27 | Paper |
Unavoidable induced subgraphs in graphs with complete bipartite induced minors SIAM Journal on Discrete Mathematics | 2025-10-29 | Paper |
Braces of perfect matching width 2 The Electronic Journal of Combinatorics | 2025-03-25 | Paper |
Bounds on treewidth via excluding disjoint unions of cycles (available as arXiv preprint) | 2025-01-01 | Paper |
On graphs coverable by chubby shortest paths (available as arXiv preprint) | 2025-01-01 | Paper |
Quasi-isometries between graphs with variable edge lengths (available as arXiv preprint) | 2025-01-01 | Paper |
Directed treewidth is closed under taking butterfly minors (available as arXiv preprint) | 2025-01-01 | Paper |
Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs (available as arXiv preprint) | 2025-01-01 | Paper |
On graphs with a simple structure of maximal cliques (available as arXiv preprint) | 2025-01-01 | Paper |
The Erdős-Pósa property for circle graphs as vertex-minors (available as arXiv preprint) | 2025-01-01 | Paper |
Unavoidable butterfly minors in digraphs of large cycle rank (available as arXiv preprint) | 2025-01-01 | Paper |
Dualities in graphs and digraphs Foundations of Computing | 2024-11-01 | Paper |
Graphs with at most two moplexes Journal of Graph Theory | 2024-08-30 | Paper |
| Fixed-parameter tractability of \textsc{Directed Multicut} with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation | 2024-05-14 | Paper |
Half-integral Erdős-Pósa property for non-null S-T paths (available as arXiv preprint) | 2024-01-01 | Paper |
Erdős-Pósa property of tripods in directed graphs (available as arXiv preprint) | 2024-01-01 | Paper |
Counterexample to Babai's lonely colour conjecture (available as arXiv preprint) | 2024-01-01 | Paper |
Generating strongly 2-connected digraphs (available as arXiv preprint) | 2024-01-01 | Paper |
Constant Congestion Brambles Discrete Mathematics & Theoretical Computer Science | 2023-05-30 | Paper |
Tuza's Conjecture for Threshold Graphs Discrete Mathematics & Theoretical Computer Science | 2023-05-30 | Paper |
| Decomposition of (infinite) digraphs along directed 1-separations | 2023-05-16 | Paper |
| On tree decompositions whose trees are minors | 2023-02-23 | Paper |
| Tight bound on treedepth in terms of pathwidth and longest path | 2023-02-06 | Paper |
| Simpler and faster algorithms for detours in planar digraphs | 2023-01-06 | Paper |
Decomposition of (infinite) digraphs along directed 1-separations (available as arXiv preprint) | 2023-01-01 | Paper |
Encoding CSP into CCS (available as arXiv preprint) | 2021-12-03 | Paper |
| Encoding CSP into CCS | 2021-12-03 | Paper |
| Graphs with at most two moplexes | 2021-06-18 | Paper |
Avoidable paths in graphs The Electronic Journal of Combinatorics | 2020-12-13 | Paper |
Cyclewidth and the grid theorem for perfect matching width of bipartite graphs (available as arXiv preprint) | 2020-02-24 | Paper |
Polynomial planar directed grid theorem Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs (available as arXiv preprint) | 2019-02-04 | Paper |
| The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs | 2018-12-13 | Paper |
| On perfect linegraph squares | 2018-11-22 | Paper |
The minimum shared edges problem on grid-like graphs (available as arXiv preprint) | 2018-01-04 | Paper |
The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs (available as arXiv preprint) | 2018-01-01 | Paper |