Dr. Lazar Milenković

Postdoctoral researcher

Email: [email protected]

About me

I am a postdoctoral researcher at INSAIT, hosted by Bernhard Haeupler. Previously, I earned my PhD in Computer Science at Tel Aviv University, where I was fortunate to be advised by Shay Solomon. Before that, I received my MSc in Computer Science from EPFL.

My research interests broadly lie in the design and analysis of graph algorithms.

Awards

The Feder Family Award for Best Student Work in Communications, 3rd place 2026

SPAA 2020 Best Paper Award Finalist 2020

EPFL Teaching Assistant Award December 2018

Winner of seven Dositeja awards from the Government of Serbia 2007-2013

Publications

Tree-Like Shortcuttings of Trees

SoCG’26, arXiv

Hung Le, Lazar Milenković, Shay Solomon, Cuong Than

Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity

SoCG’26, arXiv

Sujoy Bhore, Sándor Kisfaludi-Bak, Lazar Milenković, Csaba D. Tóth, Karol Węgrzycki, Sampson Wong

Covering the Euclidean Plane by a Pair of Trees

SODA’26, arXiv

Hung Le, Lazar Milenković, Shay Solomon, Tianyi Zhang

Light Spanners with Small Hop-Diameter

ICALP’25, arXiv

Sujoy Bhore, Lazar Milenković

Optimal Euclidean Tree Covers

SoCG’24, DCG, arXiv

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

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

SODA’24, arXiv

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

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

FOCS’23, arXiv

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

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

SoCG’23

Hung Le, Lazar Milenković, Shay Solomon

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

PODC’22, arXiv

Omri Kahalon, Hung Le, Lazar Milenković, Shay Solomon

Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound

SoCG’22, arXiv

Hung Le, Lazar Milenković, Shay Solomon

Dynamic Matching Algorithms Under Vertex Updates

ITCS’22

Hung Le, Lazar Milenković, Shay Solomon, Virginia Vassilevska Williams

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

SPAA’20, best paper award finalist

Lazar Milenković, Shay Solomon