© 2021

Algorithms and Complexity

12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings

  • Tiziana Calamoneri
  • Federico Corò
Conference proceedings CIAC 2021

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 12701)

Table of contents

  1. Front Matter
    Pages i-xi
  2. Invited Lecture

    1. Front Matter
      Pages 1-1
    2. Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor
      Pages 3-19
  3. Contributed Papers

    1. Front Matter
      Pages 21-21
    2. Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
      Pages 23-36
    3. Saeed Akhoondian Amiri, Ben Wiederhake
      Pages 37-60
    4. Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth
      Pages 61-74
    5. Susanne Albers, Jens Quedenfeld
      Pages 75-89 Open Access
    6. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
      Pages 90-102
    7. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney
      Pages 103-115
    8. Ioana O. Bercea, Guy Even
      Pages 116-129
    9. Martin Böhm, Nicole Megow, Jens Schlöter
      Pages 130-143
    10. Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
      Pages 144-157
    11. Guilherme Castro Mendes Gomes, Vinicius F. dos Santos, Murilo V. G. da Silva, Jayme L. Szwarcfiter
      Pages 158-172
    12. Francesco Cellinese, Gianlorenzo D’Angelo, Gianpiero Monaco, Yllka Velaj
      Pages 173-186
    13. Louis Dublois, Michael Lampis, Vangelis Th. Paschos
      Pages 202-215
    14. Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
      Pages 216-230
    15. Till Fluschnik
      Pages 231-244
    16. Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky
      Pages 245-257

About these proceedings


This book constitutes the refereed conference proceedings of the 12th International Conference on Algorithms and Complexity, CIAC 2019, held as a virtual event, in May 2021.

The 28 full papers presented together with one invited lecture and 2 two abstracts of invited lectures were carefully reviewed and selected from 78 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.

Due to the Corona pandemic the conference was held virtually.


parallel algorithms distributed algorithms data structures approximation algorithms randomized algorithms graph algorithms on-line algorithms streaming algorithms analysis of algorithms computational complexity algorithm engineering web algorithms exact computation parameterized computation algorithmic game theory computational biology foundations of communication networks computational geometry discrete optimization

Editors and affiliations

  1. 1.Sapienza University of RomeRomeItaly
  2. 2.Sapienza University of RomeRomeItaly

Bibliographic information