Skip to main content
  • Conference proceedings
  • © 2001

Algorithms and Data Structures

7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings

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

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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 (43 papers)

  1. Front Matter

    Pages I-XII
  2. Session 1 - Invited Talk

  3. Session 2A

    1. Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs

      • Ferran Hurtado, Giuseppe Liotta, Henk Meijer
      Pages 2-13
  4. Session 2B

    1. On the Complexity of Scheduling Conditional Real-Time Code

      • Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele
      Pages 38-49
  5. Session 3A

    1. Time Responsive External Data Structures for Moving Points

      • Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold
      Pages 50-61
    2. Voronoi Diagrams for Moving Disks and Applications

      • Menelaos I. Karavelas
      Pages 62-74
  6. Session 3B

    1. Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover

      • Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
      Pages 75-86
    2. Deciding Clique-Width for Graphs of Bounded Tree-Width

      • Wolfgang Espelage, Frank Gurski, Egon Wanke
      Pages 87-98
  7. Session 4A

    1. Optimization over Zonotopes and Training Support Vector Machines

      • Marshall Bern, David Eppstein
      Pages 111-121
    2. Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions

      • Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
      Pages 122-134
  8. Session 4B

    1. Seller-Focused Algorithms for Online Auctioning

      • Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar
      Pages 135-147
    2. Competitive Analysis of the LRFU Paging Algorithm

      • Edith Cohen, Haim Kaplan, Uri Zwick
      Pages 148-154
    3. Admission Control to Minimize Rejections

      • Avrim Blum, Adam Kalai, Jon Kleinberg
      Pages 155-164
  9. Session 5 - Invited Talk

    1. Secure Multi-party Computational Geometry

      • Mikhail J. Atallah, Wenliang Du
      Pages 165-179
  10. Session 6A

    1. The Grid Placement Problem

      • Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison
      Pages 180-191
    2. On the Reflexivity of Point Sets

      • Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán et al.
      Pages 192-204
  11. Session 6B

    1. A 7/8-Approximation Algorithm for Metric Max TSP

      • Refael Hassin, Shlomi Rubinstein
      Pages 205-209

Editors and Affiliations

  • School of Computer Science, Carleton University, Ottawa, Candada

    Frank Dehne, Jörg-Rüdiger Sack

  • Center for Geometric Computing, Brown University, Providence, USA

    Roberto Tamassia

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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