Welcome to my homepage

I'm leaving Oregon State University and no longer update this site. I'm slowly moving to this Google site.

About me


I am a 5th year Ph.D. student working with Cora Borradaile. I am interested in, but not limited to, graph theory and its applications to computer science. I have been working on problems in planar graphs and H-minor-free graphs, especially approximating TSP. I received the Bachelor's degree in Computer Science (honors program) from Hanoi University of Science and Technology in June 2012.

I define myself as a theoretical computer scientist. That may suggest that I write more proofs than codes. However, it's not entirely true. I do write codes and love to do so. I worked with Core Ranking team in Bing as a SDE intern for two summers, 2016 and 2017. Recently, I have been working on engineering algorithms for planar graphs.

News

!!!!! The manuscript of paper "Designing practical PTASes for minimum Feedback Vertex Set in planar graphs" is on Arxiv now. Check out here!.
!!!!! The manuscript of paper "Local Search is a PTAS for Feedback Vertex Set in Minor-free Graphs" is on Arxiv now. Check out here!.
!!!!! The manuscript of paper "A PTAS for subset TSP in minor-free graphs" is on Arxiv now. Check out here!.
The manuscript of paper "Greedy spanners are optimal in doubling metrics" is on Arxiv now. Check out here!.
Paper "Large induced acyclic and outerplanar subgraphs of low-treewidth planar graphs" is accepted to Graphs and Combinatorics journal.
Paper "Light spanners in minor-free graphs" is accepted to FOCS 2017.
The manuscript of paper "Light spanners for bounded treewidth graphs imply light spanners for H-minor-free graphs" is on Arxiv now. Check out here!
The manuscript of paper "Embedded-width: A variant of treewidth for plane graphs" is on Arxiv now. Check out here!
The proceeding version of our paper "An Optimal Dynamic Program for r-dominating Set over Tree Decompositions" is up. Check out here!

Research


[PDF] Designing practical PTASes for minimum Feedback Vertex Set in planar graphs
Written with Glencora Borradaile and Baigong Zheng
Submitted to ESA 2018 Track B.
[PDF] A PTAS for subset TSP in minor-free graphs
Extended abstract.
[PDF] Greedy spanners are optimal in doubling metrics
Written with Glencora Borradaile and Christian Wulff-Nilsen
Submitted to SoCG 2018.
[PDF] Local Search is a PTAS for Feedback Vertex Set in Minor-free Graphs
Written with Baigong Zheng
Manuscript.
[PDF] 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).
[PDF] Embedded-width: A variant of treewidth for plane graphs.
Written with Glencora Borradaile and Jeff Erickson and Robbie Weber
Manuscript.
[PDF] A better bound on the largest induced forests in triangle-free planar graphs. LP-Code
Submitted to Graphs and Combinatorics
[PDF] Large induced acyclic and outerplanar subgraphs of low-treewidth planar graphs.
Written with Glencora Borradaile and Melissa Sherman-Bennett
Graphs and Combinatorics.
[PDF] Light spanners for bounded treewidth graphs imply light spanners for H-minor-free graphs.
Written with Glencora Borradaile
Manuscript.
[PDF] 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


Teaching Assistant for:
  1. CS 420/520: Graph theory with applications to computer science (Winter 2015).
  2. CS 515: Algorithms and Data Structures, (Fall 2015).
  3. CS 517: Computational Complexity, (Spring 2016).

Services


Reviewer for:
  1. ESA 2014.
  2. SODA 2015.
  3. STOC 2016.
  4. ICALP 2017.
  5. FOCS 2017.
  6. TALG 2017.
  7. IPEC 2017.
  8. STOC 2018.
  9. FOCS 2018.

Courses


  1. CS 515: Algorithms and Data Structures.
  2. CS 559: Introduction to Computer Graphics.
  3. CS 520: Graph Theory with Applications to Computer Science.
  4. CS 559: Introduction to Computer Graphics.
  5. CS 519: Special Topics: Computational Geometry.
  6. CS 519: Special Topics: Cryptographic Protocols.
  7. CS 517: Theory of Computation.
  8. CS 523: Advanced Algorhtms.
  9. CS 527: Error Correcting Codes.
  10. MTH 532: General Topology and Fundamental Groups.
  11. MTH 543: Abstract Linear Algebra.
  12. MTH 664: Abstract Algebra.
  13. MTH 645: Graduate Algebra.

Links



How Many People Visit