Skip to main content
  • Conference proceedings
  • © 2003

Algorithms and Complexity

5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings

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

Conference series link(s): CIAC: International Conference on Algorithms and Complexity

Conference proceedings info: CIAC 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 (31 papers)

  1. Front Matter

    Pages I-XI
  2. Invited Talks

    1. Cache-Oblivious Algorithms

      • Charles E. Leiserson
      Pages 5-5
    2. Hyper Encryption and Everlasting Secrets

      • Michael O. Rabin
      Pages 7-10
    3. Computing with Electronic Nanotechnologies

      • John E. Savage
      Pages 11-11
  3. Regular Contribution

    1. Efficient Update Strategies for Geometric Computing with Uncertainty

      • Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman
      Pages 12-23
    2. Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete

      • Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis
      Pages 24-35
    3. An Improved Algorithm for Point Set Pattern Matching under Rigid Motion

      • Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
      Pages 36-45
    4. Unlocking the Advantages of Dynamic Service Selection and Pricing

      • Bala Kalyanasundaram, Mahe Velauthapillai, John Waclawsky
      Pages 46-57
    5. The Relative Worst Order Ratio for On-Line Algorithms

      • Joan Boyar, Lene M. Favrholdt
      Pages 58-69
    6. On-Line Stream Merging, Max Span, and Min Coverage

      • Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, Prudence W. H. Wong
      Pages 70-82
    7. Additive Spanners for k-Chordal Graphs

      • Victor D. Chepoi, Feodor F. Dragan, Chenyu Yan
      Pages 96-107
    8. Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation

      • Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
      Pages 108-119
    9. Reconciling Gene Trees to a Species Tree

      • Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi
      Pages 120-131

Other Volumes

  1. Algorithms and Complexity

Editors and Affiliations

  • Dipartimento di Infornatica, Università di Roma “La Sapienza”, Rome, Italy

    Rossella Petreschi, Riccardo Silvestri

  • Dipartimento di Infornatica ed Applicazioni “R.M. Capocelli”, Università di Salerno, Baronissi, SA, Italy

    Giuseppe Persiano

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