Limiting Crossing Numbers for Geodesic Drawings on the Sphere. - Marthe Bonamy; Bojan Mohar; Alexandra Wesolek (GD, 2020)

A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs. - Marthe Bonamy; Linda Cook; Carla Groenland; Alexandra Wesolek (DISC, 2021)

A note on connected greedy edge colouring. - Marthe Bonamy; Carla Groenland; Carole Muller; Jonathan Narboni; Jakub Pekárek; Alexandra Wesolek (Discret. Appl. Math., 2021)

On asymptotic packing of geometric graphs. - Daniel W. Cranston; Jiaxi Nie; Jacques Verstraëte; Alexandra Wesolek (Discret. Appl. Math., 2022)

Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. - Édouard Bonnet; Julien Duron; Colin Geniet; Stéphan Thomassé; Alexandra Wesolek (ESA, 2023)

On Minimizing the Energy of a Spherical Graph Representation. - Matt DeVos; Danielle Rogers; Alexandra Wesolek (GD (2), 2023)

A note on highly connected K2, 𝓁-minor free graphs. - Nicolas Bousquet 001; Théo Pierron; Alexandra Wesolek (CoRR, 2023)

Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4. - Édouard Bonnet; Julien Duron; Colin Geniet; Stéphan Thomassé; Alexandra Wesolek (CoRR, 2023)

A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square. - Sergio Cabello; Éva Czabarka; Ruy Fabila Monroy; Yuya Higashikawa; Raimund Seidel; László Székely; Josef Tkadlec; Alexandra Wesolek (CoRR, 2023)

Every graph is eventually Turán-good. - Natasha Morrison; JD Nir; Sergey Norin; Pawel Rzazewski; Alexandra Wesolek (J. Comb. Theory B, 2023)

Reconfiguration of Plane Trees in Convex Geometric Graphs. - Nicolas Bousquet 001; Lucas de Meyer; Théo Pierron; Alexandra Wesolek (SoCG, 2024)

Cops and Robber on Hyperbolic Manifolds. - Vesna Irsic; Bojan Mohar; Alexandra Wesolek (CoRR, 2024)

A note on highly connected K2,-minor free graphs. - Nicolas Bousquet 001; Théo Pierron; Alexandra Wesolek (Discret. Math., 2024)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. - Marthe Bonamy; Édouard Bonnet; Hugues Déprés; Louis Esperet; Colin Geniet; Claire Hilaire; Stéphan Thomassé; Alexandra Wesolek (J. Comb. Theory B, 2024)

Sharp threshold for embedding balanced spanning trees in random geometric graphs. - Alberto Espuny Díaz; Lyuben Lichev; Dieter Mitsche; Alexandra Wesolek (J. Graph Theory, 2024)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors. - Marthe Bonamy; Cyril Gavoille; Timothé Picavet; Alexandra Wesolek (PODC, 2025)

Faithful universal graphs for minor-closed classes. - Paul Bastide 002; Louis Esperet; Carla Groenland; Claire Hilaire; Clément Rambaud; Alexandra Wesolek (CoRR, 2025)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs. - Marthe Bonamy; Cyril Gavoille; Timothé Picavet; Alexandra Wesolek (CoRR, 2025)