About me
I am an Associate Assistant Professor of Computer Science at UMass Amherst. I am interested in Theoretical Computer Science in general and Graph Algorithms in particular. I am a member of Umass Theory Group
Bio (in 3rd person for talks): Hung Le has been a faculty member at Umass Amherst since 2020. He was a PIMS postdoc at the University of Victoria with Valerie King and a PhD student at Oregon State University, advised by Cora Borradaile. He got his undergraduate degree from Hanoi University of Science and Technology, Vietnam.
My research has been generously supported by two NSF small grants (CCF-2517033 and CCF-2121952), an NSF CAREER Award (CCF-2237288) and a Google Research Scholar Award.
My technical blog Rambling on Graphs is up.
Check out our FOCS 2022 workshop “Advances on Metric Embeddings” I co-organize with Arnold Filtser.
News
I will be updating both good news, bad news and all kinds of news.
[Nov 2025] One paper was rejected from ITCS 26.
[Oct 2025] I will be serving on the PC of SOCG 2026 and COCOON 2026.
[Oct 2025] Our paper “Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension” was uploaded to Arxiv.
[October 2025] One paper was rejected from SOSA 26.
[October 2025] One paper was rejected from SODA 26 and two papers were accepted at SODA 26.
[October 2025] Our paper “Optimal Padded Decomposition For Bounded Treewidth Graphs” was accepted to TheoretiCS.
[September 2025] Congrats Cuong Than on winning the Google PhD Fellowship!
[July 2025] My NSF grant “NSF-BSF: AF: Small: New Frontiers in Distance Sketching” got funded. Thannks, NSF!
[Jyly 2025] One paper was rejected from FOCS 25 and one paper was accepted at FOCS 25.