ICTCS 2022
23rd Italian Conference on Theoretical Computer Science 2022

Table of Contents

• Preface
  
  

Invited Talks

• A Journey Through the Spectrum of Monitorability (text not included)
  Luca Aceto
• Unsplittable Flow on a Path and Related Problems (text not included)
  Fabrizio Grandoni

IC-EATCS Best Young Researcher

• Paths and Walks Problems in Temporal Graphs (text not included)
  Andrea Marino

IC-EATCS Best PhD Thesis

• STM-based Safety Verification of Data-Aware Processes: Foundations and Applications (text not included)
  Alessandro Gianola
• Learning-Based Compressed Data Structures (text not included)
  Giorgio Vinciguerra

IC-EATCS Best Master Thesis

• The Longest Repeated String Problem on Graphs (text not included)
  Nicola Rizzo

Session 1: Graph Algorithms

• Insights into the Complexity of Disentangling Temporal Graphs 1-13
  Riccardo Dondi
• On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem 14-20
  Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
• Computing Eternal Vertex Cover Number on Maximal Outerplanar Graphs in Linear Time 21-33
  Jasine Babu, Karunakaran Murali Krishnan, Veena Prabhakaran, Nandini J. Warrier
• On the Domination Number of t-Constrained de Bruijn Graphs 34-39
  Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri

Session 2: Logic

• LTLf Synthesis Under Environment Specifications 40-46
  Antonio Di Stasio
• Synthesis of Mechanisms with Strategy Logic 47-52
  Munyque Mittelmann, Bastien Maubert, Aniello Murano, Laurent Perrussel
• On Modal Logic Association Rule Mining 53-65
  Ionel Eduard Stan, Guido Sciavicco, Emilio Muñoz-Velasco, Giovanna Pagliarini, Mauro Milella, Andrea Paradiso

Session 3: Types and Semantics

• A Java-Like Calculus with User-Defined Coeffects 66-78
  Riccardo Bianchini, Francesco Dagnino, Paola Giannini, Elena Zucca
• On the Properties of Partial Completeness in Abstract Interpretation 79-85
  Marco Campion, Mila Dalla Preda, Roberto Giacobazzi
• Equality of Corecursive Streams Defined by Finitary Equational Systems 86-98
  Davide Ancona, Pietro Barbieri, Elena Zucca
• Semantics in Skel and Necro 99-115
  Louis Noizet, Alan Schmitt

Session 4: Counting and Combinatorics

• On Counting k-Convex Polyominoes 116-121
  Paolo Massazza
• When a Dollar in a Fully Clustered Word Makes a BWT 122-135
  Sara Giuliani, Zsuzsanna Liptàk, Francesco Masillo
• On Compressing Collections of Substring Samples 136-147
  Golnaz Badkobeh, Sara Giuliani, Zsuzsanna Liptàk, Simon Puglisi

Session 5: Concurrency and Automata + Game Theory

• A Calculus for Subjective Communication 148-160
  Marino Miculan, Matteo Paier
• Incremental NFA Minimization 161-173
  Brian Riccardi, Riccardo Romanello, Alberto Policriti, Christian Bianchini
• General Opinion Formation Games with Social Group Membership 174-179
  Vittorio Bilò, Diodato Ferraioli, Cosimo Vinci
• Nash Social Welfare in Selfish and Online Load Balancing 180-187
  Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci

Session 6: Machine Learning and Autonomic Computing

• Clustering Classical Data with Quantum k-Means 188-200
  Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna Maria Del Corso, Riccardo Guidotti
• Distributed Programming of Smart Systems with Event-Condition-Action Rules 201-206
  Michele Pasqua, Marino Miculan
• Uniform Circle Formation for Fully Semi-, and Asynchronous Opaque Robots with Lights 207-221
  Caterina Feletti, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci

Session 7: Short Presentations

• Monad Transformations as Parametric Distributive Laws (text not included)
  Lorenzo Petricone, Ivano Salvo
• Counting on a Rainbow Connection (text not included)
  Robert Barish, Tetsuo Shibuya