Остановите войну!
for scientists:
default search action
Paul Wollan
- > Home > Persons > Paul Wollan
Publications
- 2020
- [i11]Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan:
Quickly excluding a non-planar graph. CoRR abs/2010.12397 (2020) - 2019
- [j31]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in 6-connected graphs of bounded tree-width. J. Comb. Theory, Ser. B 136: 1-32 (2019) - 2018
- [j29]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in large 6-connected graphs. J. Comb. Theory, Ser. B 129: 158-203 (2018) - [j28]Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan:
A new proof of the flat wall theorem. J. Comb. Theory, Ser. B 129: 204-238 (2018) - 2016
- [i9]Saeed Akhoondian Amiri, Ken-ichi Kawarabayashi, Stephan Kreutzer, Paul Wollan:
The Erdos-Posa Property for Directed Graphs. CoRR abs/1603.02504 (2016) - 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, Ser. B 102(2): 454-469 (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, Ser. 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
- [c5]Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan:
The Graph Minor Algorithm with Parity Conditions. FOCS 2011: 27-36 - [c3]Ken-ichi Kawarabayashi, Paul Wollan:
A simpler algorithm and shorter proof for the graph minor decomposition. STOC 2011: 451-458 - [c2]Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan:
Finding topological subgraphs is fixed-parameter tractable. STOC 2011: 479-488 - 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) - 2008
- [j8]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) - 2006
- [j5]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) - 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)
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 2023-12-02 23:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint