<!DOCTYPE html>
<!-- CEURVERSION=2020-07-09 -->
<html lang="en">
<head>
<meta http-equiv="Content-type" content="text/html;charset=utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<link rel="stylesheet" type="text/css" href="../ceur-ws.css">
<title>CEUR-WS.org/Vol-3072 - 22nd Italian Conference on Theoretical Computer Science (ICTCS 2021)</title>
</head>
<!--CEURLANG=eng -->
<body>

<table style="border: 0; border-spacing: 0; border-collapse: collapse; width: 95%">
<tbody><tr>
<td style="text-align: left; vertical-align: middle">
<a href="http://ceur-ws.org/"><div id="CEURWSLOGO"></div></a>
</td>
<td style="text-align: right; vertical-align: middle">
<div style="float:left" id="CEURCCBY"></div>
<span class="CEURVOLNR">Vol-3072</span> <br>
<span class="CEURURN">urn:nbn:de:0074-3072-7</span>
<p class="unobtrusive copyright" style="text-align: justify">Copyright &copy; 2021 for 
the individual papers by the papers' authors. 
Copyright &copy; <span class="CEURPUBYEAR">2021</span> for the volume
as a collection by its editors.
This volume and its papers are published under the
Creative Commons License Attribution 4.0 International
<A HREF="https://creativecommons.org/licenses/by/4.0/">(<span class="CEURLIC">CC BY 4.0</span>)</A>.</p>
</td>
</tr>
</tbody></table>

<hr>
<br><br><br>

<h1><a href="http://helm.cs.unibo.it/ictcs2021/"><span class="CEURVOLACRONYM">ICTCS 2021</span></a><br>
<span class="CEURVOLTITLE">22nd Italian Conference on Theoretical Computer Science 2021</span></h1>
<br>

<h3>
<span class="CEURFULLTITLE">Proceedings of the 22nd Italian Conference on Theoretical Computer Science</span><br>
</h3>
<h3><span class="CEURLOCTIME">Bologna, Italy, September 13-15, 2021</span>.</h3> 
<br>
<b> Edited by </b>
<p>

</p><h3>
   <a href="http://www.cs.unibo.it/~sacerdot/"><span class="CEURVOLEDITOR">Claudio Sacerdoti Coen</span></a> *<br>
   <a href="https://www.di.uniroma1.it/it/docenti/salvo"><span class="CEURVOLEDITOR">Ivano Salvo</span></a> **<br>
</h3>

* <a href="https://www.unibo.it/it/">Universit&agrave; di Bologna</a>, Italy<br>
** <a href="http://www.uniroma1.it/">Sapienza Universit&agrave; di Roma</a>,
   Italy <br>
  <br>

<hr>

<br><br><br>


<div class="CEURTOC">
<h2> Table of Contents </h2>

<ul>
<li id="preface">
<A href="preface.pdf">Preface</A><BR><BR>
</li>
</ul>


<h3><span class="CEURSESSION">Invited Talks</span></h3>


<ul>

<li id="invited1"> 
<span class="CEURTITLE">Lock freedom of binary sessions under strong fairness assumptions (text not included)</span> <br>
<span class="CEURAUTHOR">Luca Padovani</span> 
</li>

<li id="invited2">
<span class="CEURTITLE">On-line Pattern Matching on Degenerate Texts (text not included)</span><br>
<span class="CEURAUTHOR">Nadia Pisanti</span>
</li>
</ul>

<h3><span class="CEURSESSION">IC-EATCS Best Young Researcher</span></h3>

<ul>
<li id="bestresearcher">
<span class="CEURTITLE">Emerging Research Topics in Graph Drawing (text not included)</span><br>
<span class="CEURAUTHOR">Fabrizio Montecchiani</span>
</li>
</ul>

<h3><span class="CEURSESSION">IC-EATCS Best PhD thesis</span></h3>

<ul>
<li id="bestphd1">
<span class="CEURTITLE">Combinatorial Methods for the Analysis of Related Genomic
Sequences (text not included)</span><br>
<span class="CEURAUTHOR">Giulia Bernardini</span>
</li>
</ul>

<ul>
<li id="bestphd2">
<span class="CEURTITLE">Flexible Coinduction (text not included)</span><br>
<span class="CEURAUTHOR">Francesco Dagnino</span>
</li>
</ul>

<h3><span class="CEURSESSION">IC-EATCS Best master thesis</span></h3>

