( en | de | ru )

 

Disambiguation of "Milenkovic, Lazar"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal Euclidean Tree Covers.

, , , , , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

Dusanka Milenkovic

Nevena Milenkovic

Vladimir Milenkovic

Lazar Dukor

Lazar Lipschütz

 

Other publications of authors with the same name

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