| The Extremal Function for Bipartite Linklessly Embeddable Graphs | 1 | 0.40 | 2019 |
| Girth Six Cubic Graphs Have Petersen Minors | 0 | 0.34 | 2019 |
| The extremal functions for triangle-free graphs with excluded minors. | 0 | 0.34 | 2019 |
| A new proof of the flat wall theorem. | 1 | 0.36 | 2018 |
| Five-list-coloring graphs on surfaces III. One list of size one and one list of size two. | 1 | 0.36 | 2018 |
| K6 minors in large 6-connected graphs | 0 | 0.34 | 2018 |
| Four Edge-Independent Spanning Trees. | 1 | 0.35 | 2018 |
| Minors of two-connected graphs of large path-width. | 1 | 0.48 | 2017 |
| Deploying Robots With Two Sensors in K1, 6‐Free Graphs | 6 | 0.51 | 2016 |
| Non-planar extensions of subdivisions of planar graphs | 1 | 0.42 | 2016 |
| Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm | 2 | 0.41 | 2016 |
| Three-edge-colouring doublecross cubic graphs | 1 | 0.34 | 2016 |
| Odd K3, 3 subdivisions in bipartite graphs. | 0 | 0.34 | 2016 |
| Hyperbolic families and coloring graphs on surfaces. | 1 | 0.36 | 2016 |
| Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk | 1 | 0.36 | 2015 |
| Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations | 5 | 0.53 | 2015 |
| Excluding A Grid Minor In Planar Digraphs | 0 | 0.34 | 2015 |
| Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. | 4 | 0.55 | 2014 |
| Non-embeddable extensions of embedded minors | 1 | 0.40 | 2014 |
| Reducibility in the Four-Color Theorem. | 0 | 0.34 | 2014 |
| Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk | 2 | 0.43 | 2013 |
| K4-free graphs with no odd holes | 8 | 0.77 | 2010 |
| Deciding First-Order Properties for Sparse Graphs | 37 | 1.27 | 2010 |
| The extremal function for 3-linked graphs | 7 | 1.08 | 2008 |
| Pfaffian labelings and signs of edge colorings | 1 | 0.36 | 2008 |
| Proper minor-closed families are small | 33 | 1.64 | 2006 |
| Independent sets in triangle-free cubic planar graphs | 13 | 0.77 | 2006 |
| An improved linear edge bound for graph linkages | 56 | 4.30 | 2005 |
| Generating Internally Four-Connected Graphs | 10 | 0.90 | 2002 |
| Large induced forests in sparse graphs | 25 | 1.89 | 2001 |
| Permanents, Pfaffian orientations, and even directed circuits (extended abstract) | 12 | 1.14 | 1997 |
| Efficiently four-coloring planar graphs | 30 | 2.08 | 1996 |
| Uniqueness of highly representative surface embeddings | 8 | 0.77 | 1996 |
| Graph searching and a min-max theorem for tree-width | 176 | 8.70 | 1993 |
| The Menger-like property of the tree-width of infinite graphs | 3 | 0.55 | 1991 |
| On the orientable genus of graphs embedded in the Klein bottle | 9 | 1.42 | 1991 |
