Table of contents

  1. Front Matter
  2. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
    Pages 1-8
  3. Rudolf Fleischer, Gerhard Trippen
    Pages 11-22
  4. Georg Kliewer, Larissa Timajev
    Pages 47-58
  5. Konstantinos Daskalakis, Christos H. Papadimitriou
    Pages 71-82
  6. Bruno Codenotti, Benton McCune, Rajiv Raman, Kasturi Varadarajan
    Pages 83-94
  7. Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
    Pages 95-106
  8. Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi
    Pages 119-130
  9. Iris Reinbacher, Marc Benkert, Marc van Kreveld, Joseph S. B. Mitchell, Alexander Wolff
    Pages 143-154
  10. Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn et al.
    Pages 155-166
  11. Refael Hassin, Einat Or
    Pages 167-178
  12. Zhi-Zhong Chen, Takayuki Nagoya
    Pages 179-190
  13. Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina
    Pages 191-202

About these proceedings

Keywords

Erfüllbarkeitsproblem der Aussagenlogik Scheduling algorithm algorithm analysis algorithm design algorithmic mathematics algorithmics algorithms algorithms theory approximation combinatorial optimization complexity computational complexity convex hull sorting

Editors and affiliations

  • Gerth Stølting Brodal
    • 1
  • Stefano Leonardi
    • 2
  1. 1.BRICS, MADALGO, Department of Computer ScienceUniversity of AarhusDenmark
  2. 2.University of Rome “La Sapienza”RomeItaly

Bibliographic information

  • DOI https://doi.org/10.1007/11561071
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-29118-3
  • Online ISBN 978-3-540-31951-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book