Image
Hung Le
Assistant Professor
Contact
hungle [at] cs [dot] umass [dot] edu
Location
Computer Science Building
140 Governors Dr
Amherst, MA 01003
United States
CS 332
Research Areas
About
Hung Le has been focusing on designing algorithms for graph problems. He is particularly interested in understanding the power and limits of structures of graphs in algorithm design. His major contributions include efficient approximation algorithms for the Traveling Salesperson Problem, constructions of optimally sparse and light networks, and providing theoretical guarantees for local search heuristics.
Le was awarded the PIMS postdoctoral fellowship. He co-chaired the SIAM Symposium on Simplicity in Algorithms (SOSA21). He has served as a reviewer for major conferences and journals in theoretical computer science.