Cuong Than

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 12

Top Topics

Euclidean Space

Binary Decision Tree

Top Venues

ACM Trans. Algorithms

Publications

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
Optimal Euclidean Tree Covers. CoRR (2024)
Hung Le, Cuong Than
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. ACM Trans. Algorithms 20 (3) (2024)
Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
Optimal Euclidean Tree Covers. SoCG (2024)
Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. SODA (2024)
Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. CoRR (2023)
Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. CoRR (2023)
Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
Covering Planar Metrics (and Beyond): O(1) Trees Suffice. FOCS (2023)
Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
Covering Planar Metrics (and Beyond): O(1) Trees Suffice. CoRR (2023)
Hung Le, Shay Solomon, Cuong Than
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. FOCS (2023)
Hung Le, Shay Solomon, Cuong Than
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω(log n) Lightness Barrier. CoRR (2023)
Hung Le, Cuong Than
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. SODA (2022)
Hung Le, Cuong Than
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. CoRR (2021)
Cuong Than, Luay Nakhleh
Species Tree Inference by Minimizing Deep Coalescences. PLoS Comput. Biol. 5 (9) (2009)
Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia
Seeing the trees and their branches in the network is hard. Theor. Comput. Sci. 401 (1-3) (2008)
Cuong Than, Luay Nakhleh
SPR-based Tree Reconciliation: Non-binary Trees and Multiple Solutions. APBC (2008)
Cuong Than, Derek A. Ruths, Luay Nakhleh
PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships. BMC Bioinform. 9 (2008)
Cuong Than, Guohua Jin, Luay Nakhleh
Integrating Sequence and Topology for Efficient and Accurate Detection of Horizontal Gene Transfer. RECOMB-CG (2008)
Cuong Than, R. Sugino, Hideki Innan, Luay Nakhleh
Efficient inference of bacterial strain trees from genome-scale multilocus data. ISMB (2008)
Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia
Seeing the Trees and Their Branches in the Forest is Hard. ICTCS (2007)
Cuong Than, Derek A. Ruths, Hideki Innan, Luay Nakhleh
Confounding Factors in HGT Detection: Statistical Error, Coalescent Effects, and Multiple Solutions. J. Comput. Biol. 14 (4) (2007)
Cuong Than, Derek A. Ruths, Hideki Innan, Luay Nakhleh
Identifiability Issues in Phylogeny-Based Detection of Horizontal Gene Transfer. Comparative Genomics (2006)