Paul Wollan

Bertrand Guenin, Irene Pivotto, Paul Wollan: Relationships between Pairs of Representations of Signed Binary Matroids. SIAM J. Discrete Math. 27(1): 329-341 (2013)

Henning Bruhn, Paul Wollan: Finite connectivity in infinite matroids. Eur. J. Comb. 33(8): 1900-1912 (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): 454-469 (2012)

M. Pontecorvi, Paul Wollan: Disjoint cycles intersecting a set of vertices. J. Comb. Theory, Ser. B 102(5): 1134-1141 (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): 1189-1210 (2012)

Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan: K_6 minors in 6-connected graphs of bounded tree-width. CoRR abs/1203.2171 (2012)

Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan: K_6 minors in large 6-connected graphs. CoRR abs/1203.2192 (2012)

Paul Wollan: Packing cycles with modularity constraints. Combinatorica 31(1): 95-126 (2011)

Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan: The Graph Minor Algorithm with Parity Conditions. FOCS 2011: 27-36

Paul Wollan: New Proofs in Graph Minors. MFCS 2011: 35

Ken-ichi Kawarabayashi, Paul Wollan: A simpler algorithm and shorter proof for the graph minor decomposition. STOC 2011: 451-458

Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan: Finding topological subgraphs is fixed-parameter tractable. STOC 2011: 479-488

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

Paul Wollan: Bridges in Highly Connected Graphs. SIAM J. Discrete Math. 24(4): 1731-1741 (2010)

Deborah E. Berg, Serguei Norine, Francis Edward Su, Robin Thomas, Paul Wollan: Voting in Agreeable Societies. The American Mathematical Monthly 117(1): 27-39 (2010)

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

Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan: Finding topological subgraphs is fixed-parameter tractable. CoRR abs/1011.1827 (2010)

Robin Thomas, Paul Wollan: The extremal function for 3-linked graphs. J. Comb. Theory, Ser. B 98(5): 939-971 (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): 972-979 (2008)

Paul Wollan: Extremal functions for rooted minors. Journal of Graph Theory 58(2): 159-178 (2008)

Paul Wollan: Extremal Functions for Shortening Sets of Paths. Combinatorics, Probability & Computing 15(6): 927-932 (2006)

Ken-ichi Kawarabayashi, Paul Wollan: Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theory, Ser. B 96(2): 296-301 (2006)

Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan: Proper minor-closed families are small. J. Comb. Theory, Ser. B 96(5): 754-757 (2006)

Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan: Generation of simple quadrangulations of the sphere. Discrete Mathematics 305(1-3): 33-54 (2005)

Robin Thomas, Paul Wollan: An improved linear edge bound for graph linkages. Eur. J. Comb. 26(3-4): 309-324 (2005)

Ken-ichi Kawarabayashi, Paul Wollan: Non-zero disjoint cycles in highly connected group labeled graphs. Electronic Notes in Discrete Mathematics 22: 271-275 (2005)