Paul Wollan

Citata da

	Tutte	Dal 2018
Citazioni	1435	651
Indice H	22	15
i10-index	31	24

160

120

200420052006200720082009201020112012201320142015201620172018201920202021202220234 7 17 23 13 28 32 61 91 105 77 104 93 87 112 113 124 112 156 34

Accesso pubblico

Visualizza tutto

15 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Ken-ichi KawarabayashiNational Institute of InformaticsEmail verificata su nii.ac.jp
Sergey NorinAssociate Professor, McGill UniversityEmail verificata su math.mcgill.ca
Dániel MarxCISPA Helmholtz Center for Information SecurityEmail verificata su cispa.saarland
Tony HuynhDepartment of Computer Science, Sapienza University of RomeEmail verificata su di.uniroma1.it
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityEmail verificata su informatik.rwth-aachen.de
Bruce ReedMcGill UniversityEmail verificata su cs.mcgill.ca
O-joung KwonHanyang UniversityEmail verificata su hanyang.ac.kr
Brendan McKayProfessor of Computer Science, Australian National UniversityEmail verificata su anu.edu.au
Catherine GreenhillSchool of Mathematics and Statistics, UNSW SydneyEmail verificata su unsw.edu.au
Gunnar BrinkmannEmail verificata su ugent.be
Rudi PendavinghTechnische Universiteit EindhovenEmail verificata su tue.nl
Rose McCartyPrinceton UniversityEmail verificata su princeton.edu
Stephan KreutzerProfessor of Computer Science, Technical University BerlinEmail verificata su tu-berlin.de
Saeed Akhoondian AmiriUniversity of CologneEmail verificata su informatik.uni-koeln.de
Nicola GalesiSapienza University RomeEmail verificata su uniroma1.it
Ilario BonacinaUniversitat Politècnica de CatalunyaEmail verificata su cs.upc.edu
Sang-il OumCI, Discrete Mathematics Group, Institute for Basic Science and Professor, KAISTEmail verificata su ibs.re.kr
Tien-Nam LeLaboratoire Hubert CurienEmail verificata su ens-lyon.fr
Orlando LeeProfessor of Computer Science, University of Campinas, BrazilEmail verificata su ic.unicamp.br
Francis Edward SuBenediktsson-Karwa Professor of Mathematics, Harvey Mudd CollegeEmail verificata su math.hmc.edu

Segui

Paul Wollan

Professor of Computer Science, University of Rome La Sapienza

Email verificata su di.uniroma1.it - Home page

Graph theory graph algorithms


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	146	2011
An improved linear edge bound for graph linkages R Thomas, P Wollan European Journal of Combinatorics 26 (3), 309-324, 2005	130	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	109	2005
Axioms for infinite matroids H Bruhn, R Diestel, M Kriesell, R Pendavingh, P Wollan Advances in Mathematics 239, 18-46, 2013	108	2013
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	91	2006
The structure of graphs not admitting a fixed immersion P Wollan Journal of Combinatorial Theory, Series B 110, 47-66, 2015	87	2015
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	75	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	43	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	42*	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
A unified Erdős–Pósa theorem for constrained cycles T Huynh, F Joos, P Wollan Combinatorica 39 (1), 91-133, 2019	32	2019
Finite connectivity in infinite matroids H Bruhn, P Wollan European Journal of Combinatorics 33 (8), 1900-1912, 2012	32	2012
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	32	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	30	2008
Immersions in highly edge connected graphs D Marx, P Wollan SIAM Journal on Discrete Mathematics 28 (1), 503-520, 2014	28	2014
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	28*	2012
Packing cycles with modularity constraints P Wollan Combinatorica 31 (1), 95, 2011	28	2011
Voting in agreeable societies DE Berg, S Norine, FE Su, R Thomas, P Wollan The American Mathematical Monthly 117 (1), 27-39, 2010	28	2010
A new proof of the flat wall theorem K Kawarabayashi, R Thomas, P Wollan Journal of Combinatorial Theory, Series B 129, 204-238, 2018	26*	2018

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori