List of Accepted Papers Nathalie Aubrun and Marie-Pierre Béal Sofic and almost of finite type tree-shifts Mikhail Berlinkov Approximating the length of synchronizing words Benedikt Bollig and Loic Helouet Realizability of Dynamic MSC Languages Bourgeois Nicolas, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Paschos and Olivier Pottié The max quasi-independent set problem Thomas Brihaye, Véronique Bruyère and Julie De Pril Equilibria in quantitative reachability games Janusz Brzozowski, Galina Jiraskova and Chenglong Zou Quotient Complexity of Closed Languages Olivier Carton Right sequential functions on infinite words Anahí Gajardo and Pierre Guillon Zigzags in Turing Machines Pawel Gawrychowski, Artur Jez and Lukasz Jez Validating the Knuth-Morris-Pratt failure function, fast and online Renat Gimadeev and Mikhail Vyalyi Identical relations in symmetric groups and separating words with reversible automata Nick Gravin Time optimal $d$-list colouring of a graph Bernhard Heinemann The Cantor Space as a Generic Model of Topologically Presented Knowledge Ling-Ju Hung and Ton Kloks Classifying Rankwidth k-DH-Graphs Dmitry Itsykson Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms Gerold Jaeger and Weixiong Zhang A SAT based effective algorithm for the directed Hamiltonian cycle problem Maurice Jansen and Jayalal M.N. Sarma Balancing Bounded Treewidth Circuits Matthew Johnson, Viresh Patel, Daniel Paulusma and Theophile Trunck Obtaining Online Ecological Colourings by Generalizing First-Fit Junhua YU Prehistoric Phenomena and Self-referentiality Elena Kalinina Prefix-free and Prefix-correct Complexities with Compound Conditions Pavel Karpovich Monotone complexity of a pair Vladimir Krupski Symbolic models for single-conclusion proof logics Pavel Martyugin Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA Benaissa Nazim and Dominique Méry Proof-based Design of Security Protocols Victor Y. Pan, Gouliang Qian and AI-Long Zheng On the Power of Randomized Multiplicative Preprocessing Valery Plisko Transfinite Sequences of Constructive Predicate Logics Daniel Raible and Henning Fernau A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem Arseny Shur Growth of power-free languages over large alphabets Iain Stewart and James Gate Frameworks for Logically Classifying Polynomial-time Optimisation Problems A.N. Trahtman A Partially Synchronizing Coloring Nikolay Vereshchagin An Encoding Invariant Version of Polynomial Time Computable Distributions