ICTCS 2026
Italian Conference on Theoretical Computer Science 2026

Table of Contents

• Preface
  Summary: A total of 71 papers were submitted to the conference for peer review. Of these, 14 were desk-rejected, 3 were withdrawn during the review process, and 10 were rejected following peer review. Overall, 44 papers were accepted, including 27 regular papers and 17 short papers.

Invited Talks

• Quantum Circuit Verification: Challenges and Opportunities (not published in this volume)
  Parosh Aziz Abdulla
• Alignments to and among Degenerate Strings (not published in this volume)
  Nadia Pisanti

IC-EATCS Best Young Researcher

• Mechanism Redesign: Repairing Techniques for Synthesis and Rational Synthesis (not published in this volume)
  Giuseppe Perelli

IC-EATCS Best PhD Thesis

• Adaptive and Scalable Algorithms for Little, Uncertain and Strategic Data (not published in this volume)
  Matteo Russo

IC-EATCS Best Master Thesis

• QAOA and Approximability (not published in this volume)
  Beniamino Todone

Logic, Semantics, and Type Systems

• A Kripke Semantics and Tableau for Monadic Wajsberg Logic 1–14
  Andrew Lewis-Smith
• On the Convexity of Kantorovich Liftings of Fuzzy Relations 15–29
  Matteo Mio, Paolo Pistone, Apolline Rodary, Valeria Vignudelli
• Semantic Embeddings for Modal Logic (Extended Abstract) (short paper) 30–35
  Pietro Casavecchia, Mauro Milella, Riccardo Monego, Alberto Paparella, Guido Sciavicco, Leonardo Serrentino
• On Jumps, Interactions, and Intersection Types (short paper) 36–40
  Stefano Catozi, Ugo Dal Lago, Gabriele Vanoni

Automata and Formal Languages

• Nominal Automata and Register Automata with Permutations (short paper) 41–47
  Mrudula Balachander, Emmanuel Filiot, Raffaella Gentilini, Nikos Tzevelekos
• Closure Operations on Picture Languages and Floor Plans (short paper) 48–53
  Stefano Crespi Reghizzi, Antonio Restivo, Pierluigi San Pietro
• On Learning Incomplete Automata 54–65
  Raffaella Gentilini
• Finite-State Transducers in the Wheeler Setting (short paper) 66–70
  Giovanna D'Agostino, Andrea Paradiso
• Non-deterministic Width of Regular Languages: the Unary Case (short paper) 71–78
  Giovanna D'Agostino, Alessandro Minisini, Alberto Policriti

Graph Algorithms and Games

• (In)tractability of the Maximum 2-Clique Problem for Bipartite Graphs (short paper) 79–84
  Yuichi Asahiro, Eiji Miyano, Shunta Nakamura
• Minimum 𝑠-𝑡 Separator Reconfiguration on Chordal Graphs 85–97
  Shira Zucker
• Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms 98–111
  Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, S Padmapriya, Praneet Kumar Patra, Harsh Sanklecha
• Morris Games are (Computationally) Hard 112–125
  Stefano Leucci, Michael Piccirilli
• Complexity Thresholds for the Constrained Colored Token Swapping Problem 126–139
  Davide Bilò, Stefano Leucci, Andrea Martinelli

Distributed, Network, and Approximation Algorithms

• Type-Based Enforcement of Non-Interference for Choreographic Programming 140–154
  Marco Bertoni, Saverio Giallorenzo, Marco Peressotti
• Distributed Quickest Flow in Sparse Layered Networks 155–166
  Andrzej Czygrinow, Michał Hańckowiak
• Dynamic Algorithms for Detecting Vulnerability to the Braess Paradox in Multi-Commodity Networks (short paper) 167–172
  Dario Fiorenza
• A 1.5-Approximation Algorithm for Broadcast Time in 𝑘-Path Graphs 173–184
  Aref Afzali, Hovhannes A. Harutyunyan

String Algorithms, Compression, and Data Structures

• Recompressing Compressed Data 185–201
  Dominik Köppl, Francesco Pio Marino
• On the Energy Efficiency of Suffix Array Construction Algorithms (short paper) 202–207
  Antonio Brogi, Luigi di Micco, Giovanni Manzini
