Paul Wollan
Paul Wollan
Professor of Computer Science, University of Rome La Sapienza
Verified email at di.uniroma1.it - Homepage
Title
Cited by
Cited by
Year
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
1162011
An improved linear edge bound for graph linkages
R Thomas, P Wollan
European Journal of Combinatorics 26 (3), 309-324, 2005
1122005
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
972005
Axioms for infinite matroids
H Bruhn, R Diestel, M Kriesell, R Pendavingh, P Wollan
Advances in Mathematics 239, 18-46, 2013
882013
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
762006
The structure of graphs not admitting a fixed immersion
P Wollan
Journal of Combinatorial Theory, Series B 110, 47-66, 2015
612015
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
602010
Disjoint cycles intersecting a set of vertices
M Pontecorvi, P Wollan
Journal of Combinatorial Theory, Series B 102 (5), 1134-1141, 2012
502012
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
41*2018
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
382011
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
352006
Finite connectivity in infinite matroids
H Bruhn, P Wollan
European Journal of Combinatorics 33 (8), 1900-1912, 2012
302012
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
282011
Voting in agreeable societies
DE Berg, S Norine, FE Su, R Thomas, P Wollan
The American Mathematical Monthly 117 (1), 27-39, 2010
282010
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
272008
The Erdős–Pósa property for clique minors in highly connected graphs
R Diestel, K Kawarabayashi, P Wollan
Journal of Combinatorial Theory, Series B 102 (2), 454-469, 2012
222012
Packing cycles with modularity constraints
P Wollan
Combinatorica 31 (1), 95, 2011
222011
Immersions in highly edge connected graphs
D Marx, P Wollan
SIAM Journal on Discrete Mathematics 28 (1), 503-520, 2014
202014
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
20*2012
A unified Erdős–Pósa theorem for constrained cycles
T Huynh, F Joos, P Wollan
Combinatorica 39 (1), 91-133, 2019
192019
The system can't perform the operation now. Try again later.
Articles 1–20