Accepted papers

  • Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Padmapriya S, Praneet Kumar Patra, Harsh Sanklecha. Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms.
  • Andrea Paradiso, Giovanna D’Agostino. Finite State Transducers: the Wheeler Setting (short paper).
  • Andrew Lewis-Smith. A Kripke Semantics and Tableaux for Monadic Wajsberg logic.
  • Andrzej Czygrinow, Michał Hańckowiak. Distributed Quickest Flow in Sparse Layered Networks.
  • Antonio Brogi, Luigi di Micco, Giovanni Manzini. On the Energy Efficiency of Suffix Array Construction Algorithms (short paper).
  • Aref Afzali, Hovhannes A. Harutyunyan. A 1.5-Approximation Algorithm for Broadcast Time in k-Path Graphs.
  • Benoît Valiron, Renaud Vilmart, Adham Zekri. An Elementary Description of the Oracle of Efficient Sparse Matrices.
  • Carlo Mereghetti, Beatrice Palano, Beatrice Simoncioni, Dario Tamascelli. Embedding Measure-Once Quantum Finite Automata in the Feynman Quantum Computer Model.
  • Daniel Amadori, Emanuele Chini, Pietro Sala, Emma Maria Sole Tosato. Compiling the Plurality Winner of a Random Forest into OBDDs via Margin Absorption.
  • Dario Fiorenza. Dynamic Algorithms for Detecting Vulnerability to the Braess Paradox in Multi-Commodity Networks (short paper).
  • Davide Bilò, Stefano Leucci, Andrea Martinelli. Complexity Thresholds for the Constrained Colored Token Swapping Problem.
  • Domenico Cantone, Stefano Savino. Symmetric Conjunctions of NP-Complete Relations: A Complexity Collapse Phenomenon and Its Limits.
  • Dominik Köppl, Francesco Pio Marino. Recompressing Compressed Data.
  • Duong Pham Thi Thuy, Elisabetta De Maria, Robert De Simone. A verification pipeline for neuronal archetypes.
  • Francesco Decataldo, Christian Bianchini, Enrico Santi. Minimizing AOD Trap Activations for Atom Shuttling in Neutral-Atom Quantum Architectures.
  • Gabriele Di Palma, Catherine Matias, Blerina Sinaimeri. Comparing combinatorial models of interacting evolutionary histories (short paper).
  • Giacomo Antonioli, Alessandro Berti, Gianna M. Del Corso, Alessandro Poggiali. State Vector to Block Encoding: An Efficient Quantum Circuit Transformation (short paper).
  • Giacomo Belli, Michele Amoretti. Reduction of the Asymptotic Prefactors for an Optimally Bounded Quantum State Preparation Algorithm.
  • Giona Cantarutti, Riccardo Romanello. It All Concerns Rejection: a New Approach to the QMA(1) ?= QMA(2) Problem.
  • Giovanna D’Agostino, Alessandro Minisini, Alberto Policriti. Non-deterministic width of regular languages: the unary case (short paper).
  • Kostia Chardonnet, Ugo Dal Lago, Naohiko Hoshino, Paolo Pistone. Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction (short paper).
  • Marco Baioletti, Angelo Oddi, Riccardo Rasconi. Solving Variants of the Multi-Mode Resource Constrained Project Scheduling Problem with Quantum Annealing (short paper).
  • Marco Bertoni, Saverio Giallorenzo, Marco Peressotti. Type-Based Enforcement of Non-Interference for Choreographic Programming.
  • Massimiliano Baldo, Marino Miculan, Matteo Paier. Policy Automata for Stateful Authorization.
  • Matteo Mio, Paolo Pistone, Apolline Rodary, Valeria Vignudelli. On the Convexity of Kantorovich Liftings of Fuzzy Relations.
  • Melissa Antonelli, Eduardo Skapinakis. Towards a Characterization of Counting and Alternating Classes via Discrete Ordinary Differential Equations: Ongoing Research Report (short paper).
  • Michele Boreale, Luisa Collodi, Alessandro Pompa Di Gregorio. Towards algebraic asymptotics for probabilistic loops (short paper).
  • Mrudula Balachander, Emmanuel Filiot, Raffaella Gentilini, Nikos Tzevelekos. Nominal Automata and Register Automata with Permutations (short paper).
  • Nader H. Bshouty. A Tight Scale-Locality Bound for Partial Detection in Non-Adaptive Group Testing.
  • Nicola Gigante. Towards a Comprehensive Formal Language Theory for First-Order Temporal Logic (short paper).
  • Pasquale Marino, Roberto Pagliarini. A Hierarchical Haplotype-Based Distance for Genome-Wide Phylogenetic Reconstruction.
  • Paul Cesaretti. Differentially Private Distance-Sensitive Set Representations.
  • Pietro Casavecchia, Mauro Milella, Riccardo Monego, Alberto Paparella, Guido Sciavicco, Leonardo Serrentino. A Semantic Embedding for Modal Logic (short paper).
  • Raffaella Gentilini. On Learning Incomplete Automata.
  • Riccardo Maso, Nicola Prezza, Carlo Tosoni. Faster Cache-Efficient Pattern Matching for Deterministic Wheeler Pangenome Graphs.
  • Shira Zucker. Minimum s-t Separator Reconfiguration on Chordal Graphs.
  • Simone Faro, Arianna Pavone. Routing-Free Quantum RAM via Controlled Permutations.
  • Simone Faro, Arianna Pavone. The Skipping Principle in String Matching: A Simplified Analysis of Apostolico–Giancarlo.
  • Simone Faro, Francesco Pio Marino, Arianna Pavone. Shallow Quantum Shuffling via Measurement-Driven Multi-Scale Rotations.
  • Simone Ianniciello, Gianna M. Del Corso. Qudit-Based Quantum State Preparation via KP-Trees (short paper).
  • Stefano Catozi, Ugo Dal Lago, Gabriele Vanoni. On Jumps, Interactions, and Intersection Types (short paper).
  • Stefano Crespi Reghizzi, Antonio Restivo, Pierluigi San Pietro. Closure Operations on Picture Languages and Floor Plans (short paper).
  • Stefano Leucci, Michael Piccirilli. Morris Games are (Computationally) Hard.
  • Yuichi Asahiro, Eiji Miyano, Shunta Nakamura. (In)tractability of the Maximum 2-Clique Problem for Bipartite Graphs (short paper).