| Excluding a Ladder | 0 | 0.34 | 2022 |
| Subgraph densities in a surface. | 0 | 0.34 | 2022 |
| Unavoidable Minors For Graphs With Large L(P)-Dimension | 0 | 0.34 | 2021 |
| Adjacency Labelling for Planar Graphs (and Beyond) | 0 | 0.34 | 2021 |
| Packing And Covering Balls In Graphs Excluding A Minor | 0 | 0.34 | 2021 |
| Approximating pathwidth for graphs of small treewidth | 0 | 0.34 | 2021 |
| Adjacency Labelling for Planar Graphs (and Beyond) | 0 | 0.34 | 2020 |
| Erdös-Pósa from Ball Packing. | 0 | 0.34 | 2020 |
| Planar Graphs Have Bounded Queue-Number | 1 | 0.36 | 2020 |
| The stable set problem in graphs with bounded genus and bounded odd cycle packing number. | 0 | 0.34 | 2020 |
| Planar Graphs have Bounded Queue-Number | 0 | 0.34 | 2019 |
| A tight Erdős-Pósa function for planar minors. | 0 | 0.34 | 2019 |
| Nowhere Dense Graph Classes and Dimension. | 1 | 0.36 | 2019 |
| Planar graphs have bounded nonrepetitive chromatic number. | 0 | 0.34 | 2019 |
| Information-theoretic lower bounds for quantum sorting. | 0 | 0.34 | 2019 |
| Progress On The Adjacent Vertex Distinguishing Edge Coloring Conjecture | 0 | 0.34 | 2018 |
| Burling graphs, chromatic number, and orthogonal tree-decompositions. | 0 | 0.34 | 2018 |
| MINOR-CLOSED GRAPH CLASSES WITH BOUNDED LAYERED PATHWIDTH | 1 | 0.36 | 2018 |
| Corrigendum: Orthogonal Tree Decompositions of Graphs. | 0 | 0.34 | 2018 |
| Orthogonal Tree Decompositions of Graphs. | 0 | 0.34 | 2018 |
| K4-Minor-Free Induced Subgraphs of Sparse Connected Graphs. | 0 | 0.34 | 2018 |
| Seymour's conjecture on 2-connected graphs of large pathwidth. | 0 | 0.34 | 2018 |
| A tight Erdős-Pósa function for wheel minors. | 0 | 0.34 | 2018 |
| Planar posets have dimension at most linear in their height. | 1 | 0.36 | 2017 |
| Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-genus Graphs. | 0 | 0.34 | 2017 |
| Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments. | 2 | 0.41 | 2017 |
| K-4-MINOR-FREE INDUCED SUBGRAPHS OF SPARSE CONNECTED GRAPHS | 0 | 0.34 | 2016 |
| Sparsity and dimension. | 3 | 0.56 | 2016 |
| Hitting and Harvesting Pumpkins. | 4 | 0.41 | 2014 |
| A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces. | 4 | 0.49 | 2014 |
| Colouring Planar Graphs With Three Colours and No Large Monochromatic Components. | 0 | 0.34 | 2013 |
| Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. | 1 | 0.37 | 2013 |
| Complete graph minors and the graph minor structure theorem | 8 | 0.46 | 2013 |
| The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs | 7 | 0.58 | 2013 |
| Tree-Width and Dimension | 9 | 0.72 | 2013 |
| Boxicity of Graphs on Surfaces | 4 | 0.43 | 2013 |
| A linear-time algorithm for finding a complete graph minor in a dense graph | 2 | 0.39 | 2012 |
| Excluded Forest Minors and the Erdős-Pósa Property. | 0 | 0.34 | 2012 |
| Approximating the balanced minimum evolution problem. | 8 | 0.54 | 2012 |
| AN IMPROVED BOUND FOR FIRST-FIT ON POSETS WITHOUT TWO LONG INCOMPARABLE CHAINS | 5 | 0.53 | 2012 |
| Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours | 9 | 0.61 | 2012 |
| Hitting All Maximal Independent Sets of a Bipartite Graph | 0 | 0.34 | 2012 |
| Reducing the rank of a matroid. | 7 | 0.49 | 2012 |
| Trees with Given Stability Number and Minimum Number of Stable Sets | 1 | 0.37 | 2012 |
| Small minors in dense graphs | 3 | 0.42 | 2012 |
| Empty Pentagons in Point Sets with Collinearities. | 1 | 0.37 | 2012 |
| Nonrepetitive Colouring via Entropy Compression | 7 | 0.50 | 2011 |
| Nordhaus-Gaddum for treewidth | 1 | 0.39 | 2011 |
| Disproof of the List Hadwiger Conjecture | 3 | 0.39 | 2011 |
| On the maximum number of cliques in a graph embedded in a surface | 6 | 0.46 | 2011 |
