Hung Le

Hung Le

Assistant Professor
Contact
Location
Room 332
Computer Science Building

140 Governors Dr
Amherst, MA 01003
United States

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.

Education

  • PhD, computer science, Oregon State University, 2018
  • BS, computer science, Hanoi University of Science and Technology

Hung Le in the News

Awards

Hung Le Selected for 2024 Google Research Scholar Program

Manning College of Information and Computer Sciences Assistant Professor Hung Le was selected for the 2024 Google Research Scholar Program.

Read more
Awards

Hung Le Receives NSF CAREER Award for Work on Graph Theory Algorithms

Assistant Professor Hung Le has received an NSF CAREER award of $655,466 for his project to advance the theoretical understanding of topological graphs.

Read more