| Publication | Date of Publication | Type |
|---|
A characterisation of graphs quasi-isometric to K₄-minor-free graphs
Combinatorica | 2026-01-20 | Paper |
A grid theorem for strong immersions of walls
Journal of Graph Theory | 2025-08-07 | Paper |
A Menger-type theorem for two induced paths
SIAM Journal on Discrete Mathematics | 2024-05-08 | Paper |
Explicit bounds for graph minors
Surveys in Combinatorics 2022 | 2024-01-05 | Paper |
| A structural duality for path-decompositions into parts of small radius | 2023-07-17 | Paper |
| A grid theorem for strong immersions of walls | 2023-01-12 | Paper |
The grid theorem for vertex-minors
Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
Excluding a ladder
Combinatorica | 2022-11-09 | Paper |
Obstructions for bounded shrub-depth and rank-depth
Journal of Combinatorial Theory. Series B | 2021-06-18 | Paper |
| Quickly excluding a non-planar graph | 2020-10-23 | Paper |
Half-integral linkages in highly connected directed graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Excluding a ladder
(available as arXiv preprint) | 2020-02-02 | Paper |
Forcing clique immersions through chromatic number
European Journal of Combinatorics | 2019-08-30 | Paper |
Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor
Journal of Graph Theory | 2019-08-15 | Paper |
\(K_{6}\) minors in 6-connected graphs of bounded tree-width
Journal of Combinatorial Theory. Series B | 2019-06-17 | Paper |
A unified Erdős-Pósa theorem for constrained cycles
Combinatorica | 2019-05-23 | Paper |
Chi-boundedness of graph classes excluding wheel vertex-minors
Journal of Combinatorial Theory. Series B | 2019-02-08 | Paper |
\(K_{6}\) minors in large 6-connected graphs
Journal of Combinatorial Theory. Series B | 2018-02-09 | Paper |
A new proof of the flat wall theorem
Journal of Combinatorial Theory. Series B | 2018-02-09 | Paper |
Chi-boundedness of graph classes excluding wheel vertex-minors
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
An exact characterization of tractable demand patterns for maximum disjoint path problems
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
An exact characterization of tractable demand patterns for maximum disjoint path problems
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Space proof complexity for random 3-CNFs
Information and Computation | 2017-08-08 | Paper |
Forcing clique immersions through chromatic number
Electronic Notes in Discrete Mathematics | 2017-02-13 | Paper |
Rooted grid minors
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
A structure theorem for strong immersions
Journal of Graph Theory | 2016-10-13 | Paper |
Stabilizer theorems for even cycle matroids
Journal of Combinatorial Theory. Series B | 2016-03-14 | Paper |
| The Erdos-Posa Property for Directed Graphs | 2016-03-08 | Paper |
Displaying blocking pairs in signed graphs
European Journal of Combinatorics | 2015-09-30 | Paper |
The structure of graphs not admitting a fixed immersion
Journal of Combinatorial Theory. Series B | 2014-11-21 | Paper |
| Space proof complexity for random $3$-CNFs via a $(2-\epsilon)$-Hall's Theorem | 2014-11-06 | Paper |
A shorter proof of the graph minor algorithm: the unique linkage theorem
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
The Graph Minor Algorithm with Parity Conditions
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Immersions in highly edge connected graphs
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Finding topological subgraphs is fixed-parameter tractable
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Finding topological subgraphs is fixed-parameter tractable
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
A simpler algorithm and shorter proof for the graph minor decomposition
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Linkages in Large Graphs of Bounded Tree-Width | 2014-02-22 | Paper |
Axioms for infinite matroids
Advances in Mathematics | 2014-01-08 | Paper |
Relationships between pairs of representations of signed binary matroids
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
On the excluded minor structure theorem for graphs of large tree-width
Journal of Combinatorial Theory. Series B | 2013-01-14 | Paper |
Finite connectivity in infinite matroids
European Journal of Combinatorics | 2012-09-12 | Paper |
The Erdős-Pósa property for clique minors in highly connected graphs
Journal of Combinatorial Theory. Series B | 2012-05-04 | Paper |
Packing cycles with modularity constraints
Combinatorica | 2011-12-20 | Paper |
Bridges in Highly Connected Graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Voting in agreeable societies
The American Mathematical Monthly | 2010-12-01 | Paper |
Packing non-zero A-paths in an undirected model of group labeled graphs
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
A weaker version of Lovász' path removal conjecture
Journal of Combinatorial Theory. Series B | 2008-10-07 | Paper |
The extremal function for 3-linked graphs
Journal of Combinatorial Theory. Series B | 2008-10-07 | Paper |
Extremal functions for rooted minors
Journal of Graph Theory | 2008-06-12 | Paper |
Non-zero disjoint cycles in highly connected group labeled graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Extremal Functions for Shortening Sets of Paths
Combinatorics, Probability and Computing | 2007-02-07 | Paper |
Proper minor-closed families are small
Journal of Combinatorial Theory. Series B | 2006-08-16 | Paper |
Non-zero disjoint cycles in highly connected group labelled graphs
Journal of Combinatorial Theory. Series B | 2006-04-28 | Paper |
Generation of simple quadrangulations of the sphere
Discrete Mathematics | 2006-01-10 | Paper |
An improved linear edge bound for graph linkages
European Journal of Combinatorics | 2005-03-08 | Paper |
