Skip to main content
SpringerLink
Log in

Algorithms and Data Structures

5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Frank Dehne
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Andrew Rau-Chaplin
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jörg-Rüdiger Sack
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Roberto Tamassia
    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 1272)

Included in the following conference series:

Conference proceedings info: WADS 1997.

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

  1. Front Matter

    Download chapter PDF

  2. Discrepancy theory and computational geometry

    • Bernard Chazelle
    Pages 1-2

  3. Dynamic motion planning in low obstacle density environments

    • Robert-Paul Berretty, Mark Overmars, A. Frank van der Stappen
    Pages 3-16

  4. Visibility-based pursuit-evasion in a polygonal environment

    • Leonidas J. Guibas, Jean-Claude Latombe, Steven M. Lavalle, David Lin, Rajeev Motwani
    Pages 17-30

  5. Maintaining the extent of a moving point set

    • Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach
    Pages 31-44

  6. Finding cores of limited length

    • Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup
    Pages 45-54

  7. On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem

    • Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrt'o
    Pages 55-68

  8. Approximation algorithms for a genetic diagnostics problem

    • S. Rao Kosaraju, Alejandro A. Schäffer, Leslie G. Biesecker
    Pages 69-92

  9. Cartographic line simplication and polygon CSG formulae in O(n log* n) time

    • John Hershberger, Jack Snoeyink
    Pages 93-103

  10. Constrained TSP and low-power computing

    • Moses Charikar, Rajeev Motwani, Prabhakar Raghavan, Craig Silverstein
    Pages 104-115

  11. On-line load balancing for related machines

    • Piotr Berman, Moses Charikar, Marek Karpinski
    Pages 116-125

  12. A linear-time algorithm for the 1-mismatch problem

    • Nikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross Hardison, Webb Miller
    Pages 126-135

  13. On some geometric optimization problems in layered manufacturing

    • Jayanth Majhi, Ravi Janardan, Michiel Smid, Prosenjit Gupta
    Pages 136-149

  14. New TSP construction heuristics and their relationships to the 2-opt

    • Hiroyuki Okano, Shinji Misono, Kazuo Iwano
    Pages 150-159

  15. Pattern matching in hypertext

    • Amihood Amir, Moshe Lewenstein, Noa Lewenstein
    Pages 160-173

  16. Multiple approximate string matching

    • Ricardo Baeza-Yates, Gonzalo Navarro
    Pages 174-184

  17. Applied computational geometry — Abstract

    • David P. Dobkin
    Pages 185-185

  18. Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)

    • O. Devillers, G. Liotta, F. P. Preparata, R. Tamassia
    Pages 186-199

  19. Voronoi diagrams for polygon-offset distance functions

    • Gill Barequet, Matthew T. Dickerson, Michael T. Goodrich
    Pages 200-209

  20. Randomized algorithms for that ancient scheduling problem

    • Steve Seiden
    Pages 210-223
Back to top

Other volumes

  1. Algorithms and Data Structures

Keywords

About this book

This book constitutes the refereed proceedings of the 5th International Workshop on Algorithms and Data Structures, WADS'97, held in Nova Scotia, Halifax, Canada, in August 1997.
The 37 revised full papers presented were carefully selected from a total of 81 submissions. Also included are four abstracts and one full contribution corresponding to the invited talks. Among the topics covered are data structures and algorithmic aspects in a variety of areas like computational geometry, graph theory, networking, load balancing, optimization, approximation, sorting, pattern matching, etc.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation