( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Limiting Crossing Numbers for Geodesic Drawings on the Sphere.

, , и . GD, том 12590 из Lecture Notes in Computer Science, стр. 341-355. Springer, (2020)

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.

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)
 

Другие публикации лиц с тем же именем

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