Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1989

Algorithms and Data Structures

Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings

Editors:

  1. F. Dehne
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. J. -R. Sack
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. N. Santoro
    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 382)

Sections

Buy it now

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

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

Table of contents (49 papers)

  2. Stabbing parallel segments with a convex polygon

    • Michael T. Goodrich, Jack Scott Snoeyink
    Pages 231-242

  3. Selecting the Kth largest-area convex polygon

    • Jeffrey S. Salowe
    Pages 243-250

  4. Finding All Shortest Path Edge Sequences on a convex polyhedron

    • Yie-Huei Hwang, Ruei-Chuan Chang, Hung-Yi Tu
    Pages 251-266

  6. NC algorithms for circular-arc graphs

    • Lin Chen
    Pages 291-302

  8. Galleries, light matchings and visibility graphs

    • Jurek Czyzowicz, Ivan Rival, Jorge Urrutia
    Pages 316-324

  9. Weighted visibility graphs of bars and related flow problems

    • David G. Kirkpatrick, Stephen K. Wismath
    Pages 325-334

  10. Parallel algorithms for cographs recognition and applications

    • Gur Saran Adhar, Shietung Peng
    Pages 335-351

  11. Dynamic data structures for series parallel digraphs

    • Giuseppe F. Italiano, Alberto Marchetti Spaccamela, Umberto Nanni
    Pages 352-372

  12. Motion planning in the CL-environment

    • Chee-Keng Yap, Helmut Alt
    Pages 373-380

  13. Self-adjusting k-ary search trees

    • Murray Sherk
    Pages 381-392

  15. An efficient all-parses systolic algorithm for general context-free parsing

    • Oscar H. Ibarra, Michael A. Palis
    Pages 403-419

  18. A fast algorithm for melding splay trees

    • Graeme Port, Alistair Moffat
    Pages 450-459

  20. Complexity issues in tree-based version control

    • Naomi Nishimura
    Pages 472-486
Back to top

About this book

This book contains the papers presented at the 1989 Workshop on Algorithms and Data Structures, which succeeds the 1988 Scandinavian Workshop on Algorithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching.
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation