default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandra Wesolek
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Nicolas Bousquet, Théo Pierron
, Alexandra Wesolek:
A note on highly connected K2,-minor free graphs. Discret. Math. 347(7): 114005 (2024)- [j4]Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek:
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. J. Comb. Theory B 167: 215-249 (2024) - [c6]Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek:
Reconfiguration of Plane Trees in Convex Geometric Graphs. SoCG 2024: 22:1-22:17 - [i10]Vesna Irsic, Bojan Mohar, Alexandra Wesolek:
Cops and Robber on Hyperbolic Manifolds. CoRR abs/2402.05753 (2024) - 2023
- [j3]Natasha Morrison, JD Nir, Sergey Norin, Pawel Rzazewski, Alexandra Wesolek:
Every graph is eventually Turán-good. J. Comb. Theory B 162: 231-243 (2023) - [c5]Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek:
Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. ESA 2023: 23:1-23:15 - [c4]Matt DeVos, Danielle Rogers, Alexandra Wesolek:
On Minimizing the Energy of a Spherical Graph Representation. GD (2) 2023: 218-231 - [c3]Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek:
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. SODA 2023: 3006-3028 - [i9]Nicolas Bousquet, Théo Pierron, Alexandra Wesolek:
A note on highly connected K2, 𝓁-minor free graphs. CoRR abs/2301.02133 (2023) - [i8]Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek:
Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4. CoRR abs/2302.08182 (2023) - [i7]Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche, Alexandra Wesolek:
Sharp threshold for embedding balanced spanning trees in random geometric graphs. CoRR abs/2303.14229 (2023) - [i6]Matt DeVos, Danielle Rogers, Alexandra Wesolek:
On Minimizing the Energy of a Spherical Graph Representation. CoRR abs/2309.02817 (2023) - [i5]Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek:
Reconfiguration of plane trees in convex geometric graphs. CoRR abs/2310.18518 (2023) - [i4]Sergio Cabello, Éva Czabarka, Ruy Fabila Monroy, Yuya Higashikawa, Raimund Seidel, László Székely, Josef Tkadlec, Alexandra Wesolek:
A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square. CoRR abs/2312.01935 (2023) - 2022
- [j2]Daniel W. Cranston, Jiaxi Nie, Jacques Verstraëte, Alexandra Wesolek:
On asymptotic packing of geometric graphs. Discret. Appl. Math. 322: 142-152 (2022) - [i3]Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek:
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. CoRR abs/2206.00594 (2022) - 2021
- [j1]Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek, Alexandra Wesolek:
A note on connected greedy edge colouring. Discret. Appl. Math. 304: 129-136 (2021) - [c2]Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek:
A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs. DISC 2021: 13:1-13:18 - [i2]Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek:
A tight local algorithm for the minimum dominating set problem in outerplanar graphs. CoRR abs/2108.02697 (2021) - 2020
- [c1]Marthe Bonamy, Bojan Mohar, Alexandra Wesolek:
Limiting Crossing Numbers for Geodesic Drawings on the Sphere. GD 2020: 341-355 - [i1]Marthe Bonamy, Bojan Mohar, Alexandra Wesolek:
Limiting crossing numbers for geodesic drawings on the sphere. CoRR abs/2008.10459 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
