Algorithms and Complexity

8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings

  • Paul G. Spirakis
  • Maria Serna

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

Table of contents

  1. Front Matter
  2. Hasna Mohsen Alqahtani, Thomas Erlebach
    Pages 1-12
  3. Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
    Pages 13-24
  4. Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis
    Pages 25-36
  5. Djamal Belazzougui, Mathieu Raffinot
    Pages 37-48
  6. René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein et al.
    Pages 49-60
  7. Joan Boyar, Magnus Find, René Peralta
    Pages 61-72
  8. Till Bruckdorfer, Stefan Felsner, Michael Kaufmann
    Pages 73-84
  9. Mihai Burcea, Prudence W. H. Wong, Fencol C. C. Yung
    Pages 85-96
  10. Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor
    Pages 97-109
  11. Ajoy K. Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
    Pages 122-133
  12. Jasper de Jong, Marc Uetz, Andreas Wombacher
    Pages 134-145
  13. José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Alexander Pilz, Carlos Seara, Rodrigo I. Silveira
    Pages 146-157
  14. Yann Disser, Andreas Emil Feldmann, Max Klimm, Matúš Mihalák
    Pages 158-169
  15. Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc et al.
    Pages 170-182
  16. Shlomi Dolev, Nova Fandina, Dan Gutfreund
    Pages 183-196
  17. Pavlos S. Efraimidis, Remous-Aris Koutsiamanis
    Pages 197-208
  18. Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard
    Pages 209-220
  19. Aleksander Fabijan, Bengt J. Nilsson, Mia Persson
    Pages 221-233

About these proceedings


This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.


algorithmic game theory decision tree complexity plane graphs read-once formulae string matching

Editors and affiliations

  • Paul G. Spirakis
    • 1
  • Maria Serna
    • 2
  1. 1.School of Engineering, Department of Computer Engineering and InformaticsUniversity of PatrasPatrasGreece
  2. 2.LSI Department, Edif OmegaUniversitat Politècnica de CatalunyaBarcelonaSpain

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-38232-1
  • Online ISBN 978-3-642-38233-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Energy, Utilities & Environment