Invited Papers

Automata and Program Analysis
Thomas Colcombet, Laure Daviaud, and Flonan Zuleger

What One Has to Know When Attacking P vs. NP (Extended Abstract)
Juraj Hromkovic and Peter Rossmanith

A Tour of Recent Results on Word Transducers
Anca Muscholl

Some Results of Zoltan Esik on Regular Languages
Jean-Eric Pin

Contributed Papers

Contextuality in Multipartite Pseudo-Telepathy Graph Games
Anurag Anshu, Peter Hoyer, Mehdi Mhalla, and Simon Perdrix

Generalized Satisfiability Problems via Operator Assignments
Albert Atserias, Phokion G. Kolaitis, and Simone Severini

New Results on Routing via Matchings on Graphs
Indranil Banerjее and Dana Richards

Energy-Efficient Fast Delivery by Mobile Agents
Andreas Bartschi and Thomas Tschager

Parameterized Aspects of Triangle Enumeration
Matthias Bentert, Till Fliischnik, Andre Nichterlein, and Rolf Niedermeier

Testing Polynomial Equivalence by Scaling Matrices
Markus Blaser, В. V. Raghavendra Rao, and Jayalal Sanna

Strong Duality in Horn Minimization
Endre Boros, Ondrej Cepek, and Kazuhisa Makino

Token Jumping in Minor-Closed Classes
Nicolas Bousquet, Amaud Maty, and Aline Parreau

Expressive Power of Evolving Neural Networks Working on Infinite Input Streams
Jeremie Cabessa and Olivier Finkel

Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching
Maxime Crochemore, Alice Heliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, and Yann Ramusat

Subquadratic Non-adaptive Threshold Group Testing
Gianluca De Marco, Tomasz Jurdzinski, Michal Rozanski, and Grzegorz Stachowiak

The Snow Team Problem: (Clearing Directed Subgraphs by Mobile Agents)
Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbahska, and Pawel Zylihski

FO Model Checking on Map Graphs
Kord Eickmeyer and Ken-ichi Kawarabayashi

Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars
Joost Engelfriet and Andreas Maletti

On ... Circuits: The Role of Middle ... Fan-In, Homogeneity and Bottom Degree
Christian Engels, В. V. Raghavendra Rao, and Karteek Sreenivasaiah

Decidable Weighted Expressions with Presburger Combinators
Emmanuel Filiot, Nicolas Mazzocchi, and Jean-Frangois Raskin

The Complexity of Routing with Few Collisions
Till Fluschnik, Marco Morik, and Manuel Sorge

Parikh Image of Pushdown Automata
Pierre Ganty and Elena Gutierrez

Tropical Combinatorial Nullstellensatz and Fewnomials Testing
Dima Grigoriev and Vladimir V. Podolskii

On Weak-Space Complexity over Complex Numbers
PushkarS. Joglekar, B.V. Raghavendra Rao, and Siddhartha Sivakumar

Deterministic Oblivious Local Broadcast in the SINR Model
Tomasz Jurdzinski and Michal Rozanski

Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities
Max Kanovich, Stepan Kuznetsov, and Andre Scedrov

Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words
Christof Loding and Christopher Spin rath

Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time
George Manoussakis

Reliable Communication via Semilattice Properties of Partial Knowledge
Aris Pagourtzis, Giorgos Panagiotakos, and Dimitris Sakavalas

Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs
Charis Papadopoulos and Spyridon Tzimas

Determinism and Computational Power of Real Measurement-Based Quantum Computation
Simon Perdrix and Luc Sanselme

Busy Beaver Scores and Alphabet Size
Holger Petersen

Automatic Kolmogorov Complexity and Normality Revisited
Alexander Shen

Author
Index