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. Session 7B

    1. Approximation Algorithms for Some Parameterized Counting Problems

      • V. Arvind, Venkatesh Raman
      Pages 453-464

    2. Approximating MIN k-SAT

      • Adi Avidor, Uri Zwick
      Pages 465-475

    3. Average-Case Competitive Analyses for Ski-Rental Problems

      • Hiroshi Fujiwara, Kazuo Iwama
      Pages 476-488

  2. Session 8A

    1. On the Clique Problem in Intersection Graphs of Ellipses

      • Christoph Ambühl, Uli Wagner
      Pages 489-500

    2. A Geometric Approach to Boolean Matrix Multiplication

      • Andrzej Lingas
      Pages 501-510

    3. The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing

      • Evanthia Papadopoulou, D.T. Lee
      Pages 511-522

  3. Session 8B

    1. Improved Distance Oracles for Avoiding Link-Failure

      • Rezaul Alam Chowdhury, Vijaya Ramachandran
      Pages 523-534

    2. Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks

      • Tomasz JurdziÅ„ski, Grzegorz Stachowiak
      Pages 535-549

    3. A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm

      • Vivek Shikaripura, Ajay D. Kshemkalyani
      Pages 550-562

  4. Session 9A

    1. Crossing Minimization for Symmetries

      • Christoph Buchheim, Seok Hee Hong
      Pages 563-574

    2. Simultaneous Embedding of a Planar Graph and Its Dual on the Grid

      • Cesim Erten, Stephen G. Kobourov
      Pages 575-587

    3. Meaningful Information

      • Paul Vitányi
      Pages 588-599

  5. Session 9B

    1. Optimal Clearing of Supply/Demand Curves

      • Tuomas Sandholm, Subhash Suri
      Pages 600-611

    2. Partitioning Trees of Supply and Demand

      • Takehiro Ito, Xiao Zhou, Takao Nishizeki
      Pages 612-623

    3. Maximizing a Voronoi Region: The Convex Case

      • Frank Dehne, Rolf Klein, Raimund Seidel
      Pages 624-634

  6. Invited Talks

    1. Random Tries

      • Luc Devroye
      Pages 635-635

    2. Expected Acceptance Counts for Finite Automata with Almost Uniform Input

      • Nie Holas Pippenger
      Pages 636-646

    3. Monotone Drawings of Planar Graphs

      • János Pach, Gézá Tóth
      Pages 647-653

  7. Back Matter

    Pages 655-656
    Download chapter PDF
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