Skip to main content
  • Conference proceedings
  • © 2005

Algorithms and Data Structures

9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): WADS: Algorithms and Data Structures Symposium

Conference proceedings info: WADS 2005.

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

  1. Front Matter

  2. Session 1

    1. Towards a Theory of Algorithms

      • Allan Borodin
      Pages 1-1
  3. Session 2A

    1. k-Restricted Rotation with an Application to Search Tree Rebalancing

      • Alejandro Almeida Ruiz, Fabrizio Luccio, Antonio Mesa Enriquez, Linda Pagli
      Pages 2-13
    2. Heap Building Bounds

      • Zhentao Li, Bruce A. Reed
      Pages 14-23
  4. Session 2B

    1. The Multi-radius Cover Problem

      • Refael Hassin, Danny Segev
      Pages 24-35
    2. Parameterized Complexity of Generalized Vertex Cover Problems

      • Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
      Pages 36-48
    3. The Complexity of Implicit and Space Efficient Priority Queues

      • Christian W. Mortensen, Seth Pettie
      Pages 49-60
    4. Balanced Aspect Ratio Trees Revisited

      • Amitabh Chaudhary, Michael T. Goodrich
      Pages 73-85
  5. Session 3B

    1. Improved Combinatorial Group Testing for Real-World Problem Sizes

      • David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
      Pages 86-98
    2. Parameterized Counting Algorithms for General Graph Covering Problems

      • Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
      Pages 99-109
  6. Session 4A

    1. Max-stretch Reduction for Tree Spanners

      • Kazuo Iwama, Andrzej Lingas, Masaki Okita
      Pages 122-133
    2. Succinct Representation of Triangulations with a Boundary

      • L. Castelli Aleardi, Olivier Devillers, Gilles Schaeffer
      Pages 134-145
    3. Line-Segment Intersection Made In-Place

      • Jan Vahrenhold
      Pages 146-157
  7. Session 4B

    1. Improved Fixed-Parameter Algorithms for Two Feedback Set Problems

      • Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
      Pages 158-168
    2. Communication-Aware Processor Allocation for Supercomputers

      • Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer et al.
      Pages 169-181
    3. Dynamic Hotlinks

      • Karim Douïeb, Stefan Langerman
      Pages 182-194
  8. Session 6A

    1. The Minimum-Area Spanning Tree Problem

      • Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
      Pages 195-204
    2. Hinged Dissection of Polypolyhedra

      • Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine
      Pages 205-217

Other Volumes

  1. Algorithms and Data Structures

Editors and Affiliations

  • Carleton University, Ottawa, Canada

    Frank Dehne

  • Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada

    Alejandro López-Ortiz

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

    Jörg-Rüdiger Sack

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