<ul>
<li id="bestthesis">
<span class="CEURTITLE">Some Intensional Versions of Rice's Theorem (text not included) </span><br>
<span class="CEURAUTHOR">Linpeng Zhang</span>
</li>
</ul>


<h3><span class="CEURSESSION">Session 1: Algorithms</span></h3>

<ul>

<li id="paper1"><a href="paper1.pdf">
    <span class="CEURTITLE">Enhancing Characters Distance Text Sampling by Condensed Alphabets</span></a>
 <span class="CEURPAGES">1-15</span> <br>
 <span class="CEURAUTHOR">Simone Faro</span>,
<span class="CEURAUTHOR">Francesco Pio Marino</span>,
<span class="CEURAUTHOR">Arianna Pavone</span>
</li>

<li id="paper2"><a href="paper2.pdf">
    <span class="CEURTITLE">Proving a Conjecture on 8-Distance Coloring of the Infinite Hexagonal Grid</span></a>
<span class="CEURPAGES">16-26</span> <br>
<span class="CEURAUTHOR">Sasthi C. Ghosh</span>,
<span class="CEURAUTHOR">Subhasis Koley</span>
</li>

<li id="paper3"><a href="paper3.pdf">
    <span class="CEURTITLE">A Simple Optimal Contention Resolution Scheme for Uniform Matroids</span></a>
<span class="CEURPAGES">27-39</span> <br>
<span class="CEURAUTHOR">Richard Santiago</span>,
<span class="CEURAUTHOR">Danish Kashaev</span>
</li>

<li id="paper4"><a href="paper4.pdf">
    <span class="CEURTITLE">Cooperative Truck-Drone Scheduling Approach for Last-Mile Deliveries</span></a>
  (short paper)
<span class="CEURPAGES">40-45</span> <br>
<span class="CEURAUTHOR">Francesco Betti Sorbelli</span>,
<span class="CEURAUTHOR">Federico Cor&ograve;</span>,
<span class="CEURAUTHOR">Sajal K. Das</span>,
<span class="CEURAUTHOR">Lorenzo Palazzetti</span>,
<span class="CEURAUTHOR">Cristina M. Pinotti</span>


</li>
</ul>


<h3><span class="CEURSESSION">Session 2: Formal Languages</span></h3>

<ul>

<li id="paper5"><a href="paper5.pdf">
    <span class="CEURTITLE">Ordering Regular Languages: a Danger Zone</span></a>
 <span class="CEURPAGES">46-69</span> <br>
 <span class="CEURAUTHOR">Davide Martincigh</span>, 
 <span class="CEURAUTHOR">Giovanna D'Agostino</span>, 
 <span class="CEURAUTHOR">Alberto Policriti </span>
</li>

<li id="paper6"><a href="paper6.pdf">
    <span class="CEURTITLE">Extended &omega;-Regular Languages and Interval Temporal Logic
   </span></a>
 <span class="CEURPAGES">70-86</span> <br>
 <span class="CEURAUTHOR">Dario Della Monica</span>,
 <span class="CEURAUTHOR">Angelo Montanari</span>,
 <span class="CEURAUTHOR">Pietro Sala</span>
</li>

<li id="paper7"><a href="paper7.pdf">
    <span class="CEURTITLE">Iterated Transduction on Unary Languages</span></a>
  (short paper)
<span class="CEURPAGES">87-92</span> <br>
<span class="CEURAUTHOR">Martin Kutrib</span>,
<span class="CEURAUTHOR">Andreas Malcher</span>,
<span class="CEURAUTHOR">Carlo Mereghetti</span>,
<span class="CEURAUTHOR">Beatrice Palano</span>
</li>
</ul>


<h3><span class="CEURSESSION">Session 3: Logic</span></h3>

<ul>

<li id="paper8"><a href="paper8.pdf">
    <span class="CEURTITLE">A Unifying Four-State Labelling Semantics for Bridging Abstract Argumentation Frameworks and Belief Revision</span></a>
 <span class="CEURPAGES">93-106</span> <br>
<span class="CEURAUTHOR">Stefano Bistarelli</span>,
 <span class="CEURAUTHOR">Carlo Taticchi</span>
</li>


<li id="paper9"><a href="paper9.pdf">
    <span class="CEURTITLE">On Counting Propositional Logic and Wagner's Hierarchy</span></a>
<span class="CEURPAGES">107-121</span> <br>
<span class="CEURAUTHOR">Melissa Antonelli</span>,
<span class="CEURAUTHOR">Ugo Dal Lago</span>,
<span class="CEURAUTHOR">Paolo Pistone</span>
</li>

<li id="paper10"><a href="paper10.pdf">
    <span class="CEURTITLE">Recent Results on Strategy Logic with Imperfect Information</span></a>
  (short paper)
<span class="CEURPAGES">122-128</span> <br>
<span class="CEURAUTHOR">Bastien Maubert</span>
</li>

<li id="paper11"><a href="paper11.pdf">
    <span class="CEURTITLE">Inference From Non-Horn Clauses With Partial Predicates</span></a>
  (short paper)
<span class="CEURPAGES">129-134</span> <br>
<span class="CEURAUTHOR">Alexander Sakharov</span>
</li>
</ul>


<h3><span class="CEURSESSION">Session 4: Concurrency and Decidability</span></h3>

<ul>
<li id="paper12"><a href="paper12.pdf">
    <span class="CEURTITLE">Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets (11) </span></a>
 <span class="CEURPAGES">135-149</span> <br>
 <span class="CEURAUTHOR">Arnaldo Cesco</span>,
 <span class="CEURAUTHOR">Roberto Gorrieri</span>
</li>

<li id="paper13"><a href="paper13.pdf">
    <span class="CEURTITLE">A Decidable Theory Treating Addition of Differentiable Real Functions</span></a>
 <span class="CEURPAGES">150-163</span> <br>
 <span class="CEURAUTHOR">Gabriele Buriola</span>,
 <span class="CEURAUTHOR">Domenico Cantone</span>,
 <span class="CEURAUTHOR">Gianluca Cincotti</span>,
 <span class="CEURAUTHOR">Eugenio Omodeo</span>,
 <span class="CEURAUTHOR">Gaetano Spart&agrave; </span>
</li>

<li id="paper14"><a href="paper14.pdf">
    <span class="CEURTITLE">Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages</span></a>
 <span class="CEURPAGES">164-178</span> <br>
 <span class="CEURAUTHOR">Domenico Cantone</span>,
 <span class="CEURAUTHOR">Pietro Maugeri</span>,
 <span class="CEURAUTHOR">Eugenio Omodeo</span>
 </li>

</ul>

<h3><span class="CEURSESSION">Session 5: Combinatorics</span></h3>

<ul>

<li id="paper15"><a href="paper15.pdf">
    <span class="CEURTITLE">L(2,1)-Edge Labeling of Infinite Triangular Grid</span></a>
 <span class="CEURPAGES">179-192</span> <br>
 <span class="CEURAUTHOR">Susobhan Bandopadhyay</span>,
 <span class="CEURAUTHOR">Sasthi C. Ghosh</span>,
 <span class="CEURAUTHOR">Subhasis Koley</span>
</li>

<li id="paper16"><a href="paper16.pdf">
    <span class="CEURTITLE">On Counting L-Convex Polyominoes</span></a>
  (short paper)
<span class="CEURPAGES">193-198</span> <br>
<span class="CEURAUTHOR">Valentina Dorigatti</span>,
<span class="CEURAUTHOR">Paolo Masazza</span>
</li>

<li id="paper17"><a href="paper17.pdf">
    <span class="CEURTITLE">Reducing the Local Alphabet Size in Tiling Systems for Picture Languages</span></a>
  (short paper)
<span class="CEURPAGES">199-204</span> <br>
<span class="CEURAUTHOR">Stefano Crespi Reghizzi</span>,
<span class="CEURAUTHOR">Antonio Restivo</span>,
<span class="CEURAUTHOR">Pierluigi San Pietro</span>
</li>

</ul>

<h3><span class="CEURSESSION">Session 6: Games</span></h3>

<ul>

<li id="paper18"><a href="paper18.pdf">
    <span class="CEURTITLE">Fractional Hedonic Games With a Limited Number of Coalitions</span></a>
 <span class="CEURPAGES">205-218</span> <br>
 <span class="CEURAUTHOR">Fu Li</span>
</li>

<li id="paper19"><a href="paper19.pdf">
    <span class="CEURTITLE">The Obnoxious Facility Location Game with Dichotomous Preferences</span></a>
<span class="CEURPAGES">219-233</span> <br>
<span class="CEURAUTHOR">Fu Li</span>,
<span class="CEURAUTHOR">Gregor Plaxton</span>,
<span class="CEURAUTHOR">Vaibhav Sinha</span>
</li>

</ul>

<h3><span class="CEURSESSION">Session 7: Complexity</span></h3>

<ul>

<li id="paper20"><a href="paper20.pdf">
    <span class="CEURTITLE">Stability of Special Graph Classes</span></a>
 <span class="CEURPAGES">234-248</span> <br>
 <span class="CEURAUTHOR">Robin Weishaupt</span>,
 <span class="CEURAUTHOR">J&ouml;rge Rothe</span>
</li>

<li id="paper21"><a href="paper21.pdf">
    <span class="CEURTITLE">Nondeterministically Selecting Positive Instances of Context-Free Languages</span></a>
<span class="CEURPAGES">249-265</span> <br>
<span class="CEURAUTHOR">Tomoyuki Yamakami</span>
</li>
</ul>

<h3><span class="CEURSESSION">Session 8: Computation and Deduction</span></h3>

<ul>

<li id="paper22"><a href="paper22.pdf">
    <span class="CEURTITLE">Enhanced Regular Corecursion for Data Streams</span></a>
 <span class="CEURPAGES">266-280</span> <br>
 <span class="CEURAUTHOR">Davide Ancona</span>,
 <span class="CEURAUTHOR">Pietro Barbieri</span>,
 <span class="CEURAUTHOR">Elena Zucca</span>
</li>

<li id="paper23"><a href="paper23.pdf">
    <span class="CEURTITLE">A Filter Model for the State Monad</span></a> (short paper)
<span class="CEURPAGES">281-286</span> <br>
 <span class="CEURAUTHOR">Ugo de'Liguoro</span>,
 <span class="CEURAUTHOR">Riccardo Treglia</span>
</li>
</ul>

<h3><span class="CEURSESSION">Session 9: Quantum Computation and Model Checking</span></h3>

<ul>

<li id="paper24"><a href="paper24.pdf">
    <span class="CEURTITLE">Fast Classical and Quantum Algorithms for Online k-server Problem on Trees</span></a>
 <span class="CEURPAGES">287-301</span> <br>
 <span class="CEURAUTHOR">Ruslan Kapralov</span>,
 <span class="CEURAUTHOR">Kamil Khadiev</span>,
 <span class="CEURAUTHOR">Joshua Mokut</span>,
 <span class="CEURAUTHOR">Yixin Shen</span>,
 <span class="CEURAUTHOR">Maxim Yagafarov</span>
</li>

<li id="paper25"><a href="paper25.pdf">
    <span class="CEURTITLE">Combine Model Checking and Runtime Verification in Multi-Agent Systems</span></a> (short paper)
<span class="CEURPAGES">302-310</span> <br>
 <span class="CEURAUTHOR">Angelo Ferrando</span>,
 <span class="CEURAUTHOR">Vadim Malvone</span>
</li>

<li id="paper26"><a href="paper26.pdf">
    <span class="CEURTITLE">Towards a Model Checking Tool for Strategy Logic with Simple Goals</span></a> (short paper)
<span class="CEURPAGES">311-316</span> <br>
 <span class="CEURAUTHOR">Vadim Malvone</span>,
 <span class="CEURAUTHOR">Silvia Stranieri</span>
</li>
</ul>

<h3><span class="CEURSESSION">Session 10: Strings and Alignments</span></h3>

<ul>

<li id="paper27"><a href="paper27.pdf">
    <span class="CEURTITLE">Hardness of MSA with Selective Column Scoring</span></a>
 <span class="CEURPAGES">317-327</span> <br>
 <span class="CEURAUTHOR">Andrea Caucchiolo</span>,
 <span class="CEURAUTHOR">Ferdinando Cicalese</span>
</li>

<li id="paper28"><a href="paper28.pdf">
    <span class="CEURTITLE">Pruned BNDM: Extending the Bit-Parallel Suffix Automata to Large Strings</span></a>
<span class="CEURPAGES">328-340</span> <br>
 <span class="CEURAUTHOR">Simone Faro</span>,
 <span class="CEURAUTHOR">Stefano Scafiti</span>
</li>
</ul>


</div>

<hr>
<span class="unobtrusive">
2021-12-05: submitted by Ivano Salvo, 
            metadata incl. bibliographic data published under <A HREF="https://creativecommons.org/publicdomain/zero/1.0/">Creative Commons CC0</A><br>
<span class="CEURPUBDATE">2022-01-15</span>: published on CEUR Workshop Proceedings (CEUR-WS.org, ISSN 1613-0073)
	|<a href="https://validator.w3.org/nu/?doc=http%3A%2F%2Fceur-ws.org%2FVol-3072%2F">valid HTML5</a>|
</span>
</body></html>