• The Skipping Principle in String Matching: A Simplified Analysis of Apostolico–Giancarlo 208–221
  Simone Faro, Arianna Pavone
• Differentially Private Distance-Sensitive Set Representations 222–235
  Paul Cesaretti

Complexity and Combinatorial Optimization

• Towards a Characterization of Counting and Alternating Classes via Discrete Ordinary Differential Equations: Ongoing Research Report (short paper) 236–241
  Melissa Antonelli, Eduardo Skapinakis
• A Tight Scale-Locality Bound for Partial Detection in Non-Adaptive Group Testing 242–253
  Nader H. Bshouty
• Symmetric Conjunctions of NP-Complete Relations: A Complexity Collapse Phenomenon and Its Limits 254–266
  Domenico Cantone, Stefano Savino

Cyber-Physical Systems: Verification, Monitoring, and Symbolic Methods

• A Verification Pipeline for Neuronal Archetypes 267–279
  Thi-Thuy-Duong Pham, Elisabetta De Maria, Robert De Simone
• Towards a Comprehensive Formal Language Theory for First-Order Temporal Logic (short paper) 280–287
  Nicola Gigante
• Compiling the Plurality Winner of a Random Forest into OBDDs via Margin Absorption 288–300
  Daniel Amadori, Emanuele Chini, Pietro Sala, Emma Maria Sole Tosato
• Towards Algebraic Asymptotics for Probabilistic Loops (short paper) 301–308
  Michele Boreale, Luisa Collodi, Alessandro Pompa Di Gregorio
• Policy Automata for Stateful Authorization 309–322
  Massimiliano Baldo, Marino Miculan, Matteo Paier

Quantum Computing I: Circuits, Data Encoding, and State Preparation

• Reduction of the Asymptotic Prefactors for an Optimally Bounded Quantum State Preparation Algorithm 323–334
  Giacomo Belli, Michele Amoretti
• Shallow Quantum Shuffling via Measurement-Driven Multi-Scale Rotations 335–348
  Simone Faro, Francesco Pio Marino, Arianna Pavone
• Routing-Free Quantum RAM via Controlled Permutations 349–362
  Simone Faro, Arianna Pavone
• An Elementary Description of the Oracle of Efficient Sparse Matrices 363–375
  Benoît Valiron, Renaud Vilmart, Adham Zekri
• State Vector to Block Encoding: An Efficient Quantum Circuit Transformation (short paper) 376–381
  Giacomo Antonioli, Alessandro Berti, Gianna M. Del Corso, Alessandro Poggiali
• Qudit-Based Quantum State Preparation via KP-Trees (short paper) 382–388
  Simone Ianniciello, Gianna M. Del Corso

Quantum Computing II: Algorithms, Complexity, and Models

• Embedding Measure-Once Quantum Finite Automata in the Feynman Quantum Computer Model 389–402
  Carlo Mereghetti, Beatrice Palano, Beatrice Simoncioni, Dario Tamascelli
• It All Concerns Rejection: a New Approach to the QMA(1) ?= QMA(2) Problem 403–412
  Giona Cantarutti, Riccardo Romanello
• Minimizing AOD Trap Activations for Atom Shuttling in Neutral-Atom Quantum Architectures 413–423
  Francesco Decataldo, Christian Bianchini, Enrico Santi
• Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction (short paper) 424–430
  Kostia Chardonnet, Ugo Dal Lago, Naohiko Hoshino, Paolo Pistone
• Solving Variants of the Multi-Mode Resource Constrained Project Scheduling Problem with Quantum Annealing (short paper) 431–436
  Marco Baioletti, Angelo Oddi, Riccardo Rasconi

Bioinformatics

• Faster Cache-Efficient Pattern Matching for Deterministic Wheeler Pangenome Graphs 437–450
  Riccardo Maso, Nicola Prezza, Carlo Tosoni
• A Hierarchical Haplotype-Based Distance for Genome-Wide Phylogenetic Reconstruction 451–465
  Pasquale Marino, Roberto Pagliarini
• Comparing Combinatorial Models of Interacting Evolutionary Histories (short paper) 466–471
  Gabriele Di Palma, Catherine Matias, Blerina Sinaimeri