Accepted papers

• Stefano Berardi, Paulo Oliva and Silvia Steila.
  A Primitive Recursive Bound for the Programs Proved to be Terminating by Terminator

• Luca Bernardinello, Lucia Pomello and Stefania Rombolà.
  Orthomodular Algebraic Lattices Related to Combinatorial Posets

• Marco Bernardo, Flavio Corradini and Luca Tesei.
  Timed Process Calculi: From Durationless Actions to Durational Ones

• Alberto Bertoni, Massimiliano Goldwurm, Jianyi Lin and Linda Pini.
  Size-constrained Biclustering in the Plane with Manhattan Distance

• Stefano Bistarelli, Martine Ceberio, Francesco Santini and Joel A. Henderson.
  Abstract Argumentation Frameworks to Promote Fairness and Rationality in Multi-Experts Multi-Criteria Decision Making

• Arman Boyaci, Tinaz Ekim, Mordechai Shalom and Shmuel Zaks.
  Graphs of Edge-Intersecting and Non-Splitting Paths

• Antonio Bucciarelli, Alberto Carraro, Giordano Favro and Antonino Salibra.
  A Graph-easy Class of Mute Lambda-terms

• Tiziana Calamoneri and Blerina Sinaimeri.
  Relating Threshold Tolerance Graphs to Other Graph Classes

• Arturo Carpi and Flavio D'Alessandro.
  Cerny-like Problems for Finite Sets of Words

• Alberto Casagrande and Eugenio Omodeo.
  Reasoning about Connectivity without Paths

• Alessandra Cherubini and Andrzej Kisielewicz.
  Binary 3-compressible Automata

• Giulianella Coletti, Davide Petturiti and Barbara Vantaggi.
  Extendibility of Choquet Rational Preferences on Generalized Lotteries

• Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra and Cristina M. Pinotti.
  Optimal Placement of Storage Nodes in a Wireless Sensor Network

• Mattia D'Emidio and Daniele Frigioni.
  Engineering Shortest-Path Algorithms for Dynamic Networks

• Andrea Formisano and Flavio Vella.
  On Multiple Learning Schemata in Conflict Driven Solvers

• Laura Giordano, Valentina Gliozzi, Nicola Olivetti and Gian Luca Pozzato.
  Minimal Models for Rational Closure in SHIQ

• Bruno Guillon and Christian Choffrut.
  An Algebraic Characterization of Unary Two-way Transducers

• Giovanna Lavado, Giovanni Pighizzini and Shinnosuke Seki.
  Operational State Complexity under Parikh Equivalence

• Chao Li, Liang Dou and Zongyuan Yang.
  A Metamodeling Level Transformation from UML Sequence Diagrams to Coq

• Roberto Mantaci, Paolo Massazza and Jean-Baptiste Yunè.
  An Efficient Algorithm for Generating Symmetric Ice Piles

• Stefano Mazzanti.
  Logspace Computability and Regressive Machines

• Angelo Montanari, Marco Pazzaglia and Pietro Sala.
  Adding Two Equivalence Relations to the Interval Temporal Logic AB

• Soumen Nandi, Nitish Panigrahy, Mohit Agrawal, Sasthi Ghosh and Sandip Das.
  Efficient Channel Assignment for Cellular Networks Modeled as Honeycomb Grid

• Minh Ngo and Fabio Massacci.
  Programmable Enforcement Framework of Information Flow Policies

• Cosimo Vinci and Vittorio Bilò.
  On the Stackelberg Fuel Pricing Problem

• Tomoyuki Yamakami.
  Structural Complexity of Multi-Valued Partial Functions Computed by Nondeterministic Pushdown Automata