Research
My PhD thesis is about "Graphs on Surfaces". My research interests are within topological graph theory, structural graph theory and algorithmic complexity. My CV can be found here.

Preprints:

1. V. Iršič, B. Mohar, A. Wesolek - Cops and Robber on Hyperbolic Manifolds (Arxiv)

2. A. Espuny Díaz, L. Lichev, D. Mitsche, A. Wesolek - Sharp threshold for embedding balanced spanning trees in random geometric graphs (Arxiv)

3. N. Bousquet, T. Pierron, A. Wesolek - A note on highly connected K_{2,ℓ}-minor free graphs (Arxiv)

4. A. Wesolek - Bootstrap percolation in Ore-type graphs (Arxiv)

5. S. Cabello, É. Czabarka, R. Fabila-Monroy, Y. Higashikawa, R. Seidel, L. Székely, J. Tkadlec, A. Wesolek - A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square (Arxiv)


Published

1. N. Bousquet, L. De Meyer, T. Pierron, A. Wesolek - Reconfiguration of plane trees in convex geometric graphs (SoCG 2024)

2. M. DeVos, D. Rogers, A. Wesolek - On Minimizing the Energy of a Spherical Graph Representation (GD 2023)

3. É. Bonnet, J. Duron, C. Geniet, S. Thomassé, A. Wesolek - Maximum Independent Set when excluding an induced minor: K_1 + tK_2 and tC_3 \uplus C_4 (ESA 2023)

4. N. Morrison, JD Nir, S. Norin, P. Rzążewski, A. Wesolek - Every graph is eventually Turán-good (Journal of Combinatorial Theory Series B)

5. M. Bonamy, É. Bonnet, H. Déprés, L. Esperet, C. Geniet, C. Hilaire, S. Thomassé, A. Wesolek - Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (SODA 2023)

6. V. Iršič, B. Mohar, A. Wesolek - Cops and Robber game in higher-dimensional manifolds with spherical and Euclidean metric (CR Math. Rep. Acad. Sci. Canada 2022)

7. D. Cranston, J. Nie, J. Verstraëte, A. Wesolek - On Asymptotic Packing of Geometric Graphs (Discrete Applied Mathematics 2022)

8. M. Bonamy, C. Groenland, C. Muller, J. Narboni, J. Pekárek, A. Wesolek - A note on connected greedy edge colouring (Discrete Applied Mathematics 2021)

9. M. Bonamy, L. Cook, C. Groenland, A. Wesolek - A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs (DISC 2021)

10. M. Bonamy, B. Mohar, A. Wesolek - Limiting crossing numbers for geodesic drawings on the sphere (GD 2020) ( Presentation GD2020 Slides)