Skip to main content
SpringerLink
Log in
Book cover

Algorithms and Complexity

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

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. Rossella Petreschi

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Giuseppe Persiano

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Riccardo Silvestri

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

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

Included in the following conference series:

Conference proceedings info: CIAC 2003.

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

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  3. Invited Talks

    1. Cache-Oblivious Algorithms

      • Charles E. Leiserson
      Pages 5-5

    2. Spanning Trees with Low Maximum/Average Stretch

      • David Peleg
      Pages 6-6

    3. Hyper Encryption and Everlasting Secrets

      • Michael O. Rabin
      Pages 7-10

    4. Computing with Electronic Nanotechnologies

      • John E. Savage
      Pages 11-11

  4. 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. Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs

      • William Duckworth, Bernard Mans
      Pages 83-95

    8. Additive Spanners for k-Chordal Graphs

      • Victor D. Chepoi, Feodor F. Dragan, Chenyu Yan
      Pages 96-107

    9. Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation

      • Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
      Pages 108-119

    10. Reconciling Gene Trees to a Species Tree

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

    11. Generating All Forest Extensions of a Partially Ordered Set

      • Jayme L. Szwarcfiter
      Pages 132-139
Back to top

Other volumes

  1. Algorithms and Complexity

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation