Algorithms and Complexity

6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006. Proceedings

  • Tiziana Calamoneri
  • Irene Finocchi
  • Giuseppe F. Italiano
Conference proceedings CIAC 2006
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3998)

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Session 1

    1. Magdalene Grantson, Christos Levcopoulos
      Pages 6-17
    2. Guy Even, Dror Rawitz, Shimon (Moni) Shahar
      Pages 18-29
    3. Henrik Blunck, Jan Vahrenhold
      Pages 30-41
  4. Session 2

  5. Session 3

    1. Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matúš Mihaľák
      Pages 69-80
    2. Dimitrios Koukopoulos, Stavros D. Nikolopoulos
      Pages 93-104
  6. Session 4

    1. Jean-Claude Bermond, Ricardo Corrêa, Minli Yu
      Pages 115-126
    2. Bernhard Fuchs
      Pages 127-138
  7. Session 5

    1. S. Dobrev, R. Královič, N. Santoro, W. Shi
      Pages 139-150
    2. Christian Gunia
      Pages 151-162
  8. Session 6

    1. Yvonne Bleischwitz, Burkhard Monien
      Pages 175-186

About these proceedings

Keywords

algorithm algorithms complexity computational geometry data structure data structures game theory optimization programming

Editors and affiliations

  • Tiziana Calamoneri
    • 1
  • Irene Finocchi
    • 2
  • Giuseppe F. Italiano
    • 3
  1. 1.Department of Computer ScienceUniversity of Rome”Sapienza”Italy
  2. 2.Computer Science DepartmentSapienza University of RomeRomeItaly
  3. 3.Dipartimento di Informatica, Sistemi e ProduzioneUniversità di Roma “Tor Vergata”RomaItaly

Bibliographic information

  • DOI https://doi.org/10.1007/11758471
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-34375-2
  • Online ISBN 978-3-540-34378-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book