Cuong Than

Orcid: 0000-0001-7350-331X

According to our database1, Cuong Than authored at least 22 papers between 2006 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Approximate Light Spanners in Planar Graphs.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Approximating Euclidean Shallow-Light Trees.
CoRR, December, 2025

Tree-Like Shortcuttings of Trees.
CoRR, October, 2025

A Tight Lower Bound for Doubling Spanners.
CoRR, August, 2025

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model.
Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

Towards Instance-Optimal Euclidean Spanners.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Optimal Euclidean Tree Covers.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

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

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Covering Planar Metrics (and Beyond): O(1) Trees Suffice.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2009
Species Tree Inference by Minimizing Deep Coalescences.
PLoS Comput. Biol., 2009

2008
Seeing the trees and their branches in the network is hard.
Theor. Comput. Sci., 2008

PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships.
BMC Bioinform., 2008

Integrating Sequence and Topology for Efficient and Accurate Detection of Horizontal Gene Transfer.
Proceedings of the Comparative Genomics, International Workshop, 2008

Efficient inference of bacterial strain trees from genome-scale multilocus data.
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.
Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007
Confounding Factors in HGT Detection: Statistical Error, Coalescent Effects, and Multiple Solutions.
J. Comput. Biol., 2007

Seeing the Trees and Their Branches in the Forest is Hard.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

2006
Identifiability Issues in Phylogeny-Based Detection of Horizontal Gene Transfer.
Proceedings of the Comparative Genomics, 2006


  Loading...