CV

The pdf version of my CV can be downloaded from here.

Education

• Ph.D. in Computer Science, University of Massachussets Amherst, 2021 - present
  • Doing research in graph algorithms
  • Advisor: Dr. Hung Le
• M.S. in Computer Science, University of Nebraska - Lincoln, 2021
  • CPA: 4.0
• B.S. in Computer Science, Hanoi University of Science and Technology, 2019
  • CPA: 3.69 (rank 1st in the honor class)
  • Major CPA: 3.92

Publications

An O (n√ n log log n) average case algorithm for the maximum induced matching problem in permutation graphs

C Than, T Do. (2018). "An O (n√ n log log n) average case algorithm for the maximum induced matching problem in permutation graphs ." 2018 5th Asian Conference on Defense Technology (ACDT).

Schelling Models with Localized Social Influence: A Game-Theoretic Framework

H Chan, M Irfan and C Than, "Schelling Models with Localized Social Influence: A Game-Theoretic Framework." The 19th International Conference on Autonomous Agents and MultiAgent Systems.

Latest Algorithms on Particular Graph Classes

T Do, T Pham, C Than. (2020). "Latest Algorithms on Particular Graph Classes." IOI Journal.

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators

H Le, C Than. (2021). "Greedy Spanners in Euclidean Spaces Admit Sublinear Separators ." The 33rd ACM-SIAM Symposium on Discrete Algorithms (SODA22).

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω(log n) Lightness Barrier

H Le, S Solomon, C Than. (2023). "Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω(log n) Lightness Barrier ." The 64th IEEE Symposium on Foundations of Computer Science (FOCS) 2023.

Covering Planar Metrics (and Beyond): O(1) Trees Suffice

HC Chang, J Conroy, H Le, L Milenkovic, S Solomon, C Than. (2023). "Covering Planar Metrics (and Beyond): O(1) Trees Suffice ." The 64th IEEE Symposium on Foundations of Computer Science (FOCS) 2023.

Optimal Euclidean Tree Covers

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than. (2024). "Optimal Euclidean Tree Covers. " The 40th International Symposium on Computational Geometry (SoCG 2024).

Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more

HC Chang, J Conroy, H Le, L Milenkovic, S Solomon, C Than. (2024). "Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more ." ACM-SIAM Symposium on Discrete Algorithms (SODA24).

Towards Instance-Optimal Euclidean Spanners

Hung Le, Shay Solomon, Cuong Than, Csaba D. Toth, Tianyi Zhang. (2024). "Towards Instance-Optimal Euclidean Spanners. " The 65th IEEE Symposium on Foundations of Computer Science (FOCS 2024).

Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model

Christian Konrad, Andrew McGregor, Rik Sengupta and Cuong Than. (2024). "Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model. " The Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024).

Work experience

• Summer 2023: Student Researcher at Google Research
  • Design and Implement graph based sampling algorithm for LLM
• Summer 2021 - present: Research Assistant
  • Design algorithm finding sublinear separators in greedy spanners.
  • Mentor students in Early Research Scholars Program. Assist them in reading papers, formalizing and developing ideas for theoretical problems.
• Fall 2019: Research Assistant
  • Computational Decision Science Lab, University of Nebraska - Lincoln
  • Project: Schelling games on graphs
• Fall 2017 - Spring 2019: Research Assistant
  • MSO Lab, Hanoi University of Science and Technology
  • Project: Algorithms solving the maximal induced matching in perfect graphs

Skills

• Languages & technology: Proficient in C, C++, Java. Previously used Python, MATLAB, C#, SQL, JavaScript and Ocaml.
• Experience with Unix/Linux, Mac OS, Window.

Talks

Poster Presentation

June 13, 2019

Poster at International Center for Interdisciplinary Science and Education (ICISE), Quy Nhon, Vietnam

Teaching

• Fall 2018 - Spring 2019: Teaching Assistant
  • Hanoi University of Science and Technology
  • Courses: Design and Analysis Algorithms, Discrete Mathematics
• Fall 2019 - Spring 2021: Teaching Assistant
  • University of Nebraska - Lincoln,
  • Courses: Introduction to Computer Science, Design and Analysis Algorithms