Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Nguyen, C. Thach"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved approximation algorithms for the spanning star forest problem
Ning Chen
,
Roee Engelberg
,
C. Thach Nguyen
,
Prasad Raghavendra
,
Atri Rudra
Algorithmica
65
(3), 2013, pp. 498-516
Integrality gaps of linear and semi-definite programming relaxations for knapsack
Anna R. Karlin
,
Claire Mathieu
,
C. Thach Nguyen
Lecture Notes in Computer Science
6655
, 2011, pp. 301-314
On revenue maximization in second-price ad auctions
Yossi Azar
,
Benjamin Birnbaum
,
Anna R. Karlin
,
C. Thach Nguyen
Lecture Notes in Computer Science
5757
, 2009, pp. 155-166
Improved approximation algorithms for budgeted allocations
Yossi Azar
,
Benjamin Birnbaum
,
Anna R. Karlin
,
Claire Mathieu
,
C. Thach Nguyen
Lecture Notes in Computer Science
5125
, 2008, pp. 186-197
Approximating the spanning star forest problem and its application to genomic sequence alignment
C. Thach Nguyen
,
Jian Shen
,
Minmei Hou
,
Li Sheng
,
Webb Miller
,
Louxin Zhang
SIAM Journal on Computing
38
(3), 2008, pp. 946-962
Fast algorithms for computing the tripartition-based distance between phylogenetic networks
Nguyen Bao Nguyen
,
C. Thach Nguyen
,
Wing-Kin Sung
Lecture Notes in Computer Science
3827
, 2005, pp. 402-411
Divide-and-conquer approach for the exemplar breakpoint distance
C. Thach Nguyen
,
Y.C. Tay
,
Louxin Zhang
Bioinformatics
21
(10), 2005, pp. 2171-2176