Advertisement

Table of contents

  1. Front Matter
  2. Yosi Ben-Asher, Dan Gordon, Assaf Schuster
    Pages 25-36
  3. Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia
    Pages 37-48
  4. S. N. Bhatt, G. Bilardi, G. Pucci, A. Ranade, A. L. Rosenberg, E. J. Schwabe
    Pages 49-60
  5. Robert F. Cohen, Roberto Tamassia
    Pages 97-108
  6. Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack
    Pages 109-120
  7. Mark de Berg, Marc van Kreveld
    Pages 121-132
  8. J. Díaz, M. J. Serna, J. Torán
    Pages 145-156
  9. Michael R. Fellows, Michael T. Hallett, H. Todd Wareham
    Pages 157-168
  10. Philippe Flajolet, Paul Zimmermann, Bernard van Cutsem
    Pages 169-180
  11. O. Gerstel, S. Zaks
    Pages 181-191
  12. Johann Hagauer, Günter Rote
    Pages 192-199
  13. Juraj Hromkovič, Ralf Klasing, Elena A. Stöhr, Hubert Wagener
    Pages 200-211
  14. Giuseppe F. Italiano, Johannes A. La Poutré, Monika H. Rauch
    Pages 212-223
  15. Zoran Ivković, Errol L. Lloyd
    Pages 224-235
  16. Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
    Pages 248-259
  17. T. Kloks, H. Bodlaender, H. Müller, D. Kratsch
    Pages 260-271
  18. Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman
    Pages 284-294
  19. Ernst W. Mayr, Ralph Werchner
    Pages 295-305
  20. Mike Paterson
    Pages 306-308
  21. Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman
    Pages 333-344
  22. Klaus Simon, Davide Crippa, Fabian Collenberg
    Pages 345-356
  23. Alexander Schrijver
    Pages 357-359
  24. Anand Srivastav, Peter Stangier
    Pages 360-371
  25. Dorothea Wagner, Karsten Weihe
    Pages 384-395
  26. Xiao Zhou, Shin-ichi Nakano, Takao Nishizeki
    Pages 409-418
  27. Back Matter

About these proceedings

Introduction

Symposium on Algorithms (ESA '93), held in Bad Honnef, near Boon, in Germany, September 30 - October 2, 1993. The symposium is intended to launchan annual series of international conferences, held in early fall, covering the field of algorithms. Within the scope of the symposium lies all research on algorithms, theoretical as well as applied, that is carried out in the fields of computer science and discrete applied mathematics. The symposium aims to cater to both of these research communities and to intensify the exchange between them. The volume contains 35 contributed papers selected from 101 proposals submitted in response to the call for papers, as well as three invited lectures: "Evolution of an algorithm" by Michael Paterson, "Complexity of disjoint paths problems in planar graphs" by Alexander Schrijver, and "Sequence comparison and statistical significance in molecular biology" by Michael S. Waterman.

Keywords

Algorithmen Algorithms Combinatorics Discrete Mathematics Graphs Kombinatorik Komplexität STATISTICA algorithm complexity computer computer science

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-57273-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 1993
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-57273-2
  • Online ISBN 978-3-540-48032-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site