Cuong Than

According to our database, Cuong Than authored at least 17 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators.

Hung Le, Cuong Than

ACM Trans. Algorithms, July, 2024

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

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

Christian Konrad, Andrew McGregor, Rik Sengupta, Cuong Than

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

Towards Instance-Optimal Euclidean Spanners.

Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Optimal Euclidean Tree Covers.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

CoRR, 2023

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

Hung Le, Shay Solomon, Cuong Than

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

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

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2009

Species Tree Inference by Minimizing Deep Coalescences.

Cuong Than, Luay Nakhleh

PLoS Comput. Biol., 2009

2008

Seeing the trees and their branches in the network is hard.

Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia

Theor. Comput. Sci., 2008

PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships.

Cuong Than, Derek A. Ruths, Luay Nakhleh

BMC Bioinform., 2008

Integrating Sequence and Topology for Efficient and Accurate Detection of Horizontal Gene Transfer.

Cuong Than, Guohua Jin, Luay Nakhleh

Proceedings of the Comparative Genomics, International Workshop, 2008

Efficient inference of bacterial strain trees from genome-scale multilocus data.

Cuong Than, R. Sugino, Hideki Innan, Luay Nakhleh

Proceedings of the Proceedings 16th International Conference on Intelligent Systems for Molecular Biology (ISMB), 2008

SPR-based Tree Reconciliation: Non-binary Trees and Multiple Solutions.

Cuong Than, Luay Nakhleh

Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007

Confounding Factors in HGT Detection: Statistical Error, Coalescent Effects, and Multiple Solutions.

Cuong Than, Derek A. Ruths, Hideki Innan, Luay Nakhleh

J. Comput. Biol., 2007

Seeing the Trees and Their Branches in the Forest is Hard.

Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia

Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

2006

Identifiability Issues in Phylogeny-Based Detection of Horizontal Gene Transfer.

Cuong Than, Derek A. Ruths, Hideki Innan, Luay Nakhleh

Proceedings of the Comparative Genomics, 2006