Generation of simple quadrangulations of the sphere. - Gunnar Brinkmann; Sam Greenberg; Catherine S. Greenhill; Brendan D. McKay; Robin Thomas 001; Paul Wollan (Discret. Math., 2005)

An improved linear edge bound for graph linkages. - Robin Thomas 001; Paul Wollan (Eur. J. Comb., 2005)

Non-zero disjoint cycles in highly connected group labeled graphs. - Ken-ichi Kawarabayashi; Paul Wollan (Electron. Notes Discret. Math., 2005)

Extremal Functions for Graph Linkages and Rooted Minors. - Paul Wollan (2005)

Extremal Functions for Shortening Sets of Paths. - Paul Wollan (Comb. Probab. Comput., 2006)

Non-zero disjoint cycles in highly connected group labelled graphs. - Ken-ichi Kawarabayashi; Paul Wollan (J. Comb. Theory B, 2006)

Proper minor-closed families are small. - Serguei Norine; Paul D. Seymour; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2006)

A weaker version of Lovász' path removal conjecture. - Ken-ichi Kawarabayashi; Orlando Lee; Bruce A. Reed; Paul Wollan (J. Comb. Theory B, 2008)

The extremal function for 3-linked graphs. - Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2008)

Extremal functions for rooted minors. - Paul Wollan (J. Graph Theory, 2008)

A shorter proof of the graph minor algorithm: the unique linkage theorem. - Ken-ichi Kawarabayashi; Paul Wollan (STOC, 2010)

Packing non-zero A-paths in an undirected model of group labeled graphs. - Paul Wollan (J. Comb. Theory B, 2010)

Bridges in Highly Connected Graphs. - Paul Wollan (SIAM J. Discret. Math., 2010)

Voting in Agreeable Societies. - Deborah E. Berg; Serguei Norine; Francis Edward Su; Robin Thomas 001; Paul Wollan (Am. Math. Mon., 2010)

The Graph Minor Algorithm with Parity Conditions. - Ken-ichi Kawarabayashi; Bruce A. Reed; Paul Wollan (FOCS, 2011)

New Proofs in Graph Minors. - Paul Wollan (MFCS, 2011)

Finding topological subgraphs is fixed-parameter tractable. - Martin Grohe; Ken-ichi Kawarabayashi; Dániel Marx; Paul Wollan (STOC, 2011)

A simpler algorithm and shorter proof for the graph minor decomposition. - Ken-ichi Kawarabayashi; Paul Wollan (STOC, 2011)

Packing cycles with modularity constraints. - Paul Wollan (Comb., 2011)

K_6 minors in 6-connected graphs of bounded tree-width - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (CoRR, 2012)

K_6 minors in large 6-connected graphs - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (CoRR, 2012)

Finite connectivity in infinite matroids. - Henning Bruhn; Paul Wollan (Eur. J. Comb., 2012)

On the excluded minor structure theorem for graphs of large tree-width. - Reinhard Diestel; Ken-ichi Kawarabayashi; Theodor Müller; Paul Wollan (J. Comb. Theory B, 2012)

The Erdős-Pósa property for clique minors in highly connected graphs. - Reinhard Diestel; Ken-ichi Kawarabayashi; Paul Wollan (J. Comb. Theory B, 2012)

Disjoint cycles intersecting a set of vertices. - Matteo Pontecorvi; Paul Wollan (J. Comb. Theory B, 2012)

Relationships between Pairs of Representations of Signed Binary Matroids. - Bertrand Guenin; Irene Pivotto; Paul Wollan (SIAM J. Discret. Math., 2013)

Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem. - Ilario Bonacina; Nicola Galesi; Tony Huynh; Paul Wollan (Electron. Colloquium Comput. Complex., 2014)

Immersions in Highly Edge Connected Graphs. - Dániel Marx; Paul Wollan (SIAM J. Discret. Math., 2014)

An exact characterization of tractable demand patterns for maximum disjoint path problems. - Dániel Marx; Paul Wollan (SODA, 2015)

The structure of graphs not admitting a fixed immersion. - Paul Wollan (J. Comb. Theory B, 2015)

The Erdos-Posa Property for Directed Graphs. - Saeed Akhoondian Amiri; Ken-ichi Kawarabayashi; Stephan Kreutzer; Paul Wollan (CoRR, 2016)

Displaying blocking pairs in signed graphs. - Bertrand Guenin; Irene Pivotto; Paul Wollan (Eur. J. Comb., 2016)

Forcing clique immersions through chromatic number. - Tien-Nam Le; Paul Wollan (Electron. Notes Discret. Math., 2016)

Stabilizer theorems for even cycle matroids. - Bertrand Guenin; Irene Pivotto; Paul Wollan (J. Comb. Theory B, 2016)

A Structure Theorem for Strong Immersions. - Zdenek Dvorák 001; Paul Wollan (J. Graph Theory, 2016)

Finding Topological Subgraphs. - Paul Wollan (Encyclopedia of Algorithms, 2016)

Half-Integral Linkages in Highly Connected Directed Graphs. - Katherine Edwards; Irene Muzi; Paul Wollan (ESA, 2017)

Space proof complexity for random 3-CNFs. - Patrick Bennett; Ilario Bonacina; Nicola Galesi; Tony Huynh; Mike Molloy 001; Paul Wollan (Inf. Comput., 2017)

Rooted grid minors. - Dániel Marx; Paul D. Seymour; Paul Wollan (J. Comb. Theory B, 2017)

K6 minors in large 6-connected graphs. - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2018)

A new proof of the flat wall theorem. - Ken-ichi Kawarabayashi; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2018)

A Unified Erdős-Pósa Theorem for Constrained Cycles. - Tony Huynh; Felix Joos; Paul Wollan (Comb., 2019)

Forcing clique immersions through chromatic number. - Gregory Gauthier; Tien-Nam Le; Paul Wollan (Eur. J. Comb., 2019)

Chi-boundedness of graph classes excluding wheel vertex-minors. - Ho-Jin Choi; O-joung Kwon; Sang-il Oum; Paul Wollan (J. Comb. Theory B, 2019)

K6 minors in 6-connected graphs of bounded tree-width. - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2019)

Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor. - Paul Wollan; David R. Wood (J. Graph Theory, 2019)

Quickly excluding a non-planar graph. - Ken-ichi Kawarabayashi; Robin Thomas 001; Paul Wollan (CoRR, 2020)

Obstructions for bounded shrub-depth and rank-depth. - O-joung Kwon; Rose McCarty; Sang-il Oum; Paul Wollan (J. Comb. Theory B, 2021)

Excluding a Ladder. - Tony Huynh; Gwenaël Joret; Piotr Micek; Michal T. Seweryn; Paul Wollan (Comb., 2022)

The induced two paths problem. - Sandra Albrechtsen; Tony Huynh; Raphael W. Jacobs; Paul Knappe; Paul Wollan (CoRR, 2023)

The Grid Theorem for vertex-minors. - Jim Geelen; O-joung Kwon; Rose McCarty; Paul Wollan (J. Comb. Theory B, 2023)

A Menger-Type Theorem for Two Induced Paths. - Sandra Albrechtsen; Tony Huynh; Raphael W. Jacobs; Paul Knappe; Paul Wollan (SIAM J. Discret. Math., 2024)