A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence. - Lazar Milenkovic; Shay Solomon (SPAA, 2020)

Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. - Hung Le 001; Lazar Milenkovic; Shay Solomon (SoCG, 2022)

Dynamic Matching Algorithms Under Vertex Updates. - Hung Le 001; Lazar Milenkovic; Shay Solomon; Virginia Vassilevska Williams (ITCS, 2022)

Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. - Omri Kahalon; Hung Le 001; Lazar Milenkovic; Shay Solomon (PODC, 2022)

Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function. - Hung Le 001; Lazar Milenkovic; Shay Solomon (SoCG, 2023)

Covering Planar Metrics (and Beyond): O(1) Trees Suffice. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (FOCS, 2023)

Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (CoRR, 2023)

Optimal Euclidean Tree Covers. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SoCG, 2024)

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SODA, 2024)

Light Spanners with Small Hop-Diameter. - Sujoy Bhore; Lazar Milenkovic (ICALP, 2025)

Covering the Euclidean Plane by a Pair of Trees. - Hung Le 001; Lazar Milenkovic; Shay Solomon; Tianyi Zhang 008 (CoRR, 2025)