default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC. Thach Nguyen
Person information
Other persons with a similar name
- Thach-Thao Duong
![[0000-0003-2294-3619]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-2294-3619")
(aka: Thach-Thao Nguyen Duong) - Ba Thach Nguyen
- Hoang-Thach Nguyen
- Thach Nguyen
- Thach-Anh Nguyen
- Thach G. Nguyen
- Thach Huy Nguyen
- Thach Le Nguyen
- Nguyen Thach
- Nguyen Ngoc Thach (aka: Ngoc Thach Nguyen, Thach Ngoc Nguyen) — disambiguation page
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[i4]C. Thach Nguyen:
Optimal non-adaptive solutions for the counterfeit coin problem. CoRR abs/1502.04896 (2015)- 2013
- [j6]Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh:
Improved Approximation Algorithms for the Spanning Star Forest Problem. Algorithmica 65(3): 498-516 (2013) - [j5]Anna R. Karlin, C. Thach Nguyen, Yuval Peres:
Selling in Exclusive Markets: Some Observations on Prior-Free Mechanism Design. ACM Trans. Economics and Comput. 1(2): 7:1-7:31 (2013) - 2012
- [c8]L. Elisa Celis, Anna R. Karlin, Kevin Leyton-Brown, C. Thach Nguyen, David R. M. Thompson:
Approximately Revenue-Maximizing Auctions for Deliberative Agents. AAAI 2012: 1313-1318 - 2011
- [c7]Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack. IPCO 2011: 301-314 - [c6]Nikhil R. Devanur, Jason D. Hartline, Anna R. Karlin, C. Thach Nguyen:
Prior-Independent Multi-parameter Mechanism Design. WINE 2011: 122-133 - 2010
- [i3]Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack. CoRR abs/1007.1283 (2010)
2000 – 2009
- 2009
- [c5]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen:
On Revenue Maximization in Second-Price Ad Auctions. ESA 2009: 155-166 - [i2]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen:
On Revenue Maximization in Second-Price Ad Auctions. CoRR abs/0908.2834 (2009) - 2008
- [j4]C. Thach Nguyen, Jian Shen, Minmei Hou, Li Sheng, Webb Miller, Louxin Zhang:
Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment. SIAM J. Comput. 38(3): 946-962 (2008) - [c4]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
Improved Approximation Algorithms for Budgeted Allocations. ICALP (1) 2008: 186-197 - [i1]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen:
Thinking Twice about Second-Price Ad Auctions. CoRR abs/0809.1895 (2008) - 2007
- [j3]Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung:
Fast algorithms for computing the tripartition-based distance between phylogenetic networks. J. Comb. Optim. 13(3): 223-242 (2007) - [j2]C. Thach Nguyen, Nguyen Bao Nguyen, Wing-Kin Sung, Louxin Zhang:
Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 4(3): 394-402 (2007) - [c3]Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh:
Improved Approximation Algorithms for the Spanning Star Forest Problem. APPROX-RANDOM 2007: 44-58 - [c2]C. Thach Nguyen, Jian Shen, Minmei Hou, Li Sheng, Webb Miller, Louxin Zhang:
Approximating the spanning star forest problem and its applications to genomic sequence alignment. SODA 2007: 645-654 - 2005
- [j1]C. Thach Nguyen, Y. C. Tay, Louxin Zhang:
Divide-and-conquer approach for the exemplar breakpoint distance. Bioinform. 21(10): 2171-2176 (2005) - [c1]Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung:
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks. ISAAC 2005: 402-411
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-04-24 23:13 CEST 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:
