Table of contents

  1. Front Matter
  2. Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
    Pages 1-12
  3. Ravi Boppana, Magnús M. Halldórsson
    Pages 13-25
  4. Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph
    Pages 26-37
  5. David Eppstein
    Pages 38-47
  6. Goos Kant, Jan van Leeuwen
    Pages 48-59
  7. Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec
    Pages 71-84
  8. Michel Pocchiola
    Pages 85-96
  9. Arne Andersson, Tony W. Lai
    Pages 111-121
  10. Samuel W. Bent
    Pages 132-142
  11. Ricardo Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani
    Pages 143-159
  12. Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
    Pages 160-172
  13. Paul F. Dietz, Ju Zhang
    Pages 173-180
  14. Christos Levcopoulos, Ola Petersson
    Pages 181-191
  15. Dana S. Richards, Jeffrey S. Salowe
    Pages 201-212
  16. Mark de Berg, Marc van Kreveld, Bengt J. Nilsson, Mark H. Overmars
    Pages 213-224
  17. Joseph Friedman, John Hershberger, Jack Snoeyink
    Pages 225-237
  18. Christos Levcopoulos, Andrzej Lingas
    Pages 238-250
  19. Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon
    Pages 251-263
  20. David Fernández-Baca
    Pages 264-275
  21. N. M. Korneenko, H. Martini
    Pages 276-286
  22. David S. Johnson
    Pages 287-287
  23. Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Pages 288-300
  24. Hans L. Bodlaender, Rolf H. Möhring
    Pages 301-309
  25. Stefan Arnborg, Andrzej Proskurowski
    Pages 310-319
  26. David Fernández-Baca, Mark A. Williams
    Pages 320-331
  27. Ricardo Baeza-Yates, Mireille Régnier
    Pages 332-347
  28. Jorma Tarhio, Esko Ukkonen
    Pages 348-359
  29. John Hershberger
    Pages 368-379
  30. John Hershberger, Subhash Suri
    Pages 380-392
  31. Marc van Kreveld, Mark Overmars, Pankaj K. Agarwal
    Pages 393-403
  32. Haijo Schipper, Mark H. Overmars
    Pages 404-417

About these proceedings


This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on the design and complexity analysis of: data structures, text algorithms, and sequential and parallel algorithms for graph problems and for geometric problems. Examples of tech- niques presented include: - efficient ways to find approximation algorithms for the maximum independent set problem and for graph coloring; - exact estimation of the expected search cost for skip lists; - construction of canonical representations of partial 2-trees and partial 3-trees in linear time; - efficient triangulation of planar point sets and convex polygons.


Algorithmus Approximation Datenstrukturen Graph Komplexität algorithms complexity computational geometry data structures graph theory parallel computing

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1990
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-52846-3
  • Online ISBN 978-3-540-47164-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site