| Publication | Date of Publication | Type |
|---|
| A Menger-type theorem for two induced paths | 2024-05-08 | Paper |
| Explicit bounds for graph minors | 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 | 2022-11-23 | Paper |
| Excluding a ladder | 2022-11-09 | Paper |
| Obstructions for bounded shrub-depth and rank-depth | 2021-06-18 | Paper |
| Quickly excluding a non-planar graph | 2020-10-23 | Paper |
| Half-integral linkages in highly connected directed graphs | 2020-05-27 | Paper |
| Excluding a ladder | 2020-02-02 | Paper |
| Forcing clique immersions through chromatic number | 2019-08-30 | Paper |
| Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor | 2019-08-15 | Paper |
| \(K_{6}\) minors in 6-connected graphs of bounded tree-width | 2019-06-17 | Paper |
| A unified Erdős-Pósa theorem for constrained cycles | 2019-05-23 | Paper |
| Chi-boundedness of graph classes excluding wheel vertex-minors | 2019-02-08 | Paper |
| Explicit bounds for graph minors | 2018-07-24 | Paper |
| \(K_{6}\) minors in large 6-connected graphs | 2018-02-09 | Paper |
| A new proof of the flat wall theorem | 2018-02-09 | Paper |
| Chi-boundedness of graph classes excluding wheel vertex-minors | 2018-01-18 | Paper |
| An exact characterization of tractable demand patterns for maximum disjoint path problems | 2017-10-05 | Paper |
| Space proof complexity for random 3-CNFs | 2017-08-08 | Paper |
| Forcing clique immersions through chromatic number | 2017-02-13 | Paper |
| Rooted grid minors | 2016-11-25 | Paper |
| A structure theorem for strong immersions | 2016-10-13 | Paper |
| Stabilizer theorems for even cycle matroids | 2016-03-14 | Paper |
| The Erdos-Posa Property for Directed Graphs | 2016-03-08 | Paper |
| Displaying blocking pairs in signed graphs | 2015-09-30 | Paper |
| The structure of graphs not admitting a fixed immersion | 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 | 2014-08-13 | Paper |
| The Graph Minor Algorithm with Parity Conditions | 2014-07-30 | Paper |
| Immersions in Highly Edge Connected Graphs | 2014-06-19 | Paper |
| Finding topological subgraphs is fixed-parameter tractable | 2014-06-05 | Paper |
| A simpler algorithm and shorter proof for the graph minor decomposition | 2014-06-05 | Paper |
| Linkages in Large Graphs of Bounded Tree-Width | 2014-02-22 | Paper |
| Axioms for infinite matroids | 2014-01-08 | Paper |
| Relationships between Pairs of Representations of Signed Binary Matroids | 2013-06-27 | Paper |
| On the excluded minor structure theorem for graphs of large tree-width | 2013-01-14 | Paper |
| Finite connectivity in infinite matroids | 2012-09-12 | Paper |
| The Erdős-Pósa property for clique minors in highly connected graphs | 2012-05-04 | Paper |
| Packing cycles with modularity constraints | 2011-12-20 | Paper |
| Bridges in Highly Connected Graphs | 2011-07-18 | Paper |
| Voting in Agreeable Societies | 2010-12-01 | Paper |
| Packing non-zero \(A\)-paths in an undirected model of group labeled graphs | 2010-04-21 | Paper |
| A weaker version of Lovász' path removal conjecture | 2008-10-07 | Paper |
| The extremal function for 3-linked graphs | 2008-10-07 | Paper |
| Extremal functions for rooted minors | 2008-06-12 | Paper |
| Non-zero disjoint cycles in highly connected group labeled graphs | 2007-05-29 | Paper |
| Extremal Functions for Shortening Sets of Paths | 2007-02-07 | Paper |
| Proper minor-closed families are small | 2006-08-16 | Paper |
| Non-zero disjoint cycles in highly connected group labelled graphs | 2006-04-28 | Paper |
| Generation of simple quadrangulations of the sphere | 2006-01-10 | Paper |
| An improved linear edge bound for graph linkages | 2005-03-08 | Paper |
