Skip to main content
SpringerLink
Log in

Algorithms and Data Structures

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

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Frank Dehne

    1. School of Computer Science, Carleton University, Ottawa, Candada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jörg-Rüdiger Sack

    1. School of Computer Science, Carleton University, Ottawa, Candada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Roberto Tamassia

    1. Center for Geometric Computing, Brown University, Providence, USA

    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 2125)

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (43 papers)

  1. Session 6B

    1. Approximating Multi-objective Knapsack Problems

      • Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
      Pages 210-221

  2. Session 7A

    1. Visual Ranking of Link Structures

      • Ulrik Brandes, Sabine Cornelsen
      Pages 222-233

    2. A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs

      • Xin He
      Pages 234-245

  3. Session 7B

    1. Short and Simple Labels for Small Distances and Other Functions

      • Haim Kaplan, Tova Milo
      Pages 246-257

    2. Fast Boolean Matrix Multiplication for Highly Clustered Data

      • Andreas Björklund, Andrzej Lingas
      Pages 258-263

  4. Session 8A

    1. Partitioning Colored Point Sets into Monochromatic Parts

      • Adrian Dumitrescu, János Pach
      Pages 264-275

    2. The Analysis of a Probabilistic Approach to Nearest Neighbor Searching

      • Songrit Maneewongvatana, David M. Mount
      Pages 276-286

    3. I/O-Efficient Shortest Path Queries in Geometric Spanners

      • Anil Maheshwari, Michiel Smid, Norbert Zeh
      Pages 287-299

  5. Session 8B

    1. Higher-Dimensional Packing with Order Constraints

      • Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich
      Pages 300-312

    2. Bin Packing with Item Fragmentation

      • Nir Menakerman, Raphael Rom
      Pages 313-324

    3. Practical Approximation Algorithms for Separable Packing Linear Programs

      • Feodor F. Dragan, Andrew B. Kahng, Ion I. Măndoiu, Sudhakar Muddu, Alexander Zelikovsky
      Pages 325-337

  6. Session 9 - Invited Talk

    1. The Challenges of Delivering Content on the Internet

      • F. Thomson Leighton
      Pages 338-338

  7. Session 10A

    1. Upward Embeddings and Orientations of Undirected Planar Graphs

      • Walter Didimo, Maurizio Pizzonia
      Pages 339-351

    2. An Approach for Mixed Upward Planarization

      • Markus Eiglsperger, Michael Kaufmann
      Pages 352-364

  8. Session 10B

    1. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study

      • David A. Bader, Bernard M. E. Moret, Mi Yan
      Pages 365-376

    2. Computing Phylogenetic Roots with Bounded Degrees and Errors

      • Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin
      Pages 377-388

  9. Session 11A

    1. A Decomposition-Based Approach to Layered Manufacturing

      • Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel Smid, Ram Sriram
      Pages 389-400

    2. When Can You Fold a Map?

      • Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia et al.
      Pages 401-413

  10. Session 11B

    1. Search Trees with Relaxed Balance and Near-Optimal Height

      • Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen
      Pages 414-425

    2. Succinct Dynamic Data Structures

      • Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
      Pages 426-437
Back to top

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation