Skip to main content
SpringerLink
Log in
Book cover

Algorithms and Data Structures

4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Selim G. Akl
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Frank Dehne
    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. Nicola 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 955)

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

  1. Front Matter

    Download chapter PDF

  2. Lower bounds to processor-time tradeoffs under bounded-speed message propagation

    • Gianfranco Bilardi, Franco P. Preparata
    Pages 1-12

  3. The two-line center problem from a polar view: a new algorithm and data structure

    • Jerzy W. Jaromczyk, Miroslaw Kowaluk
    Pages 13-25

  4. On some geometric selection and optimization problems via sorted matrices

    • Alex Glozman, Klara Kedem, Gregory Shpitalnik
    Pages 26-37

  5. Load balancing in quorum systems

    • Ron Holzman, Yosi Marcus, David Peleg
    Pages 38-49

  6. Balanced distributed search trees do not exist

    • Brigitte Kröll, Peter Widmayer
    Pages 50-61

  7. Two-floodlight illumination of convex polygons

    • V. Estivill-Castro, J. Urrutia
    Pages 62-73

  8. On the complexity of approximating and illuminating three-dimensional convex polyhedra

    • Gautam Das, Michael T. Goodrich
    Pages 74-85

  9. Scheduling jobs that arrive over time

    • Cynthia Phillips, Clifford Stein, Joel Wein
    Pages 86-97

  10. Dynamic algorithms for the Dyck languages

    • Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum
    Pages 98-108

  11. Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications

    • Micha Sharir
    Pages 109-121

  12. Computing a shortest watchman path in a simple polygon in polynomial-time

    • Svante Carlsson, Håkan Jonsson
    Pages 122-134

  13. Going home through an unknown street

    • Alejandro López-Ortiz, Sven Schuierer
    Pages 135-146

  14. Page migration with limited local memory capacity

    • Susanne Albers, Hisashi Koga
    Pages 147-158

  15. Randomized algorithms for metrical task systems

    • Sandy Irani, Steve Seiden
    Pages 159-170

  16. Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining

    • Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony Woo
    Pages 171-182

  17. Computing common tangents without a separating line

    • David Kirkpatrick, Jack Snoeyink
    Pages 183-193

  18. Online perfect matching and mobile computing

    • Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter
    Pages 194-205

  19. Competitive algorithms for the on-line traveling salesman

    • Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
    Pages 206-217

  20. Quadrangulations of planar sets

    • Godfried Toussaint
    Pages 218-227
Back to top

Keywords

About this book

This volume constitutes the proceedings of the Fourth International Workshop on Algorithms and Data Structures, WADS '95, held in Kingston, Canada in August 1995.
The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, scheduling, computational graph theory, and searching.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation