Lazar Milenkovic

22 papers A* 8A 1B 1Journal 12

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Covering the Euclidean Plane by a Pair of Trees. SODA Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang
2026	J	`jnl`	Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity. CoRR Sujoy Bhore, Sándor Kisfaludi-Bak, Lazar Milenkovic, Csaba D. Tóth, Karol Wegrzycki, Sampson Wong
2026	J	`jnl`	Optimal Euclidean Tree Covers. Discret. Comput. Geom. Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2025	J	`jnl`	Covering the Euclidean Plane by a Pair of Trees. CoRR Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang
2025	A*	`conf`	Light Spanners with Small Hop-Diameter. ICALP Sujoy Bhore, Lazar Milenkovic
2025	J	`jnl`	Light Spanners with Small Hop-Diameter. CoRR Sujoy Bhore, Lazar Milenkovic
2025	J	`jnl`	Metric Sketching and Dynamic Algorithms for Geometric and Topological Graphs (Dagstuhl Seminar 25212). Dagstuhl Reports Sujoy Bhore, Jie Gao, Hung Le, Csaba D. Tóth, Lazar Milenkovic
2025	J	`jnl`	Tree-Like Shortcuttings of Trees. CoRR Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2024	A*	`conf`	Optimal Euclidean Tree Covers. SoCG Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2024	J	`jnl`	Optimal Euclidean Tree Covers. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2024	A*	`conf`	Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. SODA Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	A*	`conf`	Covering Planar Metrics (and Beyond): O(1) Trees Suffice. FOCS Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	J	`jnl`	Covering Planar Metrics (and Beyond): O(1) Trees Suffice. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	J	`jnl`	Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	J	`jnl`	Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	A*	`conf`	Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function. SoCG Hung Le, Lazar Milenkovic, Shay Solomon
2022	A*	`conf`	Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. PODC Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon
2022	A	`conf`	Dynamic Matching Algorithms Under Vertex Updates. ITCS Hung Le, Lazar Milenkovic, Shay Solomon, Virginia Vassilevska Williams
2022	A*	`conf`	Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. SoCG Hung Le, Lazar Milenkovic, Shay Solomon
2021	J	`jnl`	Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. CoRR Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon
2021	J	`jnl`	Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. CoRR Hung Le, Lazar Milenkovic, Shay Solomon
2020	B	`conf`	A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence. SPAA Lazar Milenkovic, Shay Solomon