Alexandra Wesolek

Orcid: 0000-0003-4841-5937

Affiliations:
  • Simon Fraser University, Burnaby, Canada


According to our database1, Alexandra Wesolek authored at least 15 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.
J. Comb. Theory B, 2024

A note on highly connected K2,-minor free graphs.
Discret. Math., 2024

Cops and Robber on Hyperbolic Manifolds.
CoRR, 2024

Reconfiguration of Plane Trees in Convex Geometric Graphs.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Every graph is eventually Turán-good.
J. Comb. Theory B, 2023

A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square.
CoRR, 2023

Sharp threshold for embedding balanced spanning trees in random geometric graphs.
CoRR, 2023

Maximum Independent Set when excluding an induced minor: K<sub>1</sub> + tK<sub>2</sub> and tC<sub>3</sub> ⊎ C<sub>4</sub>.
CoRR, 2023

A note on highly connected K<sub>2, 𝓁</sub>-minor free graphs.
CoRR, 2023

On Minimizing the Energy of a Spherical Graph Representation.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
On asymptotic packing of geometric graphs.
Discret. Appl. Math., 2022

2021
A note on connected greedy edge colouring.
Discret. Appl. Math., 2021

A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

2020
Limiting Crossing Numbers for Geodesic Drawings on the Sphere.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020


  Loading...