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
Hilfe
Suche: Author="Chalermsook, Parinya"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New approximability results for the robust
k
-median problem
Sayan Bhattacharya
,
Parinya Chalermsook
,
Kurt Mehlhorn
,
Adrian Neumann
Lecture Notes in Computer Science
8503
, 2014, pp. 50-61
Nearly tight approximability results for minimum biclique cover and partition
Parinya Chalermsook
,
Sandy Heydrich
,
Eugenia Holm
,
Andreas Karrenbauer
Lecture Notes in Computer Science
8737
, 2014, pp. 235-246
Clustering with center constraints
Parinya Chalermsook
,
Suresh Venkatasubramanian
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 401-412
Approximation algorithms and hardness of integral concurrent flow
Parinya Chalermsook
,
Julia Chuzhoy
,
Alina Ene
,
Shi Li
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 689-708
Simple distributed algorithms for approximating minimum Steiner trees
Parinya Chalermsook
,
Jittat Fakcharoenphol
Lecture Notes in Computer Science
3595
, 2005, pp. 380-389