Accepted Papers

Alejandro Diaz-Caro and Abuzer Yakaryilmaz
Affine computation and affine automaton

Alexander Kozachinskiy
On Slepian--Wolf Theorem with Interaction

Alexander Okhotin
The hardest language for conjunctive grammars

Alexander Rabinovich
On expressive power of Regular expressions over infinite orders

Alexey Milovanov
Algorithmic statistics: normal objects and universal models

Andris Ambainis, Krisjanis Prusis and Jevgenijs Vihrovs
Sensitivity versus Certificate Complexity of Boolean Functions

Arno Pauly and Florian Steinberg
Representations of analytic functions and Weihrauch degrees

Daniel Moeller, Ramamohan Paturi and Stefan Schneider
Subquadratic Algorithms for Succinct Stable Matching

Hing Yin Tsang, Ning Xie and Shengyu Zhang
Fourier Sparsity of GF(2) Polynomials

Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen and Asaf Levin
Online Bounded Analysis

Katerina Bohmova, Matus Mihalak, Tobias Proger, Gustavo Sacomoto and Marie-France Sagot
Computing and Listing st-Paths in Public Transportation Networks

Laurent Bartholdi
Algorithmic decidability of Engel's property for automaton groups

Manuel Bodirsky and Marcello Mamino
Max-Closed Semilinear Constraint Satisfaction

Manfred Kufleitner and Jan Philipp Wachter
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy

Manfred Kufleitner and Tobias Walter
Level Two of the Quantifier Alternation Hierarchy over Infinite Words

Meena Mahajan and Anuj Tawari
Sums of read-once formulas: How many summands suffice?

Meena Mahajan and Nitin Saurabh
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory

Mike Behrisch, Miki Hermann, Stefan Mengel and Gernot Salzer
The Next Whisky Bar

Partha Mukhopadhyay
Depth-4 Identity Testing and Noether's Normalization Lemma

Patricia Bouyer, Thomas Brihaye, Pierre Carlier and Quentin Menet
Compositional Design of Stochastic Timed Automata

Petr Golovach and George Mertzios
Graph Editing to a Given Degree Sequence

Rene Van Bevern and Artem V. Pyatkin
Completing partial schedules for Open Shop with unit processing times and routing

Rene Van Bevern, Vincent Froese and Christian Komusiewicz
Parameterizing edge modification problems above lower bounds

Sajin Koroth and Shankar Balachandran
Subclasses of Baxter Permutations Based on Pattern Avoidance

Tim Smith
Prediction of Infinite Words with Automata

Toshihiro Fujito and Tomoaki Shimoda
On Approximating (Connected) 2-Edge Dominating Set by a Tree

Victor Y. Pan and Liang Zhao
Low-rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions

Zeev Nutov
Improved approximation algorithms for min-cost connectivity augmentation problems