Paul Wollan - RankMe

60 papers A* 5A 1B 1Journal 51

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