Algorithm Engineering

4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings

  • Stefan Näher
  • Dorothea Wagner
Conference proceedings WAE 2000

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1982)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Invited Lectures

  3. Contributed Papers

    1. Susanne Albers, Bianca Schröder
      Pages 11-22
    2. Stefan Edelkamp, Patrick Stiegeler
      Pages 39-50
    3. Lars Arge, Jeff Chase, Jeffrey S. Vitter, Rajiv Wickremesinghe
      Pages 51-62
    4. Werner Backes, Susanne Wetzel
      Pages 63-73
    5. Javed Aslam, Alain Leblanc, Clifford Stein
      Pages 74-86
    6. Annegret Liebers, Karsten Weihe
      Pages 87-98
    7. Isabelle Guérin Lassous, Jens Gustedt
      Pages 111-122
    8. Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto
      Pages 123-134
    9. Camil Demetrescu, Irene Finocchi, Giuseppe Liotta
      Pages 147-158
    10. Jesper Bojesen, Jyrki Katajainen
      Pages 159-170
    11. Jan Vahrenhold, Klaus H. Hinrichs
      Pages 183-194
    12. Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
      Pages 218-229
    13. Massimiliano Caramia, Paolo Dell’Olmo, Giuseppe F. Italiano
      Pages 230-241
  4. Back Matter
    Pages 243-243

About these proceedings


This volume contains the papers accepted for the 4th Workshop on Algorithm Engineering (WAE 2000) held in Saarbruc ¨ ken, Germany, during 5–8 September 2000, together with the abstract of the invited lecture given by Karsten Weihe. The Workshop on Algorithm Engineering covers research on all aspects of the subject. The goal is to present recent research results and to identify and explore directions for future research. Previous meetings were held in Venice (1997), Saarbruc ¨ ken (1998), and London (1999). Papers were solicited describing original research in all aspects of algorithm engineering, including: – Development of software repositories and platforms which allow the use of and experimentation with e?cient discrete algorithms. – Novel uses of discrete algorithms in other disciplines and the evaluation of algorithms for realistic environments. – Methodological issues including standards in the context of empirical - search on algorithms and data structures. – Methodological issues regarding the process of converting user requirements into e?cient algorithmic solutions and implementations. The program committee accepted 16 from a total of 30 submissions. The program committee meeting was conducted electronically. The criteria for sel- tion were originality, quality, and relevance to the subject area of the workshop. Considerable e?ort was devoted to the evaluation of the submissions and to p- viding the authors with feedback. Each submission was reviewed by at least four program committee members (assisted by subreferees). A special issue of the ACM Journal of Experimental Algorithmics will be devoted to selected papers from WAE 2000.


algorithm engineering algorithms approximation combinatorial optimization complexity computational mathematics data structures discrete algorithms experimental algorithms graph algorithms searching sorting string matching

Editors and affiliations

  • Stefan Näher
    • 1
  • Dorothea Wagner
    • 2
  1. 1.Universität Trier, Fachbereich IV — InformatikTrierGermany
  2. 2.Fakultät für Mathematik und InformatikUniversität KonstanzKonstanzGermany

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42512-0
  • Online ISBN 978-3-540-44691-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Finance, Business & Banking
Energy, Utilities & Environment