Hung Le

Hung Le
Computer Science Department

University of Victoria

Email: hungle@uvic.ca
I also use the old OSU email: lehu@onid.oregonstate.edu
Google Scholar

About me

I am a PIMS postdoc at the Compter Science Department, University of Victoria, hosted by Valerie King.
Previously, I received a Ph.D. in Computer Science from Oregon State University. I am fortunate enough to have Cora Borradaile as my advisor. I am interested in, but not limitted to, algorithms for graphs with structures, combinatorial optimization, network design, and distributed computing. I have been working on problems in low dimensional metrics, minor-free graphs, and graphs of bounded expansion.
Long time ago, I got a B.S. degree in Computer Science (honors program) from Hanoi University of Science and Technology.

News

I will join the College of Information and Computer Sciences at the University of Massachusetts Amherst as an Assistant Professor in September 2020.

I will be a PC co-chair of SIAM Symposium on Simplicity in Algorithms (SOSA21).

Research

	Light Euclidean spanners with Steiner points. Written with Shay Solomon To appear in 28th Annual European Symposium on Algorithms (ESA 2020).
	Approximation schemes for routing problems in minor-free metrics. Written with Vincent Cohen-Addad and Arnold Filtser and Philip N. Klein To appear in 61st Annual Symposium on Foundations of Computer Science (FOCS 2020).
	A PTAS for subset TSP in minor-free graphs. ACM-SIAM Symposium on Discrete Algorithms (SODA 2020)
	Truly optimal Euclidean spanners. Written with Shay Solomon 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2019). Watch the talk here. Invited to SICOMP Special Issue! Invited to HALG 2020! [Oded's choices]
	Engineering a PTAS for minimum feedback vertex set in planar graphs Written with Glencora Borradaile and Baigong Zheng TInternational Symposium on Experimental Algorithms (SEA 2019).
	Greedy spanners are optimal in doubling metrics Written with Glencora Borradaile and Christian Wulff-Nilsen ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)
	Local search is a PTAS for feedback vertex set in minor-free graphs Written with Baigong Zheng The 25th International Computing and Combinatorics Conference (COCOON 2019) Invited to TCS Special Issue!
	Minor-free graphs have light spanners Written with Glencora Borradaile and Christian Wulff-Nilsen 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017).
	Embedded-width: A variant of treewidth for plane graphs. Written with Glencora Borradaile and Jeff Erickson and Robbie Weber Manuscript.
	A better bound on the largest induced forests in triangle-free planar graphs. LP-Code Graphs and Combinatorics
	Large induced acyclic and outerplanar subgraphs of low-treewidth planar graphs. Written with Glencora Borradaile and Melissa Sherman-Bennett Graphs and Combinatorics.
	Light spanners for bounded treewidth graphs imply light spanners for H-minor-free graphs. Written with Glencora Borradaile Manuscript.
	An optimal dynamic program for r-dominating set over tree decompositions. Written with Glencora Borradaile 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)..

Teaching

Data Mining (SENG 474/ CSC 578D).

Services

Conference Reviews: CCCG 2020, ESA 2020, FOCS 2020, SIROCCO 2020, STOC 2020, SOFSEM 2020, SODA 2020, APPROX 2019, PODC 2019, WADS 2019, SoCG 2019, SODA 2019, ICALP 2018, FOCS 2018, STOC 2018, IPEC 2017, FOCS 2017, ICALP 2017, STOC 2016,SODA 2015, ESA 2014.

Journal Reviews:ACM Transactions on Algorithms (5 times), SIAM Journal on Computing, Discrete & Computational Geometry, Journal of Graph Theory