I am interested in Theoretical Computer Science in general and Graph Algorithms in particular. I am associated with Umass Theory Group. Before coming to Umass, I was a PIMS postdoc at the Compter Science Department, University of Victoria, hosted by Valerie King. I received a Ph.D. in Computer Science from Oregon State University. I am fortunate enough to have Cora Borradaile as my advisor. Long time ago, I got a B.S. degree in Computer Science (honors program) from Hanoi University of Science and Technology.
My research has been generously supported by an NSF small grant (CCF-2121952) and an NSF CAREER Award (CCF-2237288).
My technical blog Rambling on Graphs is up.
I will be updating both good news, bad news and all kinds of news.
[Oct 2023] One paper was rejected from SOSA 2024.
[August 2023] Our paper “Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More” was uploaded to Arxiv.
[June 2023] One paper was rejected from ESA 2023.
[May 2023] My student Cuong Than will be interning at Google Research. Congrats Cuong!
[April 2023] Our paper “Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1” was uploaded to Arxiv.
[April 2023] Our paper “VC Set Systems in Minor-free (Di)Graphs and Applications” was uploaded to Arxiv.
[Feb 2023] Paper “Sparse Euclidean Spanners with Optimal Diameter: A General Robust Lower Bound Via a Concave Inverse-Ackermann Function” led by student co-author Lazar Milenković is accepted to SoCG 2023