Skip to main content
  • Conference proceedings
  • © 2003

Algorithms and Data Structures

8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings

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

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

Conference proceedings info: WADS 2003.

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

  1. Multi-way Space Partitioning Trees

    • Christian A. Duncan
    Pages 219-230
  2. Cropping-Resilient Segmented Multiple Watermarking

    • Keith Frikken, Mikhail Atallah
    Pages 231-242
  3. On Simultaneous Planar Graph Embeddings

    • P. Brass, E. Cenek, C. A. Duncan, A. Efrat, C. Erten, D. Ismailescu et al.
    Pages 243-255
  4. Smoothed Analysis

    • Daniel A. Spielman, Shang-Hua Teng
    Pages 256-270
  5. Approximation Algorithm for Hotlink Assignments in Web Directories

    • Rachel Matichin, David Peleg
    Pages 271-280
  6. Drawing Graphs with Large Vertices and Thick Edges

    • Gill Barequet, Michael T. Goodrich, Chris Riley
    Pages 281-293
  7. Semi-matchings for Bipartite Graphs and Load Balancing

    • Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
    Pages 294-306
  8. Sorting Circular Permutations by Reversal

    • Andrew Solomon, Paul Sutcliffe, Raymond Lister
    Pages 319-328
  9. Dynamic Text and Static Pattern Matching

    • Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol
    Pages 340-352
  10. Real Two Dimensional Scaled Matching

    • Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat
    Pages 353-364
  11. Proximity Structures for Geometric Graphs

    • Sanjiv Kapoor, Xiang-Yang Li
    Pages 365-376
  12. The Zigzag Path of a Pseudo-Triangulation

    • Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu
    Pages 377-388
  13. Alternating Paths along Orthogonal Segments

    • Csaba D. Tóth
    Pages 389-400
  14. Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem

    • Marek Karpinski, Ion I. Măndoiu, Alexander Olshevsky, Alexander Zelikovsky
    Pages 401-411
  15. Chips on Wafers

    • Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Pages 412-423
  16. A Model for Analyzing Black-Box Optimization

    • Vinhthuy Phan, Steven Skiena, Pavel Sumazin
    Pages 424-438
  17. Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries

    • David Bremner, Erik Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin et al.
    Pages 451-461

Other Volumes

  1. Algorithms and Data Structures

Editors and Affiliations

  • Carleton University, Ottawa, Canada

    Frank Dehne

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

    Jörg-Rüdiger Sack, Michiel Smid

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