Efficient Algorithms

Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday

  • Susanne Albers
  • Helmut Alt
  • Stefan Näher

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

Table of contents

  1. Front Matter
  2. Models of Computation and Complexity

    1. Front Matter
      Pages 1-1
    2. Norbert Blum
      Pages 18-29
    3. Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl
      Pages 30-54
    4. Ulan Degenbaev, Wolfgang J. Paul, Norbert Schirmer
      Pages 74-98
  3. Sorting and Searching

  4. Combinatorial Optimization with Applications

    1. Front Matter
      Pages 171-171
    2. Susanne Albers
      Pages 173-186
    3. Naveen Garg
      Pages 187-198
    4. Ernst Althaus, Gunnar W. Klau, Oliver Kohlbacher, Hans-Peter Lenhof, Knut Reinert
      Pages 199-218
    5. Ulrich Meyer
      Pages 219-232
  5. Computational Geometry and Geometric Graphs

    1. Front Matter
      Pages 233-233
    2. Tetsuo Asano, Sergey Bereg, David Kirkpatrick
      Pages 249-260
    3. Stefan Näher, Daniel Schmitt
      Pages 261-274
    4. Michael Kaufmann
      Pages 290-304
  6. Algorithm Engineering, Exactness, and Robustness

    1. Front Matter
      Pages 319-319
    2. Hannah Bast
      Pages 355-367
    3. Rudolf Fleischer
      Pages 368-379
    4. Chee K. Yap
      Pages 380-407
    5. Stefan Schirra
      Pages 408-421
    6. Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm
      Pages 422-437
  7. Back Matter

About this book


This Festschrift volume, published in honor of Kurt Mehlhorn on the occasion of his 60th birthday, contains 28 papers written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Bob Constable.

The volume's title is a translation of the title of Kurt Mehlhorn's first book, "Effiziente Algorithmen", published by Teubner-Verlag in 1977. This Festschrift demonstrates how the field of algorithmics has developed and matured in the decades since then.

The papers included in this volume are organized in topical sections on models of computation and complexity; sorting and searching; combinatorial optimization with applications; computational geometry and geometric graphs; and algorithm engineering, exactness and robustness.


algorithms boolean networks combinatorial optimization complexity computational biology computational geometry energy saving geometric algorithms golomb rulers knowledge discovery kolmogorov-complexity optimization satisfiability search trees shortest paths

Editors and affiliations

  • Susanne Albers
    • 1
  • Helmut Alt
    • 2
  • Stefan Näher
    • 3
  1. 1.Institut für InformatikUniversität FreiburgFreiburgGermany
  2. 2.Institut für InformatikFreie Universität BerlinBerlinGermany
  3. 3.Fachbereich IV - InformatikUniversität TrierTrierGermany

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-03455-8
  • Online ISBN 978-3-642-03456-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
IT & Software