About me

I am a third year Ph.D. student at University of Massachusetts Amherst. I am currently working under the supervision of Dr. Hung Le. My interest is Theoretical Computer Science in general and graph algorithms in particular. I earned my B.S. degree in Computer Science (honors program) from Hanoi University of Science and Technology and my M.S. degree in Computer Science from University of Nebraska at Lincoln.

Beside research, I am also interested in programming and math contests. When I was an undergraduate student, I participated in many competitions in mathematics and programming (the International Collegiate Programming Contest). I was fortunate enough to get good results in those contests.

If you have any question about my information, please contact me via my email: cthan@umass.edu.

News

• [Oct 2023] Our paper “Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More” got accepted to SODA24
• [July 2023] Our paper “Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More” was uploaded to Arxiv.
• [July 2023] Our paper “Covering Planar Metrics (and Beyond): O(1) Trees Suffice” is accepted to FOCS 2023. Thank every co-author for your hard work!
• [July 2023] Our paper “Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $\Omega (\log n) $ Lightness Barrier” is accepted to FOCS 2023. Thank Hung Le and Shay Solomon for your great mentorship.
• [June 2023] Our manuscript “Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions” was uploaded to Arxiv.
• [May 2023] I will intern at Google Research as a Student Researcher in Summer 2023.
• [Mar 2023] Our paper “Greedy Spanners in Euclidean Spaces Admit Sublinear Separators” is accepted to TALG.
• [Aug 2022] I will visit Tel Aviv-University in a research exchange.
• [Oct 2021] Our paper “Greedy Spanners in Euclidean Spaces Admit Sublinear Separators” is accepted to SODA 2022.