Table of contents

  1. Front Matter
    Pages I-XI
  2. Tutorials

  3. Invited Talks

    1. Charles E. Leiserson
      Pages 5-5
    2. Michael O. Rabin
      Pages 7-10
    3. John E. Savage
      Pages 11-11
  4. Regular Contribution

    1. Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman
      Pages 12-23
    2. Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis
      Pages 24-35
    3. Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
      Pages 36-45
    4. Bala Kalyanasundaram, Mahe Velauthapillai, John Waclawsky
      Pages 46-57
    5. Joan Boyar, Lene M. Favrholdt
      Pages 58-69
    6. Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, Prudence W. H. Wong
      Pages 70-82
    7. Victor D. Chepoi, Feodor F. Dragan, Chenyu Yan
      Pages 96-107
    8. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
      Pages 108-119
    9. Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi
      Pages 120-131

About these proceedings

Keywords

algorithms combinatorial optimization combinatorics complexity complexity theory computational geometry computational graph theory geometric algorithms graph algorithms graph computations network algorithms optimization routing scheduling

Editors and affiliations

  • Rossella Petreschi
    • 1
  • Giuseppe Persiano
    • 2
  • Riccardo Silvestri
    • 1
  1. 1.Dipartimento di InfornaticaUniversità di Roma “La Sapienza”RomeItaly
  2. 2.Dipartimento di Infornatica ed Applicazioni “R.M. Capocelli”Università di SalernoBaronissi, SAItaly

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-44849-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-40176-6
  • Online ISBN 978-3-540-44849-5
  • Series Print ISSN 0302-9743
  • About this book