About me

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 technical blog Rambling on Graphs is up.


Check out our FOCS 2022 workshop “Advances on Metric Embeddings” I co-organize with Arnold Filtser.

News

  • [Dec 2022] My CAREER proposal Geometric Techniques for Topological Graph Algorithms got funded by NSF.

  • [Dec 2022] Our paper “Tuning the Tail Latency of Distributed Queries Using Replication “ is submitted to Arxiv.

  • [Oct 2022] Our paper “Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency” is accepted to SODA 2023.

  • [July 2022] Our paper “Low Treewidth Embeddings of Planar and Minor-Free Metrics “ is accepted to FOCS 2022.

  • [May 2022] Our paper “Can’t See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners” is accepted to PODC 2022.

  • [March 2022] I will be a PC member of STOC 2023. I’m looking forward to reading your papers!

  • [March 2022] Our paper “Greedy Spanners in Euclidean Spaces Admit Sublinear Separators” is invited to the special issue of ACM Transactions on Algorithms (TALG) devoted to top papers in SODA 2022.

  • [Feb 2022] Our paper “Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound” is accepted to SoCG 2022.

  • [Feb 2022] Our paper “Locality-Sensitive Orderings and Applications to Reliable Spanners” is accepted to STOC 2022.

  • [Nov 2021] Our paper “Dynamic Matching Algorithms Under Vertex Updates” is accepted to ITCS 2022.