( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimal Euclidean Tree Covers.

, , , , , и . CoRR, (2024)

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.

Dusanka Milenkovic

Nevena Milenkovic

Vladimir Milenkovic

Lazar Dukor

Lazar Lipschütz

 

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

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More., , , , , и . CoRR, (2023)Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function., , и . SoCG, том 258 из LIPIcs, стр. 47:1-47:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Dynamic Matching Algorithms Under Vertex Updates., , , и . ITCS, том 215 из LIPIcs, стр. 96:1-96:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence., и . SPAA, стр. 395-406. ACM, (2020)Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound., , и . CoRR, (2021)Optimal Euclidean Tree Covers., , , , , и . CoRR, (2024)Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners., , , и . CoRR, (2021)Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound., , и . SoCG, том 224 из LIPIcs, стр. 54:1-54:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More., , , , , и . SODA, стр. 5300-5331. SIAM, (2024)Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions., , , , , и . CoRR, (2023)