Finding topological subgraphs is fixed-parameter tractable M Grohe, K Kawarabayashi, D Marx, P Wollan Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 157 | 2011 |
An improved linear edge bound for graph linkages R Thomas, P Wollan European Journal of Combinatorics 26 (3), 309-324, 2005 | 149 | 2005 |
Generation of simple quadrangulations of the sphere G Brinkmann, S Greenberg, C Greenhill, BD McKay, R Thomas, P Wollan Discrete mathematics 305 (1-3), 33-54, 2005 | 124 | 2005 |
Axioms for infinite matroids H Bruhn, R Diestel, M Kriesell, R Pendavingh, P Wollan Advances in Mathematics 239, 18-46, 2013 | 120 | 2013 |
The structure of graphs not admitting a fixed immersion P Wollan Journal of Combinatorial Theory, Series B 110, 47-66, 2015 | 103 | 2015 |
Proper minor-closed families are small S Norine, P Seymour, R Thomas, P Wollan Journal of Combinatorial Theory, Series B 96 (5), 754-757, 2006 | 100 | 2006 |
A shorter proof of the graph minor algorithm: the unique linkage theorem K Kawarabayashi, P Wollan Proceedings of the Forty-second ACM Symposium on Theory of Computing, 687-694, 2010 | 83 | 2010 |
Disjoint cycles intersecting a set of vertices M Pontecorvi, P Wollan Journal of Combinatorial Theory, Series B 102 (5), 1134-1141, 2012 | 53 | 2012 |
A simpler algorithm and shorter proof for the graph minor decomposition K Kawarabayashi, P Wollan Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 48 | 2011 |
K6 minors in large 6-connected graphs K Kawarabayashi, S Norine, R Thomas, P Wollan Journal of Combinatorial Theory, Series B 129, 158-203, 2018 | 39 | 2018 |
Non-zero disjoint cycles in highly connected group labelled graphs K Kawarabayashi, P Wollan Journal of Combinatorial Theory, Series B 96 (2), 296-301, 2006 | 38 | 2006 |
The graph minor algorithm with parity conditions K Kawarabayashi, B Reed, P Wollan 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 27-36, 2011 | 36 | 2011 |
A unified Erdős–Pósa theorem for constrained cycles T Huynh, F Joos, P Wollan Combinatorica 39 (1), 91-133, 2019 | 35 | 2019 |
A new proof of the flat wall theorem K Kawarabayashi, R Thomas, P Wollan Journal of Combinatorial Theory, Series B 129, 204-238, 2018 | 35 | 2018 |
Immersions in highly edge connected graphs D Marx, P Wollan SIAM Journal on Discrete Mathematics 28 (1), 503-520, 2014 | 35 | 2014 |
A weaker version of Lovász'path removal conjecture K Kawarabayashi, O Lee, B Reed, P Wollan Journal of Combinatorial Theory, Series B 98 (5), 972-979, 2008 | 35 | 2008 |
On the excluded minor structure theorem for graphs of large tree-width R Diestel, K Kawarabayashi, T Müller, P Wollan Journal of Combinatorial Theory, Series B 102 (6), 1189-1210, 2012 | 34* | 2012 |
Finite connectivity in infinite matroids H Bruhn, P Wollan European Journal of Combinatorics 33 (8), 1900-1912, 2012 | 32 | 2012 |
Packing cycles with modularity constraints P Wollan Combinatorica 31 (1), 95-126, 2011 | 29 | 2011 |
Voting in agreeable societies DE Berg, S Norine, FE Su, R Thomas, P Wollan The American Mathematical Monthly 117 (1), 27-39, 2010 | 29 | 2010 |