@article{DBLP:journals/corr/Nguyen15,
author = {C. Thach Nguyen},
title = {Optimal non-adaptive solutions for the counterfeit coin problem},
journal = {CoRR},
volume = {abs/1502.04896},
year = {2015},
url = {http://arxiv.org/abs/1502.04896},
eprinttype = {arXiv},
eprint = {1502.04896},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Nguyen15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenENRRS13,
author = {Ning Chen and
Roee Engelberg and
C. Thach Nguyen and
Prasad Raghavendra and
Atri Rudra and
Gyanit Singh},
title = {Improved Approximation Algorithms for the Spanning Star Forest Problem},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {498--516},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9607-1},
doi = {10.1007/S00453-011-9607-1},
timestamp = {Sun, 26 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenENRRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/KarlinNP13,
author = {Anna R. Karlin and
C. Thach Nguyen and
Yuval Peres},
title = {Selling in Exclusive Markets: Some Observations on Prior-Free Mechanism
Design},
journal = {{ACM} Trans. Economics and Comput.},
volume = {1},
number = {2},
pages = {7:1--7:31},
year = {2013},
url = {https://doi.org/10.1145/2465769.2465772},
doi = {10.1145/2465769.2465772},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/teco/KarlinNP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/CelisKLNT12,
author = {L. Elisa Celis and
Anna R. Karlin and
Kevin Leyton{-}Brown and
C. Thach Nguyen and
David R. M. Thompson},
editor = {J{\"{o}}rg Hoffmann and
Bart Selman},
title = {Approximately Revenue-Maximizing Auctions for Deliberative Agents},
booktitle = {Proceedings of the Twenty-Sixth {AAAI} Conference on Artificial Intelligence,
July 22-26, 2012, Toronto, Ontario, Canada},
pages = {1313--1318},
publisher = {{AAAI} Press},
year = {2012},
url = {https://doi.org/10.1609/aaai.v26i1.8270},
doi = {10.1609/AAAI.V26I1.8270},
timestamp = {Mon, 04 Sep 2023 15:56:47 +0200},
biburl = {https://dblp.org/rec/conf/aaai/CelisKLNT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KarlinMN11,
author = {Anna R. Karlin and
Claire Mathieu and
C. Thach Nguyen},
editor = {Oktay G{\"{u}}nl{\"{u}}k and
Gerhard J. Woeginger},
title = {Integrality Gaps of Linear and Semi-Definite Programming Relaxations
for Knapsack},
booktitle = {Integer Programming and Combinatoral Optimization - 15th International
Conference, {IPCO} 2011, New York, NY, USA, June 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6655},
pages = {301--314},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20807-2\_24},
doi = {10.1007/978-3-642-20807-2\_24},
timestamp = {Tue, 29 Dec 2020 18:40:14 +0100},
biburl = {https://dblp.org/rec/conf/ipco/KarlinMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/DevanurHKN11,
author = {Nikhil R. Devanur and
Jason D. Hartline and
Anna R. Karlin and
C. Thach Nguyen},
editor = {Ning Chen and
Edith Elkind and
Elias Koutsoupias},
title = {Prior-Independent Multi-parameter Mechanism Design},
booktitle = {Internet and Network Economics - 7th International Workshop, {WINE}
2011, Singapore, December 11-14, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7090},
pages = {122--133},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25510-6\_11},
doi = {10.1007/978-3-642-25510-6\_11},
timestamp = {Fri, 24 Apr 2020 14:22:03 +0200},
biburl = {https://dblp.org/rec/conf/wine/DevanurHKN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-1283,
author = {Anna R. Karlin and
Claire Mathieu and
C. Thach Nguyen},
title = {Integrality Gaps of Linear and Semi-definite Programming Relaxations
for Knapsack},
journal = {CoRR},
volume = {abs/1007.1283},
year = {2010},
url = {http://arxiv.org/abs/1007.1283},
eprinttype = {arXiv},
eprint = {1007.1283},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-1283.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AzarBKN09,
author = {Yossi Azar and
Benjamin E. Birnbaum and
Anna R. Karlin and
C. Thach Nguyen},
editor = {Amos Fiat and
Peter Sanders},
title = {On Revenue Maximization in Second-Price Ad Auctions},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {155--166},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_14},
doi = {10.1007/978-3-642-04128-0\_14},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/AzarBKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0908-2834,
author = {Yossi Azar and
Benjamin E. Birnbaum and
Anna R. Karlin and
C. Thach Nguyen},
title = {On Revenue Maximization in Second-Price Ad Auctions},
journal = {CoRR},
volume = {abs/0908.2834},
year = {2009},
url = {http://arxiv.org/abs/0908.2834},
eprinttype = {arXiv},
eprint = {0908.2834},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0908-2834.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NguyenSHSMZ08,
author = {C. Thach Nguyen and
Jian Shen and
Minmei Hou and
Li Sheng and
Webb Miller and
Louxin Zhang},
title = {Approximating the Spanning Star Forest Problem and Its Application
to Genomic Sequence Alignment},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {3},
pages = {946--962},
year = {2008},
url = {https://doi.org/10.1137/070682150},
doi = {10.1137/070682150},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/NguyenSHSMZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AzarBKMN08,
author = {Yossi Azar and
Benjamin E. Birnbaum and
Anna R. Karlin and
Claire Mathieu and
C. Thach Nguyen},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Improved Approximation Algorithms for Budgeted Allocations},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {186--197},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_16},
doi = {10.1007/978-3-540-70575-8\_16},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AzarBKMN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-1895,
author = {Yossi Azar and
Benjamin E. Birnbaum and
Anna R. Karlin and
C. Thach Nguyen},
title = {Thinking Twice about Second-Price Ad Auctions},
journal = {CoRR},
volume = {abs/0809.1895},
year = {2008},
url = {http://arxiv.org/abs/0809.1895},
eprinttype = {arXiv},
eprint = {0809.1895},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-1895.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NguyenNS07,
author = {Nguyen Bao Nguyen and
C. Thach Nguyen and
Wing{-}Kin Sung},
title = {Fast algorithms for computing the tripartition-based distance between
phylogenetic networks},
journal = {J. Comb. Optim.},
volume = {13},
number = {3},
pages = {223--242},
year = {2007},
url = {https://doi.org/10.1007/s10878-006-9025-5},
doi = {10.1007/S10878-006-9025-5},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NguyenNS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/NguyenNSZ07,
author = {C. Thach Nguyen and
Nguyen Bao Nguyen and
Wing{-}Kin Sung and
Louxin Zhang},
title = {Reconstructing Recombination Network from Sequence Data: The Small
Parsimony Problem},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {4},
number = {3},
pages = {394--402},
year = {2007},
url = {https://doi.org/10.1109/tcbb.2007.1018},
doi = {10.1109/TCBB.2007.1018},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/NguyenNSZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChenENRRS07,
author = {Ning Chen and
Roee Engelberg and
C. Thach Nguyen and
Prasad Raghavendra and
Atri Rudra and
Gyanit Singh},
editor = {Moses Charikar and
Klaus Jansen and
Omer Reingold and
Jos{\'{e}} D. P. Rolim},
title = {Improved Approximation Algorithms for the Spanning Star Forest Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
20-22, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4627},
pages = {44--58},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74208-1\_4},
doi = {10.1007/978-3-540-74208-1\_4},
timestamp = {Sat, 30 Sep 2023 09:34:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChenENRRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/NguyenSHSMZ07,
author = {C. Thach Nguyen and
Jian Shen and
Minmei Hou and
Li Sheng and
Webb Miller and
Louxin Zhang},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Approximating the spanning star forest problem and its applications
to genomic sequence alignment},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {645--654},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283453},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/NguyenSHSMZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/NguyenTZ05,
author = {C. Thach Nguyen and
Y. C. Tay and
Louxin Zhang},
title = {Divide-and-conquer approach for the exemplar breakpoint distance},
journal = {Bioinform.},
volume = {21},
number = {10},
pages = {2171--2176},
year = {2005},
url = {https://doi.org/10.1093/bioinformatics/bti327},
doi = {10.1093/BIOINFORMATICS/BTI327},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/NguyenTZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/NguyenNS05,
author = {Nguyen Bao Nguyen and
C. Thach Nguyen and
Wing{-}Kin Sung},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {Fast Algorithms for Computing the Tripartition-Based Distance Between
Phylogenetic Networks},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {402--411},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_41},
doi = {10.1007/11602613\_41},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/NguyenNS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
