Algorithms and Complexity

4th Italian Conference, CIAC 2000 Rome, Italy, March 1–3, 2000 Proceedings

  • Giancarlo Bongiovanni
  • Rossella Petreschi
  • Giorgio Gambosi
Conference proceedings CIAC 2000

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

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Invited Presentations

    1. Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela
      Pages 1-16
    2. Joshua Redstone, Walter L. Ruzzo
      Pages 32-43
    3. Shmuel Zaks
      Pages 44-58
  3. Regular Presentations

    1. W. de la Vega Fernandez
      Pages 59-62
    2. Peter Damaschke
      Pages 63-71
    3. Hans-Joachim Böckenhauer, Juraj Hromkovič, Ralf Klasing, Sebastian Seibert, Walter Unger
      Pages 72-86
    4. Fabrice Noilhan, Miklos Santha
      Pages 87-101
    5. Sebastian Seibert, Walter Unger
      Pages 102-112
    6. Gabriele Neyer, Frank Wagner
      Pages 113-124
    7. Dietrich Hauptmeier, Sven O. Krumke, Jörg Rambau
      Pages 125-136
    8. Michiel Blom, Sven O. Krumke, Willem de Paepe, Leen Stougie
      Pages 137-149
    9. Domenico Cantone, Gianluca Cincotti
      Pages 150-162
    10. Cao An Wang, Francis Y. Chin, Boting Yang
      Pages 163-173
    11. Jens Gramm, Rolf Niedermeier
      Pages 174-186
    12. Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
      Pages 187-198
    13. Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat
      Pages 199-210
    14. Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri
      Pages 211-225
    15. Sebastiano Battiato, Domenico Cantone, Dario Catalano, Gianluca Cincotti, Micha Hofri
      Pages 226-238

About these proceedings

Introduction

The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome \La Sapienza". This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21 papers for presentation at the conference. Each paper was evaluated by at least three program committee members. In addition to the selected papers, the organizing committee invited Giorgio Ausiello, Narsingh Deo, Walter Ruzzo, and Shmuel Zaks to give plenary lectures at the conference. We wish to express our appreciation to all the authors of the submitted papers, to the program committee members and the referees, to the organizing committee, and to the plenary lecturers who accepted our invitation.

Keywords

algorithms combinatorial optimization complexity complexity theory computational geometry optimization scheduling

Editors and affiliations

  • Giancarlo Bongiovanni
    • 1
  • Rossella Petreschi
    • 1
  • Giorgio Gambosi
    • 2
  1. 1.Department of Computer ScienceUniversity of Rome “La Sapienza”RomeItaly
  2. 2.Department of MathematicsUniversity of Rome “Tor Vergata”RomeItaly

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-46521-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-67159-6
  • Online ISBN 978-3-540-46521-8
  • Series Print ISSN 0302-9743
  • About this book
Industry Sectors
Electronics
Telecommunications
Aerospace