Accepted Papers

List of papers accepted for presentation at ICTCS 2017
  • Massimo Benerecetti and Marco Faella. Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control
  • Ferdinando Cicalese and Massimiliano Rossi. On the Multi-Interval Ulam-Rényi Game: for 3 lies 4 intervals suffice
  • Ugo Dal Lago, Francesco Gavazzo and Ryo Tanaka. Effectful Applicative Similarity for Call-by-Name Lambda Calculi
  • Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti and Rossella Petreschi. Some Classes of Graphs that are not Pairwise Compatibility Graphs
  • Luca Spalazzi and Francesco Spegni. On The Existence of Cutoffs for Model-Checking Disjunctive Timed Networks
  • Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak and Marcin Witkowski. Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs
  • Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini and Maurizio Patrignani. Visualizing Reconciliations in Co-Phylogeny
  • Enrico Cominato, Dario Della Monica, Angelo Montanari and Guido Sciavicco. A Model Checker for Interval Temporal Logic over Finite Structures
  • Diodato Ferraioli and Carmine Ventre. Obvious strategyproofness needs monitoring for good approximations
  • Marc Neveling and Jörg Rothe. Closing the Gap of Control Complexity in Borda Elections: Solving Ten Open Cases
  • Massimo Benerecetti, Daniele Dell’Erba and Fabio Mogavero. The Priority Promotion Approach to Parity Games
  • Mauro Leoncini, Gianluca De Marco, Lucia Mazzali and Manuela Montangero. Distributed beta-Assignment on Graphs
  • Feliciano Colella, Guido Proietti and Mattia D’Emidio. Simple and Practically Efficient Fault-Tolerant 2-Hop Cover Labelings
  • Vincenzo Auletta, Diodato Ferraioli, Ashutosh Rai, Giannicola Scarpa and Andreas Winter. Belief-Invariant and Quantum Equilibria in Games of Incomplete Information
  • Vittorio Bilò and Cosimo Vinci. On the Impact of Singleton Strategies in Congestion Games
  • Mattia D’emidio and Imran Khan. Multi-Robot Task Allocation Problem: Current Trends and New Ideas
  • Marino Miculan and Marco Peressotti. Deciding weak weighted bisimulation
  • Ziyuan Gao and Boting Yang. The One-Cop-Moves Game on Planar Graphs
  • David Barozzini, Dario Della Monica, Angelo Montanari and Pietro Sala. Counter-queue automata with an application to a meaningful extension of omega-regular languages
  • Murilo de Lima, Mário César San Felice and Orlando Lee. Connected Facility Leasing Problems
  • Dragisa Zunic and Pierre Lescanne. A Congruence Relation for Restructuring Classical Terms
  • Marco Baldi, Ezio Bartocci, Franco Chiaraluce, Alessandro Cucchiarelli, Linda Senigagliesi, Luca Spalazzi and Francesco Spegni. A Probabilistic Small Model Theorem to Assess Confidentiality of Dispersed Cloud Storage
  • Vincent Vajnovszki. The equidistribution of some vincular patterns on 132-avoiding permutations
  • Michele Pasqua and Isabella Mastroeni. On Topologies for (Hyper)Properties
  • Doriana Medic and Claudio Antares Mezzina. Towards Reversible Causalities in -calculus
  • Mark Korenblit and Vadim E. Levit. Graph Expression Complexities and Simultaneous Linear Recurrences