Lazar Milenkovic

According to our database1, Lazar Milenkovic authored at least 9 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimal Euclidean Tree Covers.
CoRR, 2024

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

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

Covering Planar Metrics (and Beyond): O(1) Trees Suffice.
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.
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.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Dynamic Matching Algorithms Under Vertex Updates.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2020
A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020


  Loading...