Hung Le

Hung Le is an Associate Professor in the College of Information & Computer Sciences at the University of Massachusetts Amherst. He leads research in theoretical computer science with a focus on graph algorithms, spanners, and metric embeddings. He is a member of the UMass Theory Group and serves as Chair of PhD Admissions.

• PhD in Computer Science, Oregon State University, 2018
• BS in Computer Science, Hanoi University of Science and Technology

Hung Le's research centers on algorithm design for graph problems, especially understanding structural properties of graphs in theoretical settings. His work spans approximation algorithms, spanners, fault tolerance, metric embeddings, and computational geometry. He has made significant contributions to light spanners, tree covers, and distance oracles, particularly in planar and doubling metrics.

His recent publications show a strong trend in designing efficient, sparse, and light structures for geometric and minor-free graphs, with a focus on optimal tradeoffs and lower bounds. Key themes include locality-sensitive orderings, shortcut partitions, and tree covers with constant stretch and size.

• NSF CAREER Award
• Google Research Scholar Program (2024)
• PIMS Postdoctoral Fellowship

Hung Le has advised numerous students and postdocs, including An La and Cuong Than, whose work has led to STOC and FOCS publications. His research is funded by multiple NSF grants (CCF-2121952, CCF-2237288, CCF-2517033) and a Google Research Scholar Award. He has served on program committees (e.g., WADS 2025) and co-chaired SOSA 2021.

He is actively involved in the theoretical computer science community, maintains a technical blog 'Rambling on Graphs', and contributes to open problems in graph theory and algorithm design.