[et_pb_section fb_built=”1″ next_background_color=”#ffffff” _builder_version=”4.16″ background_color=”#8c8c8c” top_divider_color=”#b53319″ bottom_divider_style=”arrow3″ global_colors_info=”{}”][et_pb_row _builder_version=”4.16″ custom_margin=”-26px|auto||auto||” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_text _builder_version=”4.17.4″ global_colors_info=”{}”]<\/p>\n
[\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section fb_built=”1″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_row _builder_version=”4.16″ global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_text _builder_version=”4.17.4″ hover_enabled=”0″ inline_fonts=”Georgia” global_colors_info=”{}” sticky_enabled=”0″]<\/p>\n
Mauro Milella and Andrea Paradiso<\/em><\/span><\/p>\n Tiziana Calamoneri, Angelo Monti and Blerina Sinaimeri<\/em><\/p>\n Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso and Riccardo Guidotti<\/em><\/p>\n Antonio Di Stasio<\/a><\/em><\/span><\/p>\n Golnaz Badkobeh, Sara Giuliani, <\/a>Zsuzsanna Lipt\u00e1k<\/a> <\/span>and Simon Puglisi<\/span><\/em><\/p>\n <\/a>Marino Miculan<\/a><\/span> and Matteo Paier<\/span><\/em><\/p>\n Munyque Mittelmann, Bastien Maubert, Aniello Murano and Laurent Perrussel<\/em><\/p>\n Riccardo Dondi<\/em><\/p>\n Paolo Massazza<\/a><\/em><\/span><\/p>\n Robert Barish and Tetsuo Shibuya<\/em><\/p>\n Davide Ancona, Pietro Barbieri and Elena Zucca<\/em><\/p>\n Sara Giuliani, <\/a>Zsuzsanna Liptak<\/a><\/span> and Francesco Masillo<\/em><\/p>\n Jasine Babu, K. Murali Krishnan, Veena Prabhakaran and Nandini J. Warrier<\/em><\/p>\n Vittorio Bil\u00f2, Diodato Ferraioli and Cosimo Vinci<\/em><\/p>\n Vittorio Bil\u00f2, Gianpiero Monaco, Luca Moscardelli and Cosimo Vinci<\/em><\/p>\n Lorenzo Perticone and Ivano Salvo<\/em><\/p>\n Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli and Alessandra Tappini<\/em><\/p>\n Michele Pasqua and <\/a>Marino Miculan<\/a><\/em><\/span><\/p>\n Caterina Feletti, Carlo Mereghetti, Beatrice Palano and Priscilla Raucci<\/em><\/p>\n Riccardo Bianchini, Francesco Dagnino, Paola Giannini and Elena Zucca<\/em><\/p>\n Donatella Merlini and Maria Cecilia Verri<\/em><\/p>\n Marco Campion, Mila Dalla Preda and Roberto Giacobazzi<\/em><\/p>\n Simone Faro and <\/a>Arianna Pavone<\/a><\/em><\/span><\/p>\n Louis Noizet and Alan Schmitt<\/em><\/p>\n Brian Riccardi, Riccardo Romanello, Alberto Policriti and Christian Bianchini<\/em><\/p>\n <\/span><\/strong><\/p>\n <\/span><\/strong><\/p>\n <\/strong><\/p>\n [\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section fb_built=”1″ _builder_version=”4.16″ global_colors_info=”{}”][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":" Accepted PapersOn Modal Logic Association Rule Mining Mauro Milella and Andrea Paradiso On the domination number of t-constrained de Bruijn graphs\u00a0 Tiziana Calamoneri, Angelo Monti and Blerina Sinaimeri Clustering Classical Data with Quantum k-Means Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso and Riccardo Guidotti LTLf Synthesis Under Environment Specifications Antonio Di Stasio […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":""},"_links":{"self":[{"href":"https:\/\/easyconferences.eu\/ictcs2022\/wp-json\/wp\/v2\/pages\/338"}],"collection":[{"href":"https:\/\/easyconferences.eu\/ictcs2022\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/easyconferences.eu\/ictcs2022\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ictcs2022\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ictcs2022\/wp-json\/wp\/v2\/comments?post=338"}],"version-history":[{"count":8,"href":"https:\/\/easyconferences.eu\/ictcs2022\/wp-json\/wp\/v2\/pages\/338\/revisions"}],"predecessor-version":[{"id":357,"href":"https:\/\/easyconferences.eu\/ictcs2022\/wp-json\/wp\/v2\/pages\/338\/revisions\/357"}],"wp:attachment":[{"href":"https:\/\/easyconferences.eu\/ictcs2022\/wp-json\/wp\/v2\/media?parent=338"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}On the domination number of t-constrained de Bruijn graphs\u00a0<\/span><\/strong><\/h4>\n
Clustering Classical Data with Quantum k-Means<\/strong><\/h4>\n
LTLf Synthesis Under Environment Specifications<\/strong><\/h4>\n
On Compressing Collections of Substring Samples<\/strong><\/h4>\n
A Calculus for Subjective Communication<\/strong><\/h4>\n
Synthesis of Mechanisms with Strategy Logic<\/span><\/strong><\/h4>\n
Insights into the Complexity of Disentangling Temporal Graphs<\/span><\/strong><\/h4>\n
On Counting k-Convex Polyominoes<\/span><\/strong><\/h4>\n
Counting on a rainbow connection (presentation only)<\/span><\/strong><\/h4>\n
Equality of corecursive streams defined by finitary equational systems<\/span><\/strong><\/h4>\n
When a Dollar in a Fully Clustered Word Makes a BWT<\/span><\/strong><\/h4>\n
Computing eternal vertex cover number of maximal outerplanar graphs in linear time<\/span><\/strong><\/h4>\n
General Opinion Formation Games with Social Group Membership<\/span><\/strong><\/h4>\n
Nash Social Welfare in Selfish and Online Load Balancing<\/span><\/strong><\/h4>\n
Monad Transformers as Parametric Distributive Laws\u00a0<\/span><\/strong>(presentation only)<\/span><\/strong><\/h4>\n
On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem<\/span><\/strong><\/h4>\n
Distributed Programming of Smart Systems with Event-Condition-Action Rules<\/span><\/strong><\/h4>\n
Uniform Circle Formation for Fully, Semi-, and Asynchronous Opaque Robots with Lights<\/span><\/strong><\/h4>\n
A Java-like calculus with user-defined coeffects<\/span><\/strong><\/h4>\n
Educational Data Mining for inclusion <\/span><\/strong>(presentation only)<\/span><\/strong><\/h4>\n
On the Properties of Partial Completeness in Abstract Interpretation<\/span><\/strong><\/h4>\n
High Performance String Matching Using Bit Layers Text Representation\u00a0<\/span><\/strong>(presentation only)<\/span><\/strong><\/h4>\n
Semantics in Skel and Necro<\/span><\/strong><\/h4>\n
Incremental NFA Minimization<\/strong><\/h4>\n