( en | de | ru )

 

Disambiguation of "Wesolek, Alexandra"

Author of the publication

copydeleteadd this publication to your clipboard
Reconfiguration of plane trees in convex geometric graphs.

, , , and . CoRR, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

C Wesolek

Lothar Wesolek

Iris Wesolek

Alexandra Fies

Die badische Auswanderung im 19. Jahrhundert nach Nordamerika unter besonderer Berücksichtigung des Amtsbezirks Karlsruhe zwischen 1880 - 1914. Uni Karlsruhe, (2009)

Alexandra Müller

Identifizierung eisenreduzierender Mikroorganismen in anoxischem Reisfeldboden mit Hilfe stabiler Isotope. Uni Marburg, (2009)
 

Other publications of authors with the same name

Reconfiguration of Plane Trees in Convex Geometric Graphs., , , and . SoCG, volume 293 of LIPIcs, page 22:1-22:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On Minimizing the Energy of a Spherical Graph Representation., , and . GD (2), volume 14466 of Lecture Notes in Computer Science, page 218-231. Springer, (2023)Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4., , , , and . CoRR, (2023)Sparse graphs with bounded induced cycle packing number have logarithmic treewidth., , , , , , , and . SODA, page 3006-3028. SIAM, (2023)Reconfiguration of plane trees in convex geometric graphs., , , and . CoRR, (2023)Sparse graphs with bounded induced cycle packing number have logarithmic treewidth., , , , , , , and . J. Comb. Theory B, (2024)On asymptotic packing of geometric graphs., , , and . Discret. Appl. Math., (2022)Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄., , , , and . ESA, volume 274 of LIPIcs, page 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs., , , and . DISC, volume 209 of LIPIcs, page 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Limiting Crossing Numbers for Geodesic Drawings on the Sphere., , and . GD, volume 12590 of Lecture Notes in Computer Science, page 341-355. Springer, (2020)