Accepted papers
Regular
- Toward Grünbaum’s Conjecture Bounding Vertices of Degree 4
Christian Ortlieb - The Burrows-Wheeler transform of an elastic-degenerate string
Lapo Cioni, Veronica Guerrini and Giovanna Rosone - Completing Wheeler Automata
Giuseppa Castiglione and Antonio Restivo - Quantum Circuit Based Longest Common Substring and Longest Palindromic Substring
Domenico Cantone, Simone Faro, Arianna Pavone and Caterina Viola - The Grothendieck computability model
Luis Gambarte and Iosif Petrakis - Generation of skew convex polyominoes
Michela Ascolese, Andrea Frosini and Simone Rinaldi - A New Directly Accessible Compression Scheme
Simone Faro and Domenico Cantone - ModalFP-Growth: Efficient Extraction of Modal Association Rules from Non-Tabular Data
Mauro Milella, Giovanni Pagliarini, Guido Sciavicco and Ionel Eduard Stan - A comparison between similarity measures based on Minimal Absent Words: an experimental approach
Giuseppa Castiglione, Sabrina Mantaci, Salvatore Leonardo Pizzuto and Antonio Restivo - A process algebraic framework for multi-agent dynamic epistemic systems
Alessandro Aldini - The complexity of boolean failure identification
Nicola Galesi and Fariba Ranjbar - Some properties of the rate functions of large deviations for symbol statistics
Massimiliano Goldwurm and Marco Vignati - Improving Sampled Matching through Character Context Sampling
Simone Faro, Thierry Lecroq, Francesco Pio Marino, Arianna Pavone and Stefano Scafiti - (t,r)-Broadcast Domination in Networks
Gennaro Cordasco, Luisa Gargano and Adele Rescigno - Novel XBWT-based Distance Measures for Labeled Trees
Danilo G. Dolce, Sabrina Mantaci, Giuseppe Romana, Giovanna Rosone and Marinella Sciortino - Minimal Absent Words of Transformations on Words
Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia and Sabrina Mantaci - Proving the Existence of Stable Assignments in Democratic Forking Using Isabelle/HOL
Jan-Georg Smaus - On the pseudorandomness of Parry–Bertrand automatic sequences
Pierre Popoli and Manon Stipulanti - Low-space Quantum Algorithms for Estimate-Mark-Amplify Tasks
Debajyoti Bera and Tharrmashastha Sapv - Families of Constant-Depth Quantum Circuits for Rotations and Permutations
Simone Faro, Arianna Pavone and Caterina Viola - Host-Core Calculi for non classical computations: a first insight
Matteo Palazzo, Luca Paolini, Luca Roversi and Margherita Zorzi
Communications
- Achieving Envy-Freeness through Items Sale
Vittorio Bilò, Evangelos Markakis and Cosimo Vinci - On balancing energy consumption in Multi-Interface Networks
Alessandro Aloisio - Strategy Repair for Reachability Games
Pierre Gaillard, Fabio Patrizi and Giuseppe Perelli - Communication On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
Davide Bilò, Giordano Colli, Luca Forlizzi and Stefano Leucci - Completeness in Partial Type Theory
Jiří Raclavský - Simpson’s proof systems for process verification: A fine-tuning
Cosimo Perini Brogi, Rocco De Nicola and Omar Inverso - Global Types for Agent Interaction Protocols
Federico Bergenti, Leonardo Galliera, Paola Giannini, Stefania Monica and Riccardo Nazzari - Maximum Letter-Duplicated Subsequence
Riccardo Dondi, Mohammad Mehdi Hosseinzadeh and Alexandru Popa - Generalized Distance Polymatrix Games
Alessandro Aloisio, Michele Flammini and Cosimo Vinci - A two player asynchronous game with privacy constraints on Petri nets
Federica Adobbati, Luca Bernardinello and Lucia Pomello - Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations
Melissa Antonelli, Arnaud Durand and Juha Kontinen