( en | de | ru )

 

Disambiguation of "Nguyen, C. Thach"

Author of the publication

copydeleteadd this publication to your clipboard
Approximately Revenue-Maximizing Auctions for Deliberative Agents.

, , , , and . AAAI, page 1313-1318. AAAI Press, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nguyen ngoc Thach

Ngoc-Thach Nguyen

Nguyen-Nguyen Nguyen

Hoang Tran Thach

Nguyen Nguyen

 

Other publications of authors with the same name

Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack, , and . CoRR, (2010)Optimal non-adaptive solutions for the counterfeit coin problem.. CoRR, (2015)On Revenue Maximization in Second-Price Ad Auctions., , , and . ESA, volume 5757 of Lecture Notes in Computer Science, page 155-166. Springer, (2009)Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment., , , , , and . SIAM J. Comput., 38 (3): 946-962 (2008)Thinking Twice about Second-Price Ad Auctions, , , and . CoRR, (2008)Improved Approximation Algorithms for Budgeted Allocations., , , , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 186-197. Springer, (2008)Approximating the spanning star forest problem and its applications to genomic sequence alignment., , , , , and . SODA, page 645-654. SIAM, (2007)Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem., , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 4 (3): 394-402 (2007)Fast algorithms for computing the tripartition-based distance between phylogenetic networks., , and . J. Comb. Optim., 13 (3): 223-242 (2007)Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 402-411. Springer, (2005)