Paul Wollan

Cited by

	All	Since 2019
Citations	1700	792
h-index	24	17
i10-index	33	25

200

100

150

200520062007200820092010201120122013201420152016201720182019202020212022202320248 15 24 14 30 32 61 90 104 76 102 96 90 120 109 114 93 127 154 193

Public access

View all

15 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Ken-ichi KawarabayashiNational Institute of Informatics, The University of TokyoVerified email at nii.ac.jp
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Tony HuynhDepartment of Computer Science, Sapienza University of RomeVerified email at di.uniroma1.it
Sergey NorinAssociate Professor, McGill UniversityVerified email at math.mcgill.ca
O-joung KwonHanyang UniversityVerified email at hanyang.ac.kr
Bruce ReedMcGill UniversityVerified email at cs.mcgill.ca
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
Brendan McKayProfessor of Computer Science, Australian National UniversityVerified email at anu.edu.au
Catherine GreenhillSchool of Mathematics and Statistics, UNSW SydneyVerified email at unsw.edu.au
Rose McCartyGeorgia Institute of TechnologyVerified email at gatech.edu
Rudi PendavinghTechnische Universiteit EindhovenVerified email at tue.nl
Sang-il OumDistinguished Research Fellow / CI. Discrete Mathematics Group, Institute for Basic ScienceVerified email at ibs.re.kr
Stephan KreutzerProfessor of Computer Science, Technical University BerlinVerified email at tu-berlin.de
Saeed AmiriAlgorithm Engineer at DeliveryheroVerified email at deliveryhero.com
Nicola GalesiSapienza University RomeVerified email at uniroma1.it
Ilario BonacinaUniversitat Politècnica de CatalunyaVerified email at cs.upc.edu
Tien-Nam LeLaboratoire Hubert CurienVerified email at ens-lyon.fr
Orlando LeeProfessor of Computer Science, University of Campinas, BrazilVerified email at ic.unicamp.br
Jim GeelenUniversity of WaterlooVerified email at uwaterloo.ca
Francis Edward SuBenediktsson-Karwa Professor of Mathematics, Harvey Mudd CollegeVerified email at math.hmc.edu

Paul Wollan

Professor of Computer Science, University of Rome La Sapienza

Verified email at di.uniroma1.it - Homepage

Graph theory graph algorithms


Title Sort by citations Sort by year Sort by 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	161	2011
An improved linear edge bound for graph linkages R Thomas, P Wollan European Journal of Combinatorics 26 (3), 309-324, 2005	150	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	126	2005
Axioms for infinite matroids H Bruhn, R Diestel, M Kriesell, R Pendavingh, P Wollan Advances in Mathematics 239, 18-46, 2013	121	2013
The structure of graphs not admitting a fixed immersion P Wollan Journal of Combinatorial Theory, Series B 110, 47-66, 2015	108	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	104	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	54	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	50	2011
A unified Erdős–Pósa theorem for constrained cycles T Huynh, F Joos, P Wollan Combinatorica 39 (1), 91-133, 2019	41	2019
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
A new proof of the flat wall theorem K Kawarabayashi, R Thomas, P Wollan Journal of Combinatorial Theory, Series B 129, 204-238, 2018	38	2018
Immersions in highly edge connected graphs D Marx, P Wollan SIAM Journal on Discrete Mathematics 28 (1), 503-520, 2014	38	2014
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	37	2011
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
Finite connectivity in infinite matroids H Bruhn, P Wollan European Journal of Combinatorics 33 (8), 1900-1912, 2012	34	2012
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
Packing cycles with modularity constraints P Wollan Combinatorica 31 (1), 95-126, 2011	32	2011
The grid theorem for vertex-minors J Geelen, O Kwon, R McCarty, P Wollan Journal of Combinatorial Theory, Series B 158, 93-116, 2023	31	2023

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors