Skip to main content
SpringerLink
Log in
Book cover

SWAT '90

2nd Scandinavian Workshop on Algorithm Theory. Bergen, Norway, July 11-14, 1990. Proceedings

  • Conference proceedings
  • © 1990

Overview

Editors:
  1. John R. Gilbert
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Rolf Karlsson
    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 447)

Included in the following conference series:

Conference proceedings info: SWAT 1990.

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 (36 papers)

  1. Input-sensitive compliant motion in the plane

    • Joseph Friedman, John Hershberger, Jack Snoeyink
    Pages 225-237

  2. Fast algorithms for greedy triangulation

    • Christos Levcopoulos, Andrzej Lingas
    Pages 238-250

  3. Star unfolding of a polytope with applications

    • Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon
    Pages 251-263

  4. Space-sweep algorithms for parametric optimization

    • David Fernández-Baca
    Pages 264-275

  5. Approximating finite weighted point sets by hyperplanes

    • N. M. Korneenko, H. Martini
    Pages 276-286

  6. Data structures for Traveling Salesmen

    • David S. Johnson
    Pages 287-287

  7. Efficient parallel algorithms for shortest paths in planar graphs

    • Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Pages 288-300

  8. The pathwidth and treewidth of cographs

    • Hans L. Bodlaender, Rolf H. Möhring
    Pages 301-309

  9. Canonical representations of partial 2-and 3-trees

    • Stefan Arnborg, Andrzej Proskurowski
    Pages 310-319

  10. On matroids and hierarchical graphs

    • David Fernández-Baca, Mark A. Williams
    Pages 320-331

  11. Fast algorithms for two dimensional and multiple pattern matching

    • Ricardo Baeza-Yates, Mireille Régnier
    Pages 332-347

  12. Boyer-Moore approach to approximate string matching

    • Jorma Tarhio, Esko Ukkonen
    Pages 348-359

  13. Complete problems with L-samplable distributions

    • Per Grape
    Pages 360-367

  14. Upper envelope onion peeling

    • John Hershberger
    Pages 368-379

  15. Applications of a semi-dynamic convex hull algorithm

    • John Hershberger, Subhash Suri
    Pages 380-392

  16. Intersection queries in sets of disks

    • Marc van Kreveld, Mark Overmars, Pankaj K. Agarwal
    Pages 393-403

  17. Dynamic partition trees

    • Haijo Schipper, Mark H. Overmars
    Pages 404-417
Back to top

Other volumes

  1. SWAT 90

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation