default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCuong Than
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j5]Hung Le
, Cuong Than:
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. ACM Trans. Algorithms 20(3): 23 (2024)- 2009
- [j4]Cuong Than, Luay Nakhleh:
Species Tree Inference by Minimizing Deep Coalescences. PLoS Comput. Biol. 5(9) (2009) - 2008
- [j3]Cuong Than, Derek A. Ruths, Luay Nakhleh:
PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships. BMC Bioinform. 9 (2008) - [j2]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): 153-164 (2008) - 2007
- [j1]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): 517-535 (2007)
Conference and Workshop Papers
- 2024
- [c12]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Optimal Euclidean Tree Covers. SoCG 2024: 37:1-37:15 - [c11]Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang:
Towards Instance-Optimal Euclidean Spanners. FOCS 2024: 1579-1609 - [c10]Christian Konrad, Andrew McGregor, Rik Sengupta, Cuong Than:
Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model. FSTTCS 2024: 29:1-29:15 - [c9]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: 5300-5331 - 2023
- [c8]Hung Le, Shay Solomon, Cuong Than:
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. FOCS 2023: 77-97 - [c7]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Covering Planar Metrics (and Beyond): O(1) Trees Suffice. FOCS 2023: 2231-2261 - 2022
- [c6]Hung Le, Cuong Than:
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. SODA 2022: 3287-3310 - 2008
- [c5]Cuong Than, Luay Nakhleh:
SPR-based Tree Reconciliation: Non-binary Trees and Multiple Solutions. APBC 2008: 251-260 - [c4]Cuong Than, R. Sugino, Hideki Innan, Luay Nakhleh:
Efficient inference of bacterial strain trees from genome-scale multilocus data. ISMB 2008: 123-131 - [c3]Cuong Than, Guohua Jin, Luay Nakhleh:
Integrating Sequence and Topology for Efficient and Accurate Detection of Horizontal Gene Transfer. RECOMB-CG 2008: 113-127 - 2007
- [c2]Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia:
Seeing the Trees and Their Branches in the Forest is Hard. ICTCS 2007: 82-93 - 2006
- [c1]Cuong Than, Derek A. Ruths, Hideki Innan, Luay Nakhleh:
Identifiability Issues in Phylogeny-Based Detection of Horizontal Gene Transfer. Comparative Genomics 2006: 215-229
Informal and Other Publications
- 2024
- [i7]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Optimal Euclidean Tree Covers. CoRR abs/2403.17754 (2024) - [i6]Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang:
Towards Instance-Optimal Euclidean Spanners. CoRR abs/2409.08227 (2024) - 2023
- [i5]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Covering Planar Metrics (and Beyond): O(1) Trees Suffice. CoRR abs/2306.06215 (2023) - [i4]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 abs/2306.06235 (2023) - [i3]Hung Le, Shay Solomon, Cuong Than:
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω(log n) Lightness Barrier. CoRR abs/2306.11226 (2023) - [i2]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 abs/2308.00555 (2023) - 2021
- [i1]Hung Le, Cuong Than:
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. CoRR abs/2107.06490 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
