Identifiability Issues in Phylogeny-Based Detection of Horizontal Gene Transfer. - Cuong Than; Derek A. Ruths; Hideki Innan; Luay Nakhleh (Comparative Genomics, 2006)

Seeing the Trees and Their Branches in the Forest is Hard. - Iyad A. Kanj; Luay Nakhleh; Cuong Than; Ge Xia (ICTCS, 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)

SPR-based Tree Reconciliation: Non-binary Trees and Multiple Solutions. - Cuong Than; Luay Nakhleh (APBC, 2008)

Efficient inference of bacterial strain trees from genome-scale multilocus data. - Cuong Than; R. Sugino; Hideki Innan; Luay Nakhleh (ISMB, 2008)

Integrating Sequence and Topology for Efficient and Accurate Detection of Horizontal Gene Transfer. - Cuong Than; Guohua Jin; Luay Nakhleh (RECOMB-CG, 2008)

PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships. - Cuong Than; Derek A. Ruths; Luay Nakhleh (BMC Bioinform., 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)

Species Tree Inference by Minimizing Deep Coalescences. - Cuong Than; Luay Nakhleh (PLoS Comput. Biol., 2009)

Covering Planar Metrics (and Beyond): O(1) Trees Suffice. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (FOCS, 2023)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. - Hung Le 001; Shay Solomon; Cuong Than (FOCS, 2023)

Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (CoRR, 2023)

Optimal Euclidean Tree Covers. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SoCG, 2024)

Towards Instance-Optimal Euclidean Spanners. - Hung Le 001; Shay Solomon; Cuong Than; Csaba D. Tóth; Tianyi Zhang 008 (FOCS, 2024)

Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model. - Christian Konrad 001; Andrew McGregor 001; Rik Sengupta; Cuong Than (FSTTCS, 2024)

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SODA, 2024)

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. - Hung Le 001; Cuong Than (ACM Trans. Algorithms, 2024)

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Shay Solomon; Cuong Than (STOC, 2025)

Approximate Light Spanners in Planar Graphs. - Hung Le 001; Shay Solomon; Cuong Than; Csaba D. Tóth; Tianyi Zhang 008 (CoRR, 2025)

A Tight Lower Bound for Doubling Spanners. - An La; Hung Le 001; Shay Solomon; Cuong Than; Vinayak; Shuang Yang; Tianyi Zhang 008 (CoRR, 2025)