37. STOC 2005:
Baltimore,
MD,
USA
Harold N. Gabow, Ronald Fagin (Eds.):
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005.
ACM 2005, ISBN 1-58113-960-8 BibTeX
Session 1A
Session 1B
Session 2A
Session 2B
Keynote
Session 4A
Session 4B
Session 5A
Session 5B
Session 6A
Session 6B
Session 7A
Session 7B
Best Paper
Session 9A
Session 9B
Session 10A
Session 10B
Session 11A
Session 11B
- Sanjeev Arora, James R. Lee, Assaf Naor:
Euclidean distortion and the sparsest cut.
553-562
Electronic Edition (ACM DL) BibTeX
- Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee:
Improved approximation algorithms for minimum-weight vertex separators.
563-572
Electronic Edition (ACM DL) BibTeX
- Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev:
O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems.
573-581
Electronic Edition (ACM DL) BibTeX
- Joseph Naor, Roy Schwartz:
Balanced metric labeling.
582-591
Electronic Edition (ACM DL) BibTeX
Session 12A
Session 12B
Best Student Paper
Session 14A
Session 14B
Session 15A
Session 15B
Copyright © Sat May 16 23:43:12 2009
by Michael Ley (ley@uni-trier.de)