| Excluding a Ladder | 0 | 0.34 | 2022 |
| Obstructions for bounded shrub-depth and rank-depth | 0 | 0.34 | 2021 |
| Chi-boundedness of graph classes excluding wheel vertex-minors. | 1 | 0.40 | 2019 |
| Forcing clique immersions through chromatic number. | 0 | 0.34 | 2019 |
| Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor: WOLLAN and WOOD | 0 | 0.34 | 2019 |
| Chi-boundedness of graph classes excluding wheel vertex-minors | 0 | 0.34 | 2019 |
| K6 MINORS IN LARGE 6-CONNECTED GRAPHS | 1 | 0.36 | 2018 |
| A new proof of the flat wall theorem. | 1 | 0.36 | 2018 |
| K6 minors in large 6-connected graphs | 0 | 0.34 | 2018 |
| Half-integral linkages in highly connected directed graphs. | 0 | 0.34 | 2017 |
| Rooted grid minors | 1 | 0.36 | 2017 |
| Stabilizer theorems for even cycle matroids. | 2 | 0.39 | 2016 |
| A structure theorem for strong immersions | 2 | 0.36 | 2016 |
| Forcing clique immersions through chromatic number | 1 | 0.35 | 2016 |
| Displaying blocking pairs in signed graphs | 0 | 0.34 | 2016 |
| The Erdos-Posa Property for Directed Graphs. | 0 | 0.34 | 2016 |
| Immersions in Highly Edge Connected Graphs. | 8 | 0.58 | 2014 |
| Relationships between Pairs of Representations of Signed Binary Matroids. | 3 | 0.48 | 2013 |
| The Erdős-Pósa property for clique minors in highly connected graphs | 6 | 0.42 | 2012 |
| Finite connectivity in infinite matroids | 5 | 0.84 | 2012 |
| On the excluded minor structure theorem for graphs of large tree-width | 6 | 0.45 | 2012 |
| K_6 minors in large 6-connected graphs | 6 | 0.52 | 2012 |
| K_6 minors in 6-connected graphs of bounded tree-width | 6 | 0.59 | 2012 |
| A simpler algorithm and shorter proof for the graph minor decomposition | 20 | 0.75 | 2011 |
| The Graph Minor Algorithm with Parity Conditions | 10 | 0.52 | 2011 |
| Packing cycles with modularity constraints | 8 | 0.48 | 2011 |
| New proofs in graph minors | 0 | 0.34 | 2011 |
| Finding topological subgraphs is fixed-parameter tractable | 42 | 1.26 | 2011 |
| Bridges in Highly Connected Graphs | 0 | 0.34 | 2010 |
| Packing non-zero A-paths in an undirected model of group labeled graphs | 1 | 0.37 | 2010 |
| Voting in Agreeable Societies | 1 | 0.99 | 2010 |
| A shorter proof of the graph minor algorithm: the unique linkage theorem | 29 | 0.99 | 2010 |
| Extremal functions for rooted minors | 5 | 0.47 | 2008 |
| The extremal function for 3-linked graphs | 7 | 1.08 | 2008 |
| A weaker version of Lovász' path removal conjecture | 11 | 0.91 | 2008 |
| Proper minor-closed families are small | 33 | 1.64 | 2006 |
| Extremal Functions for Shortening Sets of Paths | 0 | 0.34 | 2006 |
| Non-zero disjoint cycles in highly connected group labelled graphs | 14 | 0.79 | 2005 |
| Generation of simple quadrangulations of the sphere | 10 | 1.26 | 2005 |
| An improved linear edge bound for graph linkages | 56 | 4.30 | 2005 |
