WOLLAN, PAUL JOSEPH
WOLLAN, PAUL JOSEPH
DIPARTIMENTO DI INFORMATICA
A new proof of the flat wall theorem
2018 Kawarabayashi, K; Thomas, R; Wollan, P
A Shorter Proof of the Graph Minor Algorithm - The Unique Linkage Theorem - [Extended Abstract]
2010 K., Kawarabayashi; Wollan, PAUL JOSEPH
A Simpler Algorithm and Shorter Proof for the Graph Minor Decomposition
2011 K., Kawarabayashi; Wollan, PAUL JOSEPH
A structure theorem for strong immersions
2016 Dvořák, Zdeněk; Wollan, PAUL JOSEPH
A Unified Erdős–Pósa Theorem for Constrained Cycles
2019 Huynh, T.; Joos, FELIX CLAUDIUS; Wollan, P.
A weaker version of Lovasz' path removal conjecture
2008 K. I., Kawarabayashi; O., Lee; B., Reed; Wollan, PAUL JOSEPH
An exact characterization of tractable demand patterns for maximum disjoint path problems
2015 Marx, Dániel; Wollan, PAUL JOSEPH
An improved linear edge bound for graph linkages
2005 R., Thomas; Wollan, PAUL JOSEPH
Axioms for infinite matroids
2013 Henning, Bruhn; Reinhard, Diestel; Matthias, Kriesell; Rudi, Pendavingh; Wollan, PAUL JOSEPH
Bridges in highly connected graphs
2010 Wollan, PAUL JOSEPH
Chi-boundedness of graph classes excluding wheel vertex-minors
2019 Choi, H.; Kwon, O. -J.; Oum, S. -I.; Wollan, P.
Disjoint cycles intersecting a set of vertices
2012 M., Pontecorvi; Wollan, PAUL JOSEPH
Displaying blocking pairs in signed graphs
2016 Guenin, B.; Pivotto, I.; Wollan, PAUL JOSEPH
Excluding a Ladder
2022 Huynh, T.; Joret, G.; Micek, P.; Seweryn, M. T.; Wollan, P.
Extremal functions for rooted minors
2008 Wollan, PAUL JOSEPH
Extremal functions for shortening sets of paths
2006 Wollan, PAUL JOSEPH
Finding topological subgraphs is fixed-parameter tractable
2011 Martin, Grohe; Ken Ichi, Kawarabayashi; Daniel, Marx; Wollan, PAUL JOSEPH
Finite connectivity in infinite matroids
2012 Henning, Bruhn; Wollan, PAUL JOSEPH
Forcing clique immersions through chromatic number
2019 Gauthier, G.; Le, T. -N.; Wollan, P.
Generation of simple quadrangulations of the sphere
2005 Gunnar, Brinkmann; Sam, Greenberg; Catherine, Greenhill; Brendan D., Mckay; R., Thomas; Wollan, PAUL JOSEPH
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A new proof of the flat wall theorem | 2018 | Kawarabayashi, K; Thomas, R; Wollan, P | |
| A Shorter Proof of the Graph Minor Algorithm - The Unique Linkage Theorem - [Extended Abstract] | 2010 | K., Kawarabayashi; Wollan, PAUL JOSEPH | |
| A Simpler Algorithm and Shorter Proof for the Graph Minor Decomposition | 2011 | K., Kawarabayashi; Wollan, PAUL JOSEPH | |
| A structure theorem for strong immersions | 2016 | Dvořák, Zdeněk; Wollan, PAUL JOSEPH | |
| A Unified Erdős–Pósa Theorem for Constrained Cycles | 2019 | Huynh, T.; Joos, FELIX CLAUDIUS; Wollan, P. | |
| A weaker version of Lovasz' path removal conjecture | 2008 | K. I., Kawarabayashi; O., Lee; B., Reed; Wollan, PAUL JOSEPH | |
| An exact characterization of tractable demand patterns for maximum disjoint path problems | 2015 | Marx, Dániel; Wollan, PAUL JOSEPH | |
| An improved linear edge bound for graph linkages | 2005 | R., Thomas; Wollan, PAUL JOSEPH | |
| Axioms for infinite matroids | 2013 | Henning, Bruhn; Reinhard, Diestel; Matthias, Kriesell; Rudi, Pendavingh; Wollan, PAUL JOSEPH | |
| Bridges in highly connected graphs | 2010 | Wollan, PAUL JOSEPH | |
| Chi-boundedness of graph classes excluding wheel vertex-minors | 2019 | Choi, H.; Kwon, O. -J.; Oum, S. -I.; Wollan, P. | |
| Disjoint cycles intersecting a set of vertices | 2012 | M., Pontecorvi; Wollan, PAUL JOSEPH | |
| Displaying blocking pairs in signed graphs | 2016 | Guenin, B.; Pivotto, I.; Wollan, PAUL JOSEPH | |
| Excluding a Ladder | 2022 | Huynh, T.; Joret, G.; Micek, P.; Seweryn, M. T.; Wollan, P. | |
| Extremal functions for rooted minors | 2008 | Wollan, PAUL JOSEPH | |
| Extremal functions for shortening sets of paths | 2006 | Wollan, PAUL JOSEPH | |
| Finding topological subgraphs is fixed-parameter tractable | 2011 | Martin, Grohe; Ken Ichi, Kawarabayashi; Daniel, Marx; Wollan, PAUL JOSEPH | |
| Finite connectivity in infinite matroids | 2012 | Henning, Bruhn; Wollan, PAUL JOSEPH | |
| Forcing clique immersions through chromatic number | 2019 | Gauthier, G.; Le, T. -N.; Wollan, P. | |
| Generation of simple quadrangulations of the sphere | 2005 | Gunnar, Brinkmann; Sam, Greenberg; Catherine, Greenhill; Brendan D., Mckay; R., Thomas; Wollan, PAUL JOSEPH |