Skip to main content
SpringerLink
Log in

SWAT '88

1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings

  • Conference proceedings
  • © 1988

Overview

Editors:
  1. Rolf Karlsson
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Andrzej Lingas
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 papers)

  1. Searching with uncertainty extended abstract

    • Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins
    Pages 176-189

  2. An optimal expected-time parallel algorithm for Voronoi diagrams

    • Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas
    Pages 190-198

  3. Generating binary trees by transpositions

    • Andrzej Proskurowski, Frank Ruskey
    Pages 199-207

  4. Approximating the complete Euclidean graph

    • J. Mark Keil
    Pages 208-213

  5. Upper and lower bounds for the dictionary problem

    • M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert
    Pages 214-215

  6. Linear algorithms for graph separation problems

    • Hristo N. Djidjev
    Pages 216-222

  7. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

    • Hans L. Bodlaender
    Pages 223-232

  8. NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems

    • Vijay V. Vazirani
    Pages 233-242

  9. Independent covers in outerplanar graphs

    • Maciej M. Syslo, PaweÅ‚ Winter
    Pages 243-254

  10. Tight lower bounds for Shellsort

    • Mark Allen Weiss, Robert Sedgewick
    Pages 255-262
Back to top

Keywords

About this book

The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation