Alexandra Wesolek

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Subgraph-universal planar graphs for trees 2024 Helena Bergold
Vesna Iršič
Robert Lauff
Joachim Orthaber
Manfred Scheucher
Alexandra Wesolek
+ PDF Chat On the local resilience of random geometric graphs with respect to connectivity and long cycles 2024 Alberto Espuny Díaz
Lyuben Lichev
Alexandra Wesolek
+ PDF Chat A note on the 2-colored rectilinear crossing number of random point sets in the unit square 2024 Sergio Cabello
Éva Czabarka
Ruy Fabila‐Monroy
Yuya Higashikawa
Raimund Seidel
László Á. Székely
Josef Tkadlec
Alexandra Wesolek
+ PDF Chat Sharp threshold for embedding balanced spanning trees in random geometric graphs 2024 Alberto Espuny Díaz
Lyuben Lichev
Dieter Mitsche
Alexandra Wesolek
+ A note on highly connected K2,-minor free graphs 2024 Nicolás Bousquet
Théo Pierron
Alexandra Wesolek
+ PDF Chat Sparse graphs with bounded induced cycle packing number have logarithmic treewidth 2024 Marthe Bonamy
Édouard Bonnet
Hugues Déprés
Louis Esperet
Colin Geniet
Claire Hilaire
Stéphan Thomassé
Alexandra Wesolek
+ PDF Chat Cops and Robber on Hyperbolic Manifolds 2024 Vesna Iršič
Bojan Mohar
Alexandra Wesolek
+ Every graph is eventually Turán-good 2023 Natasha Morrison
JD Nir
Sergey Norin
Paweł Rzążewski
Alexandra Wesolek
+ PDF Chat Sparse graphs with bounded induced cycle packing number have logarithmic treewidth 2023 Marthe Bonamy
Edouard Bonnet
Hugues Déprés
Louis Esperet
Colin Geniet
Claire Hilaire
Stéphan Thomassé
Alexandra Wesolek
+ A note on highly connected $K_{2,\ell}$-minor free graphs 2023 Nicolás Bousquet
Théo Pierron
Alexandra Wesolek
+ Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$ 2023 Édouard Bonnet
J. Duron
Colin Geniet
Stéphan Thomassé
Alexandra Wesolek
+ Sharp threshold for embedding balanced spanning trees in random geometric graphs 2023 Alberto Espuny Díaz
Lyuben Lichev
Dieter Mitsche
Alexandra Wesolek
+ Sharp threshold for embedding balanced spanning trees in random geometric graphs 2023 Alberto Díaz
Lyuben Lichev
Dieter Mitsche
Alexandra Wesolek
+ Cops and Robber on Hyperbolic Manifolds 2023 Vesna Iršič
Bojan Mohar
Alexandra Wesolek
+ On Minimizing the Energy of a Spherical Graph Representation 2023 Matt DeVos
Danielle Rogers
Alexandra Wesolek
+ Reconfiguration of plane trees in convex geometric graphs 2023 Nicolás Bousquet
Lucas de Meyer
Théo Pierron
Alexandra Wesolek
+ A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square 2023 Sergio Cabello
Éva Czabarka
Ruy Fabila‐Monroy
Yuya Higashikawa
Raimund Seidel
Łászló A. Székely
Josef Tkadlec
Alexandra Wesolek
+ PDF Chat On asymptotic packing of geometric graphs 2022 Daniel W. Cranston
Jiaxi Nie
Jacques Verstraëte
Alexandra Wesolek
+ Sparse graphs with bounded induced cycle packing number have logarithmic treewidth 2022 Marthe Bonamy
Édouard Bonnet
Hugues Déprés
Louis Esperet
Colin Geniet
Claire Hilaire
Stéphan Thomassé
Alexandra Wesolek
+ Every graph is eventually Turán-good 2022 Natasha Morrison
JD Nir
Sergey Norin
Paweł Rzążewski
Alexandra Wesolek
+ Cops and Robber game in higher-dimensional manifolds with spherical and Euclidean metric 2022 Vesna Iršič
Bojan Mohar
Alexandra Wesolek
+ A tight local algorithm for the minimum dominating set problem in outerplanar graphs 2021 Marthe Bonamy
L. F. Cook
Carla Groenland
Alexandra Wesolek
+ PDF Chat A note on connected greedy edge colouring 2021 Marthe Bonamy
Carla Groenland
Carole Muller
Jonathan Narboni
Jakub Pekárek
Alexandra Wesolek
+ On Asymptotic Packing of Geometric Graphs 2021 Daniel W. Cranston
Jiaxi Nie
Jacques Verstraëte
Alexandra Wesolek
+ A tight local algorithm for the minimum dominating set problem in outerplanar graphs 2021 Marthe Bonamy
Linda S. Cook
Carla Groenland
Alexandra Wesolek
+ A note on connected greedy edge colouring 2020 Marthe Bonamy
Carla Groenland
Carole Muller
Jonathan Narboni
Jakub Pekárek
Alexandra Wesolek
+ Limiting crossing numbers for geodesic drawings on the sphere 2020 Marthe Bonamy
Bojan Mohar
Alexandra Wesolek
+ PDF Chat Limiting Crossing Numbers for Geodesic Drawings on the Sphere 2020 Marthe Bonamy
Bojan Mohar
Alexandra Wesolek
+ A note on connected greedy edge colouring 2020 Marthe Bonamy
Carla Groenland
Carole Muller
Jonathan Narboni
Jakub Pekárek
Alexandra Wesolek
+ Limiting crossing numbers for geodesic drawings on the sphere 2020 Marthe Bonamy
Bojan Mohar
Alexandra Wesolek
+ Bootstrap percolation in Ore-type graphs 2019 Alexandra Wesolek
+ Bootstrap percolation in Ore-type graphs 2019 Alexandra Wesolek
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Limits of dense graph sequences 2006 László Lovász
Balázs Szegedy
2
+ Induced subdivisions and bounded expansion 2017 Zdeněk Dvořák
2
+ PDF Chat Twin-width I: Tractable FO Model Checking 2021 Édouard Bonnet
Eun Jung Kim
Stéphan Thomassé
Rémi Watrigant
2
+ Random Plane Networks 1961 E. N. Gilbert
2
+ Connected greedy coloring of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e596" altimg="si37.svg"><mml:mi>H</mml:mi></mml:math>-free graphs 2020 Esdras Mota
Leonardo Sampaio
Ana Silva
2
+ PDF Chat The longest edge of the random minimal spanning tree 1997 Mathew D. Penrose
2
+ Spanning trees in random graphs 2019 Richard Montgomery
2
+ PDF Chat Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth 2022 Maria Chudnovsky
Tara Abrishami
Sepehr Hajebi
Sophie Spirkl
2
+ Mangoes and Blueberries 1999 Robert E. Bruce
2
+ PDF Chat From the Buffon Needle Problem to the Kreiss Matrix Theorem 1994 Elías Wegert
Lloyd N. Trefethen
2
+ PDF Chat Sparse graphs with bounded induced cycle packing number have logarithmic treewidth 2023 Marthe Bonamy
Edouard Bonnet
Hugues Déprés
Louis Esperet
Colin Geniet
Claire Hilaire
Stéphan Thomassé
Alexandra Wesolek
2
+ Induced packing of odd cycles in planar graphs 2011 Petr A. Golovach
Marcin Kamiński
Daniël Paulusma
Dimitrios M. Thilikos
2
+ Connected greedy colouring in claw-free graphs 2018 Ngoc-Khang Le
Nicolas Trotignon
2
+ A note on stable sets and colorings of graphs 1974 Svatopluk Poljak
2
+ Lectures on random geometric graphs 2016 Mathew D. Penrose
2
+ PDF Chat Communication-free massively distributed graph generation 2019 Daniel Funke
Sebastian Lamm
Ulrich Meyer
Manuel Penschuck
Peter Sanders
Christian Schulz
Darren Strash
Moritz von Looz
2
+ On a conjecture by Anthony Hill 2020 Bojan Mohar
2
+ Worm epidemics in wireless ad hoc networks 2007 Maziar Nekovee
2
+ Grid induced minor theorem for graphs of small degree 2023 Tuukka Korhonen
2
+ Random Geometric Graphs 2003 Mathew D. Penrose
2
+ Counting Graph Homomorphisms 2007 Christian Borgs
Jennifer Chayes
László Lovász
Vera T. Sós
K. Vesztergombi
2
+ Clustering and domination in perfect graphs 1984 Derek G. Corneil
Yehoshua Perl
2
+ Induced paths in graphs without anticomplete cycles 2023 Tung Nguyen
Alex Scott
Paul Seymour
2
+ Induced odd cycle packing number, independent sets, and chromatic number 2020 Zdeněk Dvořák
Jakub Pekárek
2
+ Induced Subdivisions In K s,s -Free Graphs of Large Average Degree 2004 Daniela K�hn
Deryk Osthus
2
+ PDF Chat Sharp Threshold for Hamiltonicity of Random Geometric Graphs 2007 Josep Dı́az
Dieter Mitsche
Xavier Pérez‐Giménez
2
+ Generalized quasirandom graphs 2007 László Lovász
Vera T. Sós
2
+ Complexity of Grundy coloring and its variants 2018 Édouard Bonnet
Florent Foucaud
Eun‐Jung Kim
Florian Sikora
2
+ Bootstrap percolation on a Bethe lattice 1979 J. Chalupa
P. L. Leath
Gary Reich
1
+ PDF Chat Sharp metastability threshold for two-dimensional bootstrap percolation 2003 Alexander E. Holroyd
1
+ Metastability effects in bootstrap percolation 1988 Michael Aizenman
Joel L. Lebowitz
1
+ PDF Chat Disjoint Hamilton cycles in the random geometric graph 2011 Tobias Müller
Xavier Pérez‐Giménez
Nicholas Wormald
1
+ On complete subgraphs of different orders 1976 Béla Bollobás
1
+ Many T copies in H-free graphs 2016 Noga Alon
Clara Shikhelman
1
+ Cops and robbers in a random graph 2012 Béla Bollobás
Gábor Kun
Imre Leader
1
+ On the number of pentagons in triangle-free graphs 2013 Hamed Hatami
Jan Hladký
Daniel Kráľ
Serguei Norine
Alexander Razborov
1
+ Partitions of complete geometric graphs into plane trees 2005 Prosenjit Bose
Ferrán Hurtado
Eduardo Rivera‐Campo
David R. Wood
1
+ PDF Chat Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing 2008 Christian Borgs
Jennifer Chayes
L. Lovász
Vera T. Sós
K. Vesztergombi
1
+ Decomposition of Finite Graphs Into Forests 1964 C. St. J. A. Nash‐Williams
1
+ PDF Chat Bootstrap Percolation in High Dimensions 2010 József Balogh
Béla Bollobás
Robert Morris
1
+ What I Tell You Three Times Is True: Bootstrap Percolation in Small Worlds 2012 Hamed Amini
Nikolaos Fountoulakis
1
+ Bootstrap percolation on the random regular graph 2006 József Balogh
Boris Pittel
1
+ On the maximal number of certain subgraphs inK r -free graphs 1991 Ervin Győri
János Pach
Miklós Simonovits
1
+ Deterministic bootstrap percolation in high dimensional grids 2013 Hao Huang
Choongbum Lee
1
+ A note on Hamiltonian circuits 1972 Vašek Chvátal
P. Erdős
1
+ PDF Chat On the structure of linear graphs 1946 Paul Erdős
A. H. Stone
1
+ New bounds for contagious sets 2012 Daniel Reichman
1
+ On the number of complete subgraphs contained in certain graphs 1981 Ron Evans
John R. Pulham
J. Sheehan
1
+ PDF Chat Probability thatn random points are in convex position 1995 Pável Valtr
1
+ The extremal function for unbalanced bipartite minors 2003 Joseph Samuel Myers
1