Paul Wollan

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 25

Top Topics

Strongly Connected

Top Venues

J. Comb. Theory, Ser. B

SIAM J. Discret. Math.

Publications

Sandra Albrechtsen, Tony Huynh, Raphael W. Jacobs, Paul Knappe, Paul Wollan
A Menger-Type Theorem for Two Induced Paths. SIAM J. Discret. Math. 38 (2) (2024)
Sandra Albrechtsen, Tony Huynh, Raphael W. Jacobs, Paul Knappe, Paul Wollan
The induced two paths problem. CoRR (2023)
Jim Geelen, O-joung Kwon, Rose McCarty, Paul Wollan
The Grid Theorem for vertex-minors. J. Comb. Theory, Ser. B 158 (Part) (2023)
Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan
Excluding a Ladder. Comb. 42 (3) (2022)
O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan
Obstructions for bounded shrub-depth and rank-depth. J. Comb. Theory, Ser. B 149 (2021)
Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan
Excluding a ladder. CoRR (2020)
Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan
Quickly excluding a non-planar graph. CoRR (2020)
Paul Wollan, David R. Wood
Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor. J. Graph Theory 91 (3) (2019)
Tony Huynh, Felix Joos, Paul Wollan
A Unified Erdős-Pósa Theorem for Constrained Cycles. Comb. 39 (1) (2019)
O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan
Obstructions for bounded shrub-depth and rank-depth. CoRR (2019)
Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
Chi-boundedness of graph classes excluding wheel vertex-minors. J. Comb. Theory, Ser. B 135 (2019)
Gregory Gauthier, Tien-Nam Le, Paul Wollan
Forcing clique immersions through chromatic number. Eur. J. Comb. 81 (2019)
Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan
minors in 6-connected graphs of bounded tree-width. J. Comb. Theory, Ser. B 136 (2019)
Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan
A new proof of the flat wall theorem. J. Comb. Theory, Ser. B 129 (2018)
Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan
minors in large 6-connected graphs. J. Comb. Theory, Ser. B 129 (2018)
Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
Space proof complexity for random 3-CNFs. Inf. Comput. 255 (2017)
Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
Chi-boundedness of graph classes excluding wheel vertex-minors. Electron. Notes Discret. Math. 61 (2017)
Dániel Marx, Paul D. Seymour, Paul Wollan
Rooted grid minors. J. Comb. Theory, Ser. B 122 (2017)
Katherine Edwards, Irene Muzi, Paul Wollan
Half-Integral Linkages in Highly Connected Directed Graphs. ESA (2017)
Zdenek Dvorák, Paul Wollan
A Structure Theorem for Strong Immersions. J. Graph Theory 83 (2) (2016)
Saeed Akhoondian Amiri, Ken-ichi Kawarabayashi, Stephan Kreutzer, Paul Wollan
The Erdos-Posa Property for Directed Graphs. CoRR (2016)
Bertrand Guenin, Irene Pivotto, Paul Wollan
Stabilizer theorems for even cycle matroids. J. Comb. Theory, Ser. B 118 (2016)
Tien-Nam Le, Paul Wollan
Forcing clique immersions through chromatic number. Electron. Notes Discret. Math. 54 (2016)
Katherine Edwards, Irene Muzi, Paul Wollan
Half-integral linkages in highly connected directed graphs. CoRR (2016)
Bertrand Guenin, Irene Pivotto, Paul Wollan
Displaying blocking pairs in signed graphs. Eur. J. Comb. 51 (2016)
Paul Wollan
The structure of graphs not admitting a fixed immersion. J. Comb. Theory, Ser. B 110 (2015)
Dániel Marx, Paul Wollan
An exact characterization of tractable demand patterns for maximum disjoint path problems. SODA (2015)
Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
Space proof complexity for random 3-CNFs. CoRR (2015)
Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan
Space proof complexity for random $3$-CNFs via a $(2-ε)$-Hall's Theorem. CoRR (2014)
Dániel Marx, Paul Wollan
An exact characterization of tractable demand patterns for maximum disjoint path problems. CoRR (2014)
Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan
Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem. Electron. Colloquium Comput. Complex. 21 (2014)
Dániel Marx, Paul Wollan
Immersions in Highly Edge Connected Graphs. SIAM J. Discret. Math. 28 (1) (2014)
Bertrand Guenin, Irene Pivotto, Paul Wollan
Relationships between Pairs of Representations of Signed Binary Matroids. SIAM J. Discret. Math. 27 (1) (2013)
Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan
K_6 minors in 6-connected graphs of bounded tree-width CoRR (2012)
Henning Bruhn, Paul Wollan
Finite connectivity in infinite matroids. Eur. J. Comb. 33 (8) (2012)
Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, Paul Wollan
On the excluded minor structure theorem for graphs of large tree-width. J. Comb. Theory, Ser. B 102 (6) (2012)
Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan
The Erdős-Pósa property for clique minors in highly connected graphs. J. Comb. Theory, Ser. B 102 (2) (2012)
Matteo Pontecorvi, Paul Wollan
Disjoint cycles intersecting a set of vertices. J. Comb. Theory, Ser. B 102 (5) (2012)
Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan
K_6 minors in large 6-connected graphs CoRR (2012)
Ken-ichi Kawarabayashi, Paul Wollan
A simpler algorithm and shorter proof for the graph minor decomposition. STOC (2011)
Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan
Finding topological subgraphs is fixed-parameter tractable. STOC (2011)
Paul Wollan
Packing cycles with modularity constraints. Comb. 31 (1) (2011)
Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan
The Graph Minor Algorithm with Parity Conditions. FOCS (2011)
Paul Wollan
New Proofs in Graph Minors. MFCS (2011)
Ken-ichi Kawarabayashi, Paul Wollan
A shorter proof of the graph minor algorithm: the unique linkage theorem. STOC (2010)
Deborah E. Berg, Serguei Norine, Francis Edward Su, Robin Thomas, Paul Wollan
Voting in Agreeable Societies. Am. Math. Mon. 117 (1) (2010)
Paul Wollan
Packing non-zero A-paths in an undirected model of group labeled graphs. J. Comb. Theory, Ser. B 100 (2) (2010)
Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan
Finding topological subgraphs is fixed-parameter tractable CoRR (2010)
Paul Wollan
Bridges in Highly Connected Graphs. SIAM J. Discret. Math. 24 (4) (2010)
Paul Wollan
Extremal functions for rooted minors. J. Graph Theory 58 (2) (2008)
Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan
A weaker version of Lovász' path removal conjecture. J. Comb. Theory, Ser. B 98 (5) (2008)
Robin Thomas, Paul Wollan
The extremal function for 3-linked graphs. J. Comb. Theory, Ser. B 98 (5) (2008)
Paul Wollan
Extremal Functions for Shortening Sets of Paths. Comb. Probab. Comput. 15 (6) (2006)
Ken-ichi Kawarabayashi, Paul Wollan
Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theory, Ser. B 96 (2) (2006)
Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan
Proper minor-closed families are small. J. Comb. Theory, Ser. B 96 (5) (2006)
Ken-ichi Kawarabayashi, Paul Wollan
Non-zero disjoint cycles in highly connected group labeled graphs. Electron. Notes Discret. Math. 22 (2005)
Robin Thomas, Paul Wollan
An improved linear edge bound for graph linkages. Eur. J. Comb. 26 (3-4) (2005)
Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan
Generation of simple quadrangulations of the sphere. Discret. Math. 305 (1-3) (2005)