default search action
Paul Wollan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j38]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): 1438-1450 (2024) - 2023
- [j37]Jim Geelen, O-joung Kwon
The Grid Theorem for vertex-minors. J. Comb. Theory B 158(Part): 93-116 (2023) - [i13]Sandra Albrechtsen, Tony Huynh, Raphael W. Jacobs, Paul Knappe
The induced two paths problem. CoRR abs/2305.04721 (2023) - 2022
- [j36]Tony Huynh
Excluding a Ladder. Comb. 42(3): 405-432 (2022) - 2021
- [j35]O-joung Kwon
Obstructions for bounded shrub-depth and rank-depth. J. Comb. Theory B 149: 76-91 (2021) - 2020
- [i12]Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan:
Excluding a ladder. CoRR abs/2002.00496 (2020) - [i11]Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan:
Quickly excluding a non-planar graph. CoRR abs/2010.12397 (2020)
2010 – 2019
- 2019
- [j34]Tony Huynh
A Unified Erdős-Pósa Theorem for Constrained Cycles. Comb. 39(1): 91-133 (2019) - [j33]Gregory Gauthier, Tien-Nam Le, Paul Wollan:
Forcing clique immersions through chromatic number. Eur. J. Comb. 81: 98-118 (2019) - [j32]Ho-Jin Choi, O-joung Kwon
Chi-boundedness of graph classes excluding wheel vertex-minors. J. Comb. Theory B 135: 319-348 (2019) - [j31]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in 6-connected graphs of bounded tree-width. J. Comb. Theory B 136: 1-32 (2019) - [j30]Paul Wollan, David R. Wood
Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor. J. Graph Theory 91(3): 259-266 (2019) - [i10]O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan:
Obstructions for bounded shrub-depth and rank-depth. CoRR abs/1911.00230 (2019) - 2018
- [j29]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in large 6-connected graphs. J. Comb. Theory B 129: 158-203 (2018) - [j28]Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan:
A new proof of the flat wall theorem. J. Comb. Theory B 129: 204-238 (2018) - 2017
- [j27]Ho-Jin Choi, O-joung Kwon
Chi-boundedness of graph classes excluding wheel vertex-minors. Electron. Notes Discret. Math. 61: 247-253 (2017) - [j26]Patrick Bennett
Space proof complexity for random 3-CNFs. Inf. Comput. 255: 165-176 (2017) - [j25]Dániel Marx, Paul D. Seymour
Rooted grid minors. J. Comb. Theory B 122: 428-437 (2017) - [c7]Katherine Edwards, Irene Muzi, Paul Wollan:
Half-Integral Linkages in Highly Connected Directed Graphs. ESA 2017: 36:1-36:12 - 2016
- [j24]Bertrand Guenin, Irene Pivotto, Paul Wollan:
Displaying blocking pairs in signed graphs. Eur. J. Comb. 51: 135-164 (2016) - [j23]Tien-Nam Le
Forcing clique immersions through chromatic number. Electron. Notes Discret. Math. 54: 121-126 (2016) - [j22]Bertrand Guenin, Irene Pivotto, Paul Wollan:
Stabilizer theorems for even cycle matroids. J. Comb. Theory B 118: 44-75 (2016) - [j21]Zdenek Dvorák
A Structure Theorem for Strong Immersions. J. Graph Theory 83(2): 152-163 (2016) - [r1]Paul Wollan:
Finding Topological Subgraphs. Encyclopedia of Algorithms 2016: 749-752 - [i9]Saeed Akhoondian Amiri, Ken-ichi Kawarabayashi, Stephan Kreutzer, Paul Wollan:
The Erdos-Posa Property for Directed Graphs. CoRR abs/1603.02504 (2016) - [i8]Katherine Edwards, Irene Muzi, Paul Wollan:
Half-integral linkages in highly connected directed graphs. CoRR abs/1611.01004 (2016) - 2015
- [j20]Paul Wollan:
The structure of graphs not admitting a fixed immersion. J. Comb. Theory B 110: 47-66 (2015) - [c6]Dániel Marx, Paul Wollan:
An exact characterization of tractable demand patterns for maximum disjoint path problems. SODA 2015: 642-661 - [i7]Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. CoRR abs/1503.01613 (2015) - 2014
- [j19]Dániel Marx, Paul Wollan:
Immersions in Highly Edge Connected Graphs. SIAM J. Discret. Math. 28(1): 503-520 (2014) - [i6]Dániel Marx, Paul Wollan:
An exact characterization of tractable demand patterns for maximum disjoint path problems. CoRR abs/1411.0871 (2014) - [i5]Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan:
Space proof complexity for random $3$-CNFs via a $(2-ε)$-Hall's Theorem. CoRR abs/1411.1619 (2014) - [i4]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. TR14 (2014) - 2013
- [j18]Bertrand Guenin, Irene Pivotto, Paul Wollan:
Relationships between Pairs of Representations of Signed Binary Matroids. SIAM J. Discret. Math. 27(1): 329-341 (2013) - 2012
- [j17]Henning Bruhn, Paul Wollan:
Finite connectivity in infinite matroids. Eur. J. Comb. 33(8): 1900-1912 (2012) - [j16]Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan:
The Erdős-Pósa property for clique minors in highly connected graphs. J. Comb. Theory B 102(2): 454-469 (2012) - [j15]Matteo Pontecorvi, Paul Wollan:
Disjoint cycles intersecting a set of vertices. J. Comb. Theory B 102(5): 1134-1141 (2012) - [j14]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 B 102(6): 1189-1210 (2012) - [i3]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) - [i2]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K_6 minors in large 6-connected graphs. CoRR abs/1203.2192 (2012) - 2011
- [j13]Paul Wollan:
Packing cycles with modularity constraints. Comb. 31(1): 95-126 (2011) - [c5]Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan:
The Graph Minor Algorithm with Parity Conditions. FOCS 2011: 27-36 - [c4]Paul Wollan:
New Proofs in Graph Minors. MFCS 2011: 35 - [c3]Ken-ichi Kawarabayashi, Paul Wollan:
A simpler algorithm and shorter proof for the graph minor decomposition. STOC 2011: 451-458 - [c2]Martin Grohe
Finding topological subgraphs is fixed-parameter tractable. STOC 2011: 479-488 - 2010
- [j12]Paul Wollan:
Packing non-zero A-paths in an undirected model of group labeled graphs. J. Comb. Theory B 100(2): 141-150 (2010) - [j11]Paul Wollan:
Bridges in Highly Connected Graphs. SIAM J. Discret. Math. 24(4): 1731-1741 (2010) - [j10]Deborah E. Berg
Voting in Agreeable Societies. Am. Math. Mon. 117(1): 27-39 (2010) - [c1]Ken-ichi Kawarabayashi, Paul Wollan:
A shorter proof of the graph minor algorithm: the unique linkage theorem. STOC 2010: 687-694 - [i1]Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan:
Finding topological subgraphs is fixed-parameter tractable. CoRR abs/1011.1827 (2010)
2000 – 2009
- 2008
- [j9]Robin Thomas, Paul Wollan:
The extremal function for 3-linked graphs. J. Comb. Theory B 98(5): 939-971 (2008) - [j8]Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan:
A weaker version of Lovász' path removal conjecture. J. Comb. Theory B 98(5): 972-979 (2008) - [j7]Paul Wollan:
Extremal functions for rooted minors. J. Graph Theory 58(2): 159-178 (2008) - 2006
- [j6]Paul Wollan:
Extremal Functions for Shortening Sets of Paths. Comb. Probab. Comput. 15(6): 927-932 (2006) - [j5]Ken-ichi Kawarabayashi, Paul Wollan:
Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theory B 96(2): 296-301 (2006) - [j4]Serguei Norine, Paul D. Seymour
Proper minor-closed families are small. J. Comb. Theory B 96(5): 754-757 (2006) - 2005
- [j3]Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay
Generation of simple quadrangulations of the sphere. Discret. Math. 305(1-3): 33-54 (2005) - [j2]Robin Thomas, Paul Wollan:
An improved linear edge bound for graph linkages. Eur. J. Comb. 26(3-4): 309-324 (2005) - [j1]Ken-ichi Kawarabayashi, Paul Wollan:
Non-zero disjoint cycles in highly connected group labeled graphs. Electron. Notes Discret. Math. 22: 271-275 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: