Paul Wollan

Navedeno

	Vse	Od leta 2019
Navedbe	1665	760
indeks h	23	16
indeks i10	33	25

160

120

200520062007200820092010201120122013201420152016201720182019202020212022202320247 16 24 14 30 32 61 90 104 76 102 95 85 120 110 114 92 127 157 160

Javni dostop

Prikaži vse

15 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Ken-ichi KawarabayashiNational Institute of Informatics, The University of TokyoPreverjeni e-poštni naslov na nii.ac.jp
Dániel MarxCISPA Helmholtz Center for Information SecurityPreverjeni e-poštni naslov na cispa.saarland
Tony HuynhDepartment of Computer Science, Sapienza University of RomePreverjeni e-poštni naslov na di.uniroma1.it
Sergey NorinAssociate Professor, McGill UniversityPreverjeni e-poštni naslov na math.mcgill.ca
O-joung KwonHanyang UniversityPreverjeni e-poštni naslov na hanyang.ac.kr
Bruce ReedMcGill UniversityPreverjeni e-poštni naslov na cs.mcgill.ca
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityPreverjeni e-poštni naslov na informatik.rwth-aachen.de
Brendan McKayProfessor of Computer Science, Australian National UniversityPreverjeni e-poštni naslov na anu.edu.au
Catherine GreenhillSchool of Mathematics and Statistics, UNSW SydneyPreverjeni e-poštni naslov na unsw.edu.au
Gunnar BrinkmannPreverjeni e-poštni naslov na ugent.be
Rudi PendavinghTechnische Universiteit EindhovenPreverjeni e-poštni naslov na tue.nl
Rose McCartyGeorgia Institute of TechnologyPreverjeni e-poštni naslov na gatech.edu
Sang-il OumCI, Discrete Mathematics Group, Institute for Basic Science and Professor, KAISTPreverjeni e-poštni naslov na ibs.re.kr
Stephan KreutzerProfessor of Computer Science, Technical University BerlinPreverjeni e-poštni naslov na tu-berlin.de
Saeed AmiriAlgorithm Engineer at DeliveryheroPreverjeni e-poštni naslov na deliveryhero.com
Nicola GalesiSapienza University RomePreverjeni e-poštni naslov na uniroma1.it
Ilario BonacinaUniversitat Politècnica de CatalunyaPreverjeni e-poštni naslov na cs.upc.edu
Tien-Nam LeLaboratoire Hubert CurienPreverjeni e-poštni naslov na ens-lyon.fr
Orlando LeeProfessor of Computer Science, University of Campinas, BrazilPreverjeni e-poštni naslov na ic.unicamp.br
Jim GeelenUniversity of WaterlooPreverjeni e-poštni naslov na uwaterloo.ca

Spremljaj

Paul Wollan

Professor of Computer Science, University of Rome La Sapienza

Preverjeni e-poštni naslov na di.uniroma1.it - Domača stran

Graph theory graph algorithms


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	158	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	125	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	105	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	102	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	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
A unified Erdős–Pósa theorem for constrained cycles T Huynh, F Joos, P Wollan Combinatorica 39 (1), 91-133, 2019	38	2019
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 new proof of the flat wall theorem K Kawarabayashi, R Thomas, P Wollan Journal of Combinatorial Theory, Series B 129, 204-238, 2018	37	2018
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
Immersions in highly edge connected graphs D Marx, P Wollan SIAM Journal on Discrete Mathematics 28 (1), 503-520, 2014	36	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	33	2012
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
Packing cycles with modularity constraints P Wollan Combinatorica 31 (1), 95-126, 2011	30	2011

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji