Skip to main content
SpringerLink
Log in

Algorithms and Computation

13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings

  • Conference proceedings
  • © 2002

Overview

Editors:
  1. Prosenjit Bose

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Pat Morin

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

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

Included in the following conference series:

Conference proceedings info: ISAAC 2002.

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

  1. Front Matter

    Pages I-XIII
    Download chapter PDF

  2. Session 1A

    1. Biased Skip Lists

      • Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
      Pages 1-13

    2. Space-Efficient Data Structures for Flexible Text Retrieval Systems

      • Kunihiko Sadakane
      Pages 14-24

    3. Key Independent Optimality

      • John Iacono
      Pages 25-31

  3. On the Comparison-Addition Complexity of All-Pairs Shortest Paths

    1. On the Comparison-Addition Complexity of All-Pairs Shortest Paths

      • Seth Pettie
      Pages 32-43

  4. On the Clique-Width of Graphs in Hereditary Classes

    1. On the Clique-Width of Graphs in Hereditary Classes

      • Rodica Boliac, Vadim Lozin
      Pages 44-54

  5. The Probability of a Rendezvous Is Minimal in Complete Graphs

    1. The Probability of a Rendezvous Is Minimal in Complete Graphs

      • Martin Dietzfelbinger
      Pages 55-66

  6. On the Minimum Volume of a Perturbed Unit Cube

    1. On the Minimum Volume of a Perturbed Unit Cube

      • Jin-Yi Cai
      Pages 67-78

  7. Non-Delaunay-Based Curve Reconstruction

    1. Non-Delaunay-Based Curve Reconstruction

      • Sumanta Guha, Paula Josiah, Anoop Mittal, Son Dinh Tran
      Pages 79-90

  8. Cutting a Country for Smallest Square Fit

    1. Cutting a Country for Smallest Square Fit

      • Marc van Kreveld, Bettina Speckmann
      Pages 91-102

  9. On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter

    1. On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter

      • Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun
      Pages 103-114

  10. Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement

    1. Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement

      • Hirotada Kobayashi, Keiji Matsumoto
      Pages 115-127

  11. Some Remarks on the L-Conjecture

    1. Some Remarks on the L-Conjecture

      • Qi Cheng
      Pages 128-136

  12. Session 3A

    1. A Framework for Network Reliability Problems on Graphs of Bounded Treewidth

      • Thomas Wolle
      Pages 137-149

    2. A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation

      • Anna Galluccio, Guido Proietti
      Pages 150-162

    3. Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems

      • A. Brandstädt, F.F. Dragan, H.-O. Le, V.B. Le
      Pages 163-174

  14. Session 4A

    1. Queaps

      • John Iacono, Stefan Langerman2
      Pages 211-218
Back to top

Other volumes

  1. Algorithms and Computation

Keywords

Editors and Affiliations

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

    Prosenjit Bose, Pat Morin

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation