Skip to main content
  • Conference proceedings
  • © 2021

Algorithms and Complexity

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

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): CIAC: International Conference on Algorithms and Complexity

Conference proceedings info: CIAC 2021.

Buy it now

Buying options

eBook USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (28 papers)

  1. Front Matter

    Pages i-xi
  2. Invited Lecture

    1. Front Matter

      Pages 1-1
    2. Invited Talks

      • Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor
      Pages 3-19
  3. Contributed Papers

    1. Front Matter

      Pages 21-21
    2. Three Problems on Well-Partitioned Chordal Graphs

      • Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
      Pages 23-36
    3. Distributed Distance-r Covering Problems on Sparse High-Girth Graphs

      • Saeed Akhoondian Amiri, Ben Wiederhake
      Pages 37-60
    4. Reconfiguration of Connected Graph Partitions via Recombination

      • Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth
      Pages 61-74
    5. Algorithms for Energy Conservation in Heterogeneous Data Centers

      • Susanne Albers, Jens Quedenfeld
      Pages 75-89Open Access
    6. On Vertex-Weighted Graph Realizations

      • Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz
      Pages 90-102
    7. On the Role of 3’s for the 1-2-3 Conjecture

      • Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney
      Pages 103-115
    8. Upper Tail Analysis of Bucket Sort and Random Tries

      • Ioana O. Bercea, Guy Even
      Pages 116-129
    9. Throughput Scheduling with Equal Additive Laxity

      • Martin Böhm, Nicole Megow, Jens Schlöter
      Pages 130-143
    10. Fragile Complexity of Adaptive Algorithms

      • Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
      Pages 144-157
    11. FPT and Kernelization Algorithms for the Induced Tree Problem

      • Guilherme Castro Mendes Gomes, Vinicius F. dos Santos, Murilo V. G. da Silva, Jayme L. Szwarcfiter
      Pages 158-172
    12. The Multi-budget Maximum Weighted Coverage Problem

      • Francesco Cellinese, Gianlorenzo D’Angelo, Gianpiero Monaco, Yllka Velaj
      Pages 173-186
    13. Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation

      • Louis Dublois, Michael Lampis, Vangelis Th. Paschos
      Pages 202-215
    14. On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering

      • Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
      Pages 216-230
    15. A Multistage View on 2-Satisfiability

      • Till Fluschnik
      Pages 231-244
    16. The Weisfeiler-Leman Algorithm and Recognition of Graph Properties

      • Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky
      Pages 245-257

Other Volumes

  1. Algorithms and Complexity

About this book

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.



Editors and Affiliations

  • Sapienza University of Rome, Rome, Italy

    Tiziana Calamoneri, Federico Corò

Bibliographic Information

Buy it now

Buying options

eBook USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access