Cam Thach Nguyen


ncthach (at) cs (dot) washington (dot) edu
Graduate Student
Computer Science, University of Washington
Advisor: Anna Karlin

Research Interest

Algorithms and Theory

Publications

  1. Yossi Azar, Benjamin BirnBaum, Anna R. Karlin, Claire Mathieu, and C. Thach Nguyen. “Improved Approximation Algorithms for Budgeted Allocations”. In submission
  2. 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
  3. CT. Nguyen, J. Shen, MM. Hou, L. Sheng, W. Miller and L. Zhang. “Approximating the Spanning Star Forest Problem and Its Applications to Genomic Sequence Alignment”. Proceedings of the SIAM-ACM Symposium on Discrete Algorithms (SODA) 2007, 645-654
  4. CT. Nguyen, NB. Nguyen, WK. Sung and L. Zhang. “Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem”. IEEE Transaction on Computational Biology and Bioinformatics, accepted in August, 2006
  5. CT. Nguyen, NB. Nguyen and TH. Ngo. “Sorting by Restricted Length-weighted Reversals”. Genomics, Proteomics & Bioinformatics (GPB) 3:2(2006), 120-127
  6. CT. Nguyen, NB. Nguyen and WK. Sung. “Fast Algorithms for computing the Tripartition-based Distance between Phylogenetic Networks”. Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC) 2005, 402-411
  7. CM. Ng, CT. Nguyen, DN. Tran, TS. Tan and SW Yeow. “Analyzing Pre-fetching in Large-scale Visual Simulation”. Proceeding of the 23rd Computer Graphics International (CGI) 2005, 100-107.
  8. CT. Nguyen, YC. Tay and L. Zhang. “Divide-and-Conquer approach for the exemplar breakpoint distance”. Bioinformatics 21(2005), 2171-2176