About me

I am a fourth 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

• [Sep 2024] Our paper “Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model” got accepted to FSTTCS 2024.
• [Sep 2024] Our paper “Towards Instance-Optimal Euclidean Spanners” was uploaded to Arxiv.
• [June 2024] Our paper “Towards Instance-Optimal Euclidean Spanners” got accepted to FOCS24
• [Jan 2024] Our paper “Optimal Euclidean Tree Covers” got accepted to SoCG24
• [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!