DAY 1
Monday, September 7
| TIME | EVENT |
|---|---|
| 09:00–09:20 | Conference Opening Welcome and practical information |
| 09:20–10:20 | Quantum Circuit Verification: Challenges and Opportunities (Invited Talk) Parosh Aziz Abdulla |
| 10:20–10:50 | Coffee Break |
| 10:50–12:22 | Graph Algorithms and Games |
| 10:50–11:02 | (In)tractability of the Maximum 2-Clique Problem for Bipartite Graphs (Short paper) Yuichi Asahiro, Eiji Miyano, Shunta Nakamura |
| 11:02–11:22 | Minimum s-t Separator Reconfiguration on Chordal Graphs (Long paper) Shira Zucker |
| 11:22–11:42 | Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms (Long paper) Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Padmapriya S, Praneet Kumar Patra, Harsh Sanklecha |
| 11:42–12:02 | Morris Games are (Computationally) Hard (Long paper) Stefano Leucci, Michael Piccirilli |
| 12:02–12:22 | Complexity Thresholds for the Constrained Colored Token Swapping Problem (Long paper) Davide Bilò, Stefano Leucci, Andrea Martinelli |
| 12:25–14:15 | Lunch |
| 14:15–15:23 | Automata and Formal Languages |
| 14:15–14:27 | Nominal Automata and Register Automata with Permutations (Short paper) Mrudula Balachander, Emmanuel Filiot, Raffaella Gentilini, Nikos Tzevelekos |
| 14:27–14:39 | Closure Operations on Picture Languages and Floor Plans (Short paper) Stefano Crespi Reghizzi, Antonio Restivo, Pierluigi San Pietro |
| 14:39–14:59 | On Learning Incomplete Automata (Long paper) Raffaella Gentilini |
| 14:59–15:11 | Finite-State Transducers in the Wheeler Setting (Short paper) Andrea Paradiso, Giovanna D’Agostino |
| 15:11–15:23 | Non-deterministic width of regular languages: the unary case (Short paper) Giovanna D’Agostino, Alessandro Minisini, Alberto Policriti |
| 15:25–16:05 | Coffee Break |
| 16:05–16:45 | Industrial Applications |
| 16:05–16:25 | Danieli Automation Enhanced process supervision for a modern AI-based steel industry |
| 16:25–16:45 | beanTech TBA |
| 16:45–18:09 | Cyber-Physical Systems: Verification, Monitoring, and Symbolic Methods |
| 16:45–17:05 | A verification pipeline for neuronal archetypes (Long paper) Duong Pham Thi Thuy, Elisabetta De Maria, Robert De Simone |
| 17:05–17:17 | Towards a Comprehensive Formal Language Theory for First-Order Temporal Logic (Short paper) Nicola Gigante |
| 17:17–17:37 | Compiling the Plurality Winner of a Random Forest into OBDDs via Margin Absorption (Long paper) Daniel Amadori, Emanuele Chini, Pietro Sala, Emma Maria Sole Tosato |
| 17:37–17:49 | Towards algebraic asymptotics for probabilistic loops (Short paper) Michele Boreale, Luisa Collodi, Alessandro Pompa Di Gregorio |
| 17:49–18:09 | Policy Automata for Stateful Authorization (Long paper) Massimiliano Baldo, Marino Miculan, Matteo Paier |
Day 2
Tuesday, September 8
| TIME | EVENT |
|---|---|
| 09:00–10:00 | Alignments to and among degenerate strings (Invited Talk) Nadia Pisanti |
| 10:00–10:30 | Coffee Break |
| 10:30–11:22 | Bioinformatics |
| 10:30–10:50 | Faster Cache-Efficient Pattern Matching for Deterministic Wheeler Pangenome Graphs (Long paper) Riccardo Maso, Nicola Prezza, Carlo Tosoni |
| 10:50–11:10 | A Hierarchical Haplotype-Based Distance for Genome-Wide Phylogenetic Reconstruction (Long paper) Pasquale Marino, Roberto Pagliarini |
| 11:10–11:22 | Comparing combinatorial models of interacting evolutionary histories (Short paper) Gabriele Di Palma, Catherine Matias, Blerina Sinaimeri |
| 11:22–12:34 | Distributed, Network, and Approximation Algorithms |
| 11:22–11:42 | Type-Based Enforcement of Non-Interference for Choreographic Programming (Long paper) Marco Bertoni, Saverio Giallorenzo, Marco Peressotti |
| 11:42–12:02 | Distributed Quickest Flow in Sparse Layered Networks (Long paper) Andrzej Czygrinow, Michał Hańckowiak |
| 12:02–12:14 | Dynamic Algorithms for Detecting Vulnerability to the Braess Paradox in Multi-Commodity Networks (Short paper) Dario Fiorenza |
| 12:14–12:34 | A 1.5-Approximation Algorithm for Broadcast Time in k-Path Graphs (Long paper) Aref Afzali, Hovhannes A. Harutyunyan |
| 12:35–14:20 | Lunch |
| 14:20–15:32 | String Algorithms, Compression, and Data Structures |
| 14:20–14:40 | Recompressing Compressed Data (Long paper) Dominik Köppl, Francesco Pio Marino |
| 14:40–14:52 | On the Energy Efficiency of Suffix Array Construction Algorithms (Short paper) Antonio Brogi, Luigi di Micco, Giovanni Manzini |
| 14:52–15:12 | The Skipping Principle in String Matching: A Simplified Analysis of Apostolico–Giancarlo (Long paper) Simone Faro, Arianna Pavone |
| 15:12–15:32 | Differentially Private Distance-Sensitive Set Representations (Long paper) Paul Cesaretti |
| 15:35–16:05 | Coffee Break |
| 16:05–17:05 | Quantum Computing |
| 16:05–16:25 | Embedding Measure-Once Quantum Finite Automata in the Feynman Quantum Computer Model (Long paper) Carlo Mereghetti, Beatrice Palano, Beatrice Simoncioni, Dario Tamascelli |
| 16:25–16:45 | An elementary description of the black-box function of sparse matrices (Long paper) Adham Zekri, Benoit Valiron, Renaud Vilmart |
| 16:45–17:05 | It All Concerns Rejection: a New Approach to the QMA(1) ?= QMA(2) Problem (Long paper) Giona Cantarutti, Riccardo Romanello |
| 17:05–18:05 | Assembly of the IC of the EATCS |
| 18:05–20:00 | Social Excursion Guided Walking Tour of Udine |
| 20:00 | Conference Dinner Casa della Contadinanza, Udine |
DAY 3
Wednesday, September 9
| TIME | EVENT |
|---|---|
| 09:00–10:35 | IC-EATCS Awards Ceremony |
| 09:00–09:10 | Awards ceremony introduction Opening remarks and presentation of the three awards. |
| 09:10–10:10 | IC-EATCS Best Young Researcher · Giuseppe Perelli Mechanism Redesign: Repairing Techniques for Synthesis and Rational Synthesis |
| 10:10–10:30 | IC-EATCS Best PhD Dissertation · Matteo Russo Adaptive and scalable algorithms for little, uncertain and strategic data |
| 10:30–10:35 | IC-EATCS Best Master Thesis · Beniamino Todone QAOA and Approximability |
| 10:35–11:05 | Coffee Break |
| 11:05–12:09 | Logic, Semantics, and Type Systems |
| 11:05–11:25 | A Kripke Semantics and Tableaux for Monadic Wajsberg logic (Long paper) Andrew Lewis-Smith |
| 11:25–11:45 | On the Convexity of Kantorovich Liftings of Fuzzy Relations (Long paper) Matteo Mio, Paolo Pistone, Apolline Rodary, Valeria Vignudelli |
| 11:45–11:57 | Semantic Embeddings for Modal Logic (Short paper) Pietro Casavecchia, Mauro Milella, Riccardo Monego, Alberto Paparella, Guido Sciavicco, Leonardo Serrentino |
| 11:57–12:09 | On Jumps, Interactions, and Intersection Types (Short paper) Stefano Catozi, Ugo Dal Lago, Gabriele Vanoni |
| 12:09–13:01 | Complexity and Combinatorial Optimization |
| 12:09–12:21 | Towards a Characterization of Counting and Alternating Classes via Discrete Ordinary Differential Equations: Ongoing Research Report (Short paper) Melissa Antonelli, Eduardo Skapinakis |
| 12:21–12:41 | A Tight Scale-Locality Bound for Partial Detection in Non-Adaptive Group Testing (Long paper) Nader H. Bshouty |
| 12:41–13:01 | Symmetric Conjunctions of NP-Complete Relations: A Complexity Collapse Phenomenon and Its Limits (Long paper) Domenico Cantone, Stefano Savino |
| 13:05–14:40 | Lunch |
| 14:40–15:44 | Quantum Computing |
| 14:40–15:00 | Reduction of the Asymptotic Prefactors for an Optimally Bounded Quantum State Preparation Algorithm (Long paper) Giacomo Belli, Michele Amoretti |
| 15:00–15:12 | Qudit-Based Quantum State Preparation via KP-Trees (Short paper) Simone Ianniciello, Gianna M. Del Corso |
| 15:12–15:24 | State Vector to Block Encoding: An Efficient Quantum Circuit Transformation (Short paper) Giacomo Antonioli, Alessandro Berti, Gianna M. Del Corso, Alessandro Poggiali |
| 15:24–15:44 | Minimizing AOD Trap Activations for Atom Shuttling in Neutral-Atom Quantum Architectures (Long paper) Francesco Decataldo, Christian Bianchini, Enrico Santi |
| 15:45–16:15 | Coffee Break |
| 16:15–17:19 | Quantum Computing |
| 16:15–16:35 | Shallow Quantum Shuffling via Measurement-Driven Multi-Scale Rotations (Long paper) Simone Faro, Francesco Pio Marino, Arianna Pavone |
| 16:35–16:55 | Routing-Free Quantum RAM via Controlled Permutations (Long paper) Simone Faro, Arianna Pavone |
| 16:55–17:07 | Solving Variants of the Multi-Mode Resource Constrained Project Scheduling Problem with Quantum Annealing (Short paper) Marco Baioletti, Angelo Oddi, Riccardo Rasconi |
| 17:07–17:19 | Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction (Short paper) Kostia Chardonnet, Ugo Dal Lago, Naohiko Hoshino, Paolo Pistone |
| 17:20–17:30 | Conference Closing Closing remarks |