Portfolio item number 1
Short description of portfolio item number 1
Posts by Collection
portfolio
Portfolio item number 2
Short description of portfolio item number 2 
publications
An O (n√ n log log n) average case algorithm for the maximum induced matching problem in permutation graphs
Published in ACDT, 2018
This paper is about maximum induced matching problem in permutation graphs.
Recommended citation: 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
Published in AAMAS, 2020
This paper is about game theory: Schelling Models with Localized Social Influence.
Recommended citation: 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
Published in IOI Journal, 2020
This paper is about algorithms solving maximum induced matching and its application in competitive programming.
Recommended citation: T Do, T Pham, C Than. (2020). "Latest Algorithms on Particular Graph Classes." IOI Journal.
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
Published in SODA, 2022
We prove that greedy spanners admit sublinear separator in Euclidean Spaces. Moreover, we extend the result to bound doubling dimension spaces. We prove that there exists a spanner with sublinear separator and bounded degree. This resolves an open question from 2010.
Recommended citation: 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
Published in FOCS, 2023
We propose an algorithm constructing a Vertex-Fault-Tolerant spanner of a set of points in doubling space. Our algorithm is optimal in term of lightness, sparsity, maximum degree and running time.
Recommended citation: 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
Published in FOCS, 2023
We propose an algorithm constructing a $\epsilon$ -distortion tree cover for planar metrics of size $O_\epsilon(1)$. We also improve the embedding algorithm for planar graph into a bounded treedwidth graph with additive distortion
Recommended citation: 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.
talks
teaching
Teaching assisstant in Design and Analysis Algorithms
Undergraduate course for talent engineer class, Hanoi University of Science and Technology, School of Information and Communication Technology, 2018
Grading and preparing final projects materials for students
Teaching assisstant in Discrete Mathematics
Undergraduate class, University of Science and Technology, School of Information and Communication Technology, 2019
Grading and preparing class’ materials
Teaching assisstant in Introduction to Computer Science
Undergraduate course, University of Nebraska - Lincoln, Department of Computer Science and Engineering, 2019
Grading and preparing lab coding materials for students
Teaching assisstant in Design and Analysis Algorithms
Undergraduate and Graduate course, University of Nebraska - Lincoln, Department of Computer Science and Engineering, 2020
Grading and preparing final projects materials for students