ICTCS 2026

Table of Contents

• PDF
  
• PDF
  Beniamino Todone
• PDF
  Beniamino Todone
• PDF
  Beniamino Todone
• PDF
  Beniamino Todone
• PDF
  Beniamino Todone
• A Kripke Semantics and Tableau for Monadic Wajsberg Logic 1-14 PDF
  Andrew Lewis-Smith
• On the Convexity of Kantorovich Liftings of Fuzzy Relations 15-29 PDF
  Matteo Mio, Paolo Pistone, Apolline Rodary, Valeria Vignudelli
• Semantic Embeddings for Modal Logic (Extended Abstract) 30-35 PDF
  Pietro Casavecchia, Mauro Milella, Riccardo Monego, Alberto Paparella, Guido Sciavicco, Leonardo Serrentino
• On Jumps, Interactions, and Intersection Types 36-40 PDF
  Stefano Catozi, Ugo Dal Lago, Gabriele Vanoni
• Nominal Automata and Register Automata with Permutations 41-47 PDF
  Mrudula Balachander, Emmanuel Filiot, Raffaella Gentilini, Nikos Tzevelekos
• Closure Operations on Picture Languages and Floor Plans 48-53 PDF
  Stefano Crespi Reghizzi, Antonio Restivo, Pierluigi San Pietro
• On Learning Incomplete Automata 54-65 PDF
  Raffaella Gentilini
• Finite-State Transducers in the Wheeler Setting 66-70 PDF
  Giovanna D'Agostino, Andrea Paradiso
• Non-deterministic Width of Regular Languages: the Unary Case 71-78 PDF
  Giovanna D'Agostino, Alessandro Minisini, Alberto Policriti
• (In)tractability of the Maximum 2-Clique Problem for Bipartite Graphs 79-84 PDF
  Yuichi Asahiro, Eiji Miyano, Shunta Nakamura
• Minimum 𝑠-𝑡 Separator Reconfiguration on Chordal Graphs 85-97 PDF
  Shira Zucker
• Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms 98-111 PDF
  Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, S Padmapriya, Praneet Kumar Patra, Harsh Sanklecha
• Morris Games are (Computationally) Hard 112-125 PDF
  Stefano Leucci, Michael Piccirilli
• Complexity Thresholds for the Constrained Colored Token Swapping Problem 126-139 PDF
  Davide Bilò, Stefano Leucci, Andrea Martinelli
• Type-Based Enforcement of Non-Interference for Choreographic Programming 140-154 PDF
  Marco Bertoni, Saverio Giallorenzo, Marco Peressotti
• Distributed Quickest Flow in Sparse Layered Networks 155-166 PDF
  Andrzej Czygrinow, Michał Hańckowiak
• Dynamic Algorithms for Detecting Vulnerability to the Braess Paradox in Multi-Commodity Networks 167-172 PDF
  Dario Fiorenza
• A 1.5-Approximation Algorithm for Broadcast Time in 𝑘-Path Graphs 173-184 PDF
  Aref Afzali, Hovhannes A. Harutyunyan
• Recompressing Compressed Data 185-201 PDF
  Dominik Köppl, Francesco Pio Marino
• On the Energy Efficiency of Suffix Array Construction Algorithms 202-207 PDF
  Antonio Brogi, Luigi di Micco, Giovanni Manzini
• The Skipping Principle in String Matching: A Simplified Analysis of Apostolico–Giancarlo 208-221 PDF
  Simone Faro, Arianna Pavone
• Differentially Private Distance-Sensitive Set Representations 222-235 PDF
  Paul Cesaretti
• Towards a Characterization of Counting and Alternating Classes via Discrete Ordinary Differential Equations: Ongoing Research Report 236-241 PDF
  Melissa Antonelli, Eduardo Skapinakis
• A Tight Scale-Locality Bound for Partial Detection in Non-Adaptive Group Testing 242-253 PDF
  Nader H. Bshouty
• Symmetric Conjunctions of NP-Complete Relations: A Complexity Collapse Phenomenon and Its Limits 254-266 PDF
  Domenico Cantone, Stefano Savino
• A Verification Pipeline for Neuronal Archetypes 267-279 PDF
  Thi-Thuy-Duong Pham, Elisabetta De Maria, Robert De Simone
• Towards a Comprehensive Formal Language Theory for First-Order Temporal Logic 280-287 PDF
  Nicola Gigante
• Compiling the Plurality Winner of a Random Forest into OBDDs via Margin Absorption 288-300 PDF
  Daniel Amadori, Emanuele Chini, Pietro Sala, Emma Maria Sole Tosato
• Towards Algebraic Asymptotics for Probabilistic Loops 301-308 PDF
  Michele Boreale, Luisa Collodi, Alessandro Pompa Di Gregorio
• Policy Automata for Stateful Authorization 309-322 PDF
  Massimiliano Baldo, Marino Miculan, Matteo Paier
• Reduction of the Asymptotic Prefactors for an Optimally Bounded Quantum State Preparation Algorithm 323-334 PDF
  Giacomo Belli, Michele Amoretti
• Shallow Quantum Shuffling via Measurement-Driven Multi-Scale Rotations 335-348 PDF
  Simone Faro, Francesco Pio Marino, Arianna Pavone
• Routing-Free Quantum RAM via Controlled Permutations 349-362 PDF
  Simone Faro, Arianna Pavone
• An Elementary Description of the Oracle of Efficient Sparse Matrices 363-375 PDF
  Benoît Valiron, Renaud Vilmart, Adham Zekri
• State Vector to Block Encoding: An Efficient Quantum Circuit Transformation 376-381 PDF
  Giacomo Antonioli, Alessandro Berti, Gianna M. Del Corso, Alessandro Poggiali
• Qudit-Based Quantum State Preparation via KP-Trees 382-388 PDF
  Simone Ianniciello, Gianna M. Del Corso
• Embedding Measure-Once Quantum Finite Automata in the Feynman Quantum Computer Model 389-402 PDF
  Carlo Mereghetti, Beatrice Palano, Beatrice Simoncioni, Dario Tamascelli
• It All Concerns Rejection: a New Approach to the QMA(1) ?= QMA(2) Problem 403-412 PDF
  Giona Cantarutti, Riccardo Romanello
• Minimizing AOD Trap Activations for Atom Shuttling in Neutral-Atom Quantum Architectures 413-423 PDF
  Francesco Decataldo, Christian Bianchini, Enrico Santi
• Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction 424-430 PDF
  Kostia Chardonnet, Ugo Dal Lago, Naohiko Hoshino, Paolo Pistone
• Solving Variants of the Multi-Mode Resource Constrained Project Scheduling Problem with Quantum Annealing 431-436 PDF
  Marco Baioletti, Angelo Oddi, Riccardo Rasconi
• Faster Cache-Efficient Pattern Matching for Deterministic Wheeler Pangenome Graphs 437-450 PDF
  Riccardo Maso, Nicola Prezza, Carlo Tosoni
• A Hierarchical Haplotype-Based Distance for Genome-Wide Phylogenetic Reconstruction 451-465 PDF
  Pasquale Marino, Roberto Pagliarini
• Comparing Combinatorial Models of Interacting Evolutionary Histories 466-471 PDF
  Gabriele Di Palma, Catherine Matias, Blerina Sinaimeri