The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Paul Wollan" ( http://dblp.L3S.de/Authors/Paul_Wollan )

  Author page on DBLP  Author page in RDF  Community of Paul Wollan in ASPL-2

Publication years (Num. hits)
2005-2011 (18) 2012 (3)
Publication types (Num. hits)
article(16) inproceedings(5)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 21 publication records. Showing 21 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan The Erdős-Pósa property for clique minors in highly connected graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan K_6 minors in large 6-connected graphs Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan K_6 minors in 6-connected graphs of bounded tree-width Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Paul Wollan Packing cycles with modularity constraints. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paul Wollan New Proofs in Graph Minors. Search on Bibsonomy MFCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan The Graph Minor Algorithm with Parity Conditions. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Paul Wollan A simpler algorithm and shorter proof for the graph minor decomposition. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan Finding topological subgraphs is fixed-parameter tractable. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paul Wollan Packing non-zero A-paths in an undirected model of group labeled graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan Finding topological subgraphs is fixed-parameter tractable Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Paul Wollan Bridges in Highly Connected Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Paul Wollan A shorter proof of the graph minor algorithm: the unique linkage theorem. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan A weaker version of Lovász' path removal conjecture. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Robin Thomas, Paul Wollan The extremal function for 3-linked graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Paul Wollan Extremal functions for rooted minors. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan Proper minor-closed families are small. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Paul Wollan Non-zero disjoint cycles in highly connected group labelled graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Paul Wollan Extremal Functions for Shortening Sets of Paths. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Paul Wollan Non-zero disjoint cycles in highly connected group labeled graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan Generation of simple quadrangulations of the sphere. Search on Bibsonomy Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Robin Thomas, Paul Wollan An improved linear edge bound for graph linkages. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #21 of 21 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.