| 2008 |
|---|
| 9 | EE | Yossi Azar,
Benjamin E. Birnbaum,
Anna R. Karlin,
Claire Mathieu,
C. Thach Nguyen:
Improved Approximation Algorithms for Budgeted Allocations.
ICALP (1) 2008: 186-197 |
| 8 | EE | Yossi Azar,
Benjamin E. Birnbaum,
Anna R. Karlin,
C. Thach Nguyen:
Thinking Twice about Second-Price Ad Auctions
CoRR abs/0809.1895: (2008) |
| 7 | EE | 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) |
| 2007 |
|---|
| 6 | EE | 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 |
| 5 | EE | 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 |
| 4 | EE | 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. Biology Bioinform. 4(3): 394-402 (2007) |
| 3 | EE | 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) |
| 2005 |
|---|
| 2 | EE | Nguyen Bao Nguyen,
C. Thach Nguyen,
Wing-Kin Sung:
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks.
ISAAC 2005: 402-411 |
| 1 | EE | C. Thach Nguyen,
Y. C. Tay,
Louxin Zhang:
Divide-and-conquer approach for the exemplar breakpoint distance.
Bioinformatics 21(10): 2171-2176 (2005) |
