Lazar Milenkovic

According to our database, Lazar Milenkovic authored at least 14 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Covering the Euclidean Plane by a Pair of Trees.

Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

Tree-Like Shortcuttings of Trees.

Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

Proceedings of the 42nd International Symposium on Computational Geometry, 2026

Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity.

Sujoy Bhore, Sándor Kisfaludi-Bak, Lazar Milenkovic, Csaba D. Tóth, Karol Wegrzycki, Sampson Wong

Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025

Metric Sketching and Dynamic Algorithms for Geometric and Topological Graphs (Dagstuhl Seminar 25212).

Sujoy Bhore, Jie Gao, Hung Le, Csaba D. Tóth, Lazar Milenkovic

Dagstuhl Reports, May, 2025

Light Spanners with Small Hop-Diameter.

Sujoy Bhore, Lazar Milenkovic

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Optimal Euclidean Tree Covers.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

CoRR, 2023

Covering Planar Metrics (and Beyond): O(1) Trees Suffice.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function.

Hung Le, Lazar Milenkovic, Shay Solomon

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners.

Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Dynamic Matching Algorithms Under Vertex Updates.

Hung Le, Lazar Milenkovic, Shay Solomon, Virginia Vassilevska Williams

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound.

Hung Le, Lazar Milenkovic, Shay Solomon

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2020

A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence.

Lazar Milenkovic, Shay Solomon

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020