According to our database
1,
Paul Wollan
authored at least 50 papers
between 2005 and 2023.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2023
The Grid Theorem for vertex-minors.
J. Comb. Theory, Ser. B, 2023
The induced two paths problem.
CoRR, 2023
2022
2021
Obstructions for bounded shrub-depth and rank-depth.
J. Comb. Theory, Ser. B, 2021
2020
Quickly excluding a non-planar graph.
CoRR, 2020
2019
Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor.
J. Graph Theory, 2019
<i>K</i><sub>6</sub> minors in 6-connected graphs of bounded tree-width.
J. Comb. Theory, Ser. B, 2019
Forcing clique immersions through chromatic number.
Eur. J. Comb., 2019
A Unified Erdős-Pósa Theorem for Constrained Cycles.
Comb., 2019
2018
A new proof of the flat wall theorem.
J. Comb. Theory, Ser. B, 2018
<i>K</i><sub>6</sub> minors in large 6-connected graphs.
J. Comb. Theory, Ser. B, 2018
2017
J. Comb. Theory, Ser. B, 2017
Space proof complexity for random 3-CNFs.
Inf. Comput., 2017
Chi-boundedness of graph classes excluding wheel vertex-minors.
Electron. Notes Discret. Math., 2017
Half-Integral Linkages in Highly Connected Directed Graphs.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
2016
Finding Topological Subgraphs.
Encyclopedia of Algorithms, 2016
A Structure Theorem for Strong Immersions.
J. Graph Theory, 2016
Stabilizer theorems for even cycle matroids.
J. Comb. Theory, Ser. B, 2016
Forcing clique immersions through chromatic number.
Electron. Notes Discret. Math., 2016
Displaying blocking pairs in signed graphs.
Eur. J. Comb., 2016
The Erdos-Posa Property for Directed Graphs.
CoRR, 2016
2015
The structure of graphs not admitting a fixed immersion.
J. Comb. Theory, Ser. B, 2015
An exact characterization of tractable demand patterns for maximum disjoint path problems.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
2014
Immersions in Highly Edge Connected Graphs.
SIAM J. Discret. Math., 2014
Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem.
Electron. Colloquium Comput. Complex., 2014
2013
Relationships between Pairs of Representations of Signed Binary Matroids.
SIAM J. Discret. Math., 2013
2012
Disjoint cycles intersecting a set of vertices.
J. Comb. Theory, Ser. B, 2012
The Erdős-Pósa property for clique minors in highly connected graphs.
J. Comb. Theory, Ser. B, 2012
On the excluded minor structure theorem for graphs of large tree-width.
J. Comb. Theory, Ser. B, 2012
Finite connectivity in infinite matroids.
Eur. J. Comb., 2012
K_6 minors in large 6-connected graphs
CoRR, 2012
K_6 minors in 6-connected graphs of bounded tree-width
CoRR, 2012
2011
Packing cycles with modularity constraints.
Comb., 2011
A simpler algorithm and shorter proof for the graph minor decomposition.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Finding topological subgraphs is fixed-parameter tractable.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
New Proofs in Graph Minors.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011
The Graph Minor Algorithm with Parity Conditions.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
2010
Voting in Agreeable Societies.
Am. Math. Mon., 2010
Bridges in Highly Connected Graphs.
SIAM J. Discret. Math., 2010
Packing non-zero A-paths in an undirected model of group labeled graphs.
J. Comb. Theory, Ser. B, 2010
A shorter proof of the graph minor algorithm: the unique linkage theorem.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
2008
Extremal functions for rooted minors.
J. Graph Theory, 2008
The extremal function for 3-linked graphs.
J. Comb. Theory, Ser. B, 2008
A weaker version of Lovász' path removal conjecture.
J. Comb. Theory, Ser. B, 2008
2006
Proper minor-closed families are small.
J. Comb. Theory, Ser. B, 2006
Non-zero disjoint cycles in highly connected group labelled graphs.
J. Comb. Theory, Ser. B, 2006
Extremal Functions for Shortening Sets of Paths.
Comb. Probab. Comput., 2006
2005
Non-zero disjoint cycles in highly connected group labeled graphs.
Electron. Notes Discret. Math., 2005
An improved linear edge bound for graph linkages.
Eur. J. Comb., 2005
Generation of simple quadrangulations of the sphere.
Discret. Math., 2005
