<figure><img src="image_1.png" /></figure>

HAL
open science

36th International Symposium on Theoretical Aspects of
Computer Science (STACS 2019)

Rolf Niedermeier, Christophe Paul

► To cite this version:

Rolf Niedermeier, Christophe Paul. 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019): March 13-16, 2019, Berlin, Germany. Leibniz International Proceedings in Informatics, 126, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019, 978-3-95977-084-2. 10.4230/LIPIcs.STACS.2019.0. lirmm-02075651

HAL Id: lirmm-02075651

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02075651

Submitted on 27 Sep 2023

**HAL** is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_2.png" /></figure>

Distributed under a Creative Commons Attribution 4.0 International License
36th International Symposium
on Theoretical Aspects of
Computer Science

STACS 2019, March 13–16, 2019, Berlin, Germany

Edited by

Rolf Niedermeier

Christophe Paul

<figure><img src="image_3.png" /></figure>

LIPICS

<figure><img src="image_4.png" /></figure>

LIPICS - Vol. 126 - STACS 2019

www.dagstuhl.de/lipics
Editors

**Rolf Niedermeier**

Algorithmics and Computational Complexity, Fakultät IV, TU Berlin, Berlin, Germany
rolf.niedermeier@tu-berlin.de

**Christophe Paul**

CNRS, Université de Montpellier, LIRMM, Montpellier, France
christophe.paul@lirmm.fr

*ACM Classification 2012*

Theory of computation → Models of computation; Mathematics of computing → Combinatorics; Mathematics of computing → Graph theory; Theory of computation → Formal languages and automata theory; Theory of computation → Logic; Theory of computation → Parameterized complexity and exact algorithms

ISBN 978-3-95977-100-9

*Published online and open access by*

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany. Online available at https://www.dagstuhl.de/dagpub/978-3-95977-100-9.

*Publication date*

March, 2019

*Bibliographic information published by the Deutsche Nationalbibliothek*

The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at https://portal.dnb.de.

*License*

This work is licensed under a Creative Commons Attribution 3.0 Unported license (CC-BY 3.0):
https://creativecommons.org/licenses/by/3.0/legalcode.

In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors' moral rights:

Attribution: The work must be attributed to its authors.

The copyright is retained by the corresponding authors.

<figure><img src="image_5.png" /></figure>

Digital Object Identifier: 10.4230/LIPIcs.STACS.2019.0

ISBN 978-3-95977-100-9

ISSN 1868-8969

https://www.dagstuhl.de/lipics
LIPIcs – Leibniz International Proceedings in Informatics

LIPIcs is a series of high-quality conference proceedings across all fields in informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge.

Editorial Board

■ Luca Aceto (Chair, Gran Sasso Science Institute and Reykjavik University)

■ Susanne Albers (TU München)

■ Christel Baier (TU Dresden)

■ Javier Esparza (TU München)

■ Michael Mitzenmacher (Harvard University)

■ Madhavan Mukund (Chennai Mathematical Institute)

■ Anca Muscholl (University Bordeaux)

■ Catuscia Palamidessi (INRIA)

■ Raimund Seidel (Saarland University and Schloss Dagstuhl – Leibniz-Zentrum für Informatik)

■ Thomas Schwentick (TU Dortmund)

■ Reinhard Wilhelm (Saarland University)

ISSN 1868-8969

https://www.dagstuhl.de/lipics
<figure><img src="image_6.png" /></figure>
<figure><img src="image_7.png" /></figure>

# Contents

Foreword

<table><tr><td>Rolf Niedermeier and Christophe Paul</td><td>0:ix</td></tr></table>

## Invited Talks

Computational Complexity and Partition Functions

<table><tr><td>Leslie Ann Goldberg</td><td>1:1–1:3</td></tr></table>

The Many Facets of String Transducers

<table><tr><td>Anca Muscholl and Gabriele Puppis</td><td>2:1–2:21</td></tr></table>

Algorithmic Data Science

<table><tr><td>Petra Mutzel</td><td>3:1–3:15</td></tr></table>

## Tutorials

Fine-Grained Complexity Theory

<table><tr><td>Karl Bringmann</td><td>4:1–4:7</td></tr></table>

From Graph Theory to Network Science:

The Natural Emergence of Hyperbolicity

<table><tr><td>Tobias Friedrich</td><td>5:1–5:9</td></tr></table>

## Regular Contributions

The Semialgebraic Orbit Problem

<table><tr><td>Shaull Almagor, Joël Ouaknine, and James Worrell</td><td>6:1–6:15</td></tr></table>

Best-Of-Two-Worlds Analysis of Online Search

<table><tr><td>Spyros Angelopoulos, Christoph Dürr, and Shendan Jin</td><td>7:1–7:17</td></tr></table>

Bipartite Diameter and Other Measures Under Translation

<table><tr><td>Boris Aronov, Omrit Filtser, Matthew J. Katz, and Khadijah Sheikhan</td><td>8:1–8:14</td></tr></table>

Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule

<table><tr><td>David Auger, Pierre Coucheney, and Yann Strozecki</td><td>9:1–9:16</td></tr></table>

Distributed Coloring of Graphs with an Optimal Number of Colors

<table><tr><td>Étienne Bamas and Louis Esperet</td><td>10:1–10:15</td></tr></table>

On the Descriptive Complexity of Color Coding

<table><tr><td>Max Bannach and Till Tantau</td><td>11:1–11:16</td></tr></table>

Bounding Quantum-Classical Separations for Classes of Nonlocal Games

<table><tr><td>Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, and Troy Lee</td><td>12:1–12:11</td></tr></table>

Token Sliding on Split Graphs

<table><tr><td>Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, and Florian Sikora</td><td>13:1–13:17</td></tr></table>

36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019).

Editors: Rolf Niedermeier and Christophe Paul

<figure><img src="image_8.png" /></figure>

Leibniz International Proceedings in Informatics
LIPICS Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

<figure><img src="image_9.png" /></figure>
<table>
  <tbody>
    <tr>
      <td>Building Strategies into QBF Proofs<br><i>Olaf Beyersdorff, Joshua Blinkhorn, and Meena Mahajan</i></td>
      <td>14:1-14:18</td>
    </tr>
    <tr>
      <td>Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line<br><i>Alexander Birx and Yann Disser</i></td>
      <td>15:1-15:17</td>
    </tr>
    <tr>
      <td>Enumerating Minimal Dominating Sets in Triangle-Free Graphs<br><i>Marthe Bonamy, Oscar Defrain, Marc Heinrich, and Jean-Florent Raymond</i></td>
      <td>16:1-16:12</td>
    </tr>
    <tr>
      <td>Sparsification of Binary CSPs<br><i>Silvia Butti and Stanislav Živný</i></td>
      <td>17:1-17:8</td>
    </tr>
    <tr>
      <td>Tractable QBF by Knowledge Compilation<br><i>Florent Capelli and Stefan Mengel</i></td>
      <td>18:1-18:16</td>
    </tr>
    <tr>
      <td>A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs<br><i>Parinya Chalermsook, Andreas Schmid, and Sumedha Uniyal</i></td>
      <td>19:1-19:14</td>
    </tr>
    <tr>
      <td>Average-Case Completeness in Tag Systems<br><i>Matthew Cook and Turlough Neary</i></td>
      <td>20:1-20:17</td>
    </tr>
    <tr>
      <td>Pairwise Preferences in the Stable Marriage Problem<br><i>Ágnes Cseh and Attila Juhos</i></td>
      <td>21:1-21:16</td>
    </tr>
    <tr>
      <td>Closure Properties of Synchronized Relations<br><i>María Emilia Descotte, Diego Figueira, and Santiago Figueira</i></td>
      <td>22:1-22:17</td>
    </tr>
    <tr>
      <td>Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts<br><i>Julien Destombes and Andrei Romashchenko</i></td>
      <td>23:1-23:17</td>
    </tr>
    <tr>
      <td>Constant-Time Retrieval with O(log m) Extra Bits<br><i>Martin Dietzfelbinger and Stefan Walzer</i></td>
      <td>24:1-24:16</td>
    </tr>
    <tr>
      <td>Complexity of the Steiner Network Problem with Respect to the Number of Terminals<br><i>Eduard Eiben, Dušan Knop, Fahad Panolan, and Ondřej Suchý</i></td>
      <td>25:1-25:17</td>
    </tr>
    <tr>
      <td>Space Lower Bounds for the Signal Detection Problem<br><i>Faith Ellen, Rati Gelashvili, Philipp Woelfel, and Leqi Zhu</i></td>
      <td>26:1-26:13</td>
    </tr>
    <tr>
      <td>Progressive Algorithms for Domination and Independence<br><i>Grzegorz Fabiański, Michal Pilipczuk, Sebastian Siebertz, and Szymon Toruńczyk</i></td>
      <td>27:1-27:16</td>
    </tr>
    <tr>
      <td>Modification to Planarity is Fixed Parameter Tractable<br><i>Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos</i></td>
      <td>28:1-28:17</td>
    </tr>
    <tr>
      <td>Visibly Pushdown Languages over Sliding Windows<br><i>Moses Ganardi</i></td>
      <td>29:1-29:17</td>
    </tr>
    <tr>
      <td>Fast and Longest Rollercoasters<br><i>Pawel Gawrychowski, Florin Manea, and Radosław Serafin</i></td>
      <td>30:1-30:17</td>
    </tr>
    <tr>
      <td>Wealth Inequality and the Price of Anarchy<br><i>Kurtuluş Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, and Georgios Piliouras</i></td>
      <td>31:1-31:16</td>
    </tr>
  </tbody>
</table>
<table>
  <tbody>
    <tr>
      <td>Lean Tree-Cut Decompositions: Obstructions and Algorithms<br>Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, and Dimitrios M. Thilikos</td>
      <td>32:1-32:14</td>
    </tr>
    <tr>
      <td>Dispersing Obnoxious Facilities on a Graph<br>Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, and Gerhard J. Woeginger</td>
      <td>33:1-33:11</td>
    </tr>
    <tr>
      <td>Reachability in O(log n) Genus Graphs is in Unambiguous Logspace<br>Chetan Gupta, Vimal Raj Sharma, and Raghunath Tewari</td>
      <td>34:1-34:13</td>
    </tr>
    <tr>
      <td>Dominating Sets and Connected Dominating Sets in Dynamic Graphs<br>Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, and David Saulpic</td>
      <td>35:1-35:17</td>
    </tr>
    <tr>
      <td>On Kernelization for Edge Dominating Set under Structural Parameters<br>Eva-Maria C. Hols and Stefan Kratsch</td>
      <td>36:1-36:18</td>
    </tr>
    <tr>
      <td>Compressed Decision Problems in Hyperbolic Groups<br>Derek Holt, Markus Lohrey, and Saul Schleimer</td>
      <td>37:1-37:16</td>
    </tr>
    <tr>
      <td>How to Secure Matchings Against Edge Failures<br>Felix Hommelsheim, Moritz Mühlenthaler, and Oliver Schaudt</td>
      <td>38:1-38:16</td>
    </tr>
    <tr>
      <td>A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs<br>Bart M. P. Jansen, Marcin Pilipczuk, and Erik Jan van Leeuwen</td>
      <td>39:1-39:18</td>
    </tr>
    <tr>
      <td>A Characterization of Subshifts with Computable Language<br>Emmanuel Jeandel and Pascal Vanier</td>
      <td>40:1-40:16</td>
    </tr>
    <tr>
      <td>Lower Bounds for DeMorgan Circuits of Bounded Negation Width<br>Stasys Jukna and Andrzej Lingas</td>
      <td>41:1-41:17</td>
    </tr>
    <tr>
      <td>Depth First Search in the Semi-streaming Model<br>Shahbaz Khan and Shashank K. Mehta</td>
      <td>42:1-42:16</td>
    </tr>
    <tr>
      <td>On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words<br>Stefan Kiefer and Corto Mascle</td>
      <td>43:1-43:13</td>
    </tr>
    <tr>
      <td>Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints<br>Dušan Knop, Michal Pilipczuk, and Marcin Wrochna</td>
      <td>44:1-44:15</td>
    </tr>
    <tr>
      <td>The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern<br>Robert Krauthgamer and Ohad Trabelsi</td>
      <td>45:1-45:15</td>
    </tr>
    <tr>
      <td>Algorithmic Properties of Sparse Digraphs<br>Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, and Sebastian Siebertz</td>
      <td>46:1-46:20</td>
    </tr>
    <tr>
      <td>Tree Automata with Global Constraints for Infinite Trees<br>Patrick Landwehr and Christof Löding</td>
      <td>47:1-47:15</td>
    </tr>
    <tr>
      <td>Constructive Discrepancy Minimization with Hereditary L2 Guarantees<br>Kasper Green Larsen</td>
      <td>48:1-48:13</td>
    </tr>
    <tr>
      <td>Quantum Advantage for the LOCAL Model in Distributed Computing<br>François Le Gall, Harumichi Nishimura, and Ansis Rosmanis</td>
      <td>49:1-49:14</td>
    </tr>
  </tbody>
</table>
<table>
  <tbody>
    <tr>
      <td>Lifting Theorems for Equality<br><i>Bruno Loff and Sagnik Mukhopadhyay</i></td>
      <td>50:1–50:19</td>
    </tr>
    <tr>
      <td>Car-Sharing on a Star Network: On-Line Scheduling with <i>k</i> Servers<br><i>Kelin Luo, Thomas Erlebach, and Yinfeng Xu</i></td>
      <td>51:1–51:14</td>
    </tr>
    <tr>
      <td>Beyond Boolean Surjective VCSPs<br><i>Gregor Matl and Stanislav Živný</i></td>
      <td>52:1–52:15</td>
    </tr>
    <tr>
      <td>The Containment Problem for Unambiguous Register Automata<br><i>Antoine Mottet and Karin Quaas</i></td>
      <td>53:1–53:15</td>
    </tr>
    <tr>
      <td>Stabilization Time in Weighted Minority Processes<br><i>Pál András Papp and Roger Wattenhofer</i></td>
      <td>54:1–54:15</td>
    </tr>
    <tr>
      <td>Finite Sequentiality of Unambiguous Max-Plus Tree Automata<br><i>Erik Paul</i></td>
      <td>55:1–55:17</td>
    </tr>
    <tr>
      <td>Paging with Dynamic Memory Capacity<br><i>Enoch Peserico</i></td>
      <td>56:1–56:18</td>
    </tr>
    <tr>
      <td>Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension<br><i>Gleb Posobin and Alexander Shen</i></td>
      <td>57:1–57:14</td>
    </tr>
    <tr>
      <td>A Unified Approach to Tail Estimates for Randomized Incremental Construction<br><i>Sandeep Sen</i></td>
      <td>58:1–58:16</td>
    </tr>
    <tr>
      <td>A ZPP<sup>NP</sup>[1] Lifting Theorem<br><i>Thomas Watson</i></td>
      <td>59:1–59:16</td>
    </tr>
  </tbody>
</table>
<figure><img src="image_10.png" /></figure>

Foreword

The International Symposium on Theoretical Aspects of Computer Science (STACS) conference series is an internationally leading forum for original research on theoretical aspects of computer science. Typical areas are:

- algorithms and data structures, including: design of parallel, distributed, approximation, parameterized and randomized algorithms; analysis of algorithms and combinatorics of data structures; computational geometry, cryptography, algorithmic learning theory, algorithmic game theory;

- automata and formal languages, including: algebraic and categorical methods, coding theory;

- complexity and computability, including: computational and structural complexity theory, parameterized complexity, randomness in computation;

- logic in computer science, including: finite model theory, database theory, semantics, specification verification, rewriting and deduction;

- current challenges, for example: natural computing, quantum computing, mobile and net computing, computational social choice.

STACS is held alternately in France and in Germany. This year's conference (taking place March 13-16 in Berlin) is the 36th in the series. Previous meetings took place in Paris (1984), Saarbrücken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), Würzburg (1993), Caen (1994), München (1995), Grenoble (1996), Lübeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), Bordeaux (2008), Freiburg (2009), Nancy (2010), Dortmund (2011), Paris (2012), Kiel (2013), Lyon (2014), München (2015), Orléans (2016), Hannover (2017), Caen (2018).

The interest in STACS has remained at a very high level over the past years. The STACS 2019 call for papers led to 260 submissions with authors from 39 countries. Each paper was assigned to three program committee members who, at their discretion, asked external reviewers for reports. The committee selected 54 papers during a three-week electronic meeting held in November/December 2018. This means an acceptance rate of only 21%. For the fifth time within the STACS conference series, there was also a rebuttal period during which authors could submit remarks to the PC concerning the reviews of their papers. As co-chairs of the program committee, we would like to sincerely thank all its members and 491 external reviewers for their valuable work. In particular, there were intense and interesting discussions inside the PC committee. The overall very high quality of the submissions made the selection an extremely difficult task. This year, the conference includes two invited tutorials. We would like to express our thanks to the speakers Karl Bringmann (Saarbrücken) and Tobias Friedrich (Potsdam) for their tutorials, as well as to the three invited speakers, Leslie Ann Goldberg (Oxford), Anca Muscholl (Bordeaux), and Petra Mutzel (Dortmund). Special thanks go to the local organizing committee for continuous help throughout the conference organization. In particular, we wish to thank Till Fluschnik for his day-to-day support on the technical side and Christlinde Thielcke for her permanent administrative support. We also thank André Nichterlein for his final assistance in producing the conference proceedings and TUBS GmbH for their handling of financial accounting.

36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019).

Editors: Rolf Niedermeier and Christophe Paul

<figure><img src="image_11.png" /></figure>

Leibniz International Proceedings in Informatics

LIPICS Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

<figure><img src="image_12.png" /></figure>
0:x Foreword

Moreover, we thank Michael Wagner from the Dagstuhl/LIPIcs team for assisting us in the publication process and the final production of the proceedings. These proceedings contain extended abstracts of the accepted contributions and abstracts of the invited talks and the tutorials. The authors retain their rights and make their work available under a Creative Commons license. The proceedings are published electronically by Schloss Dagstuhl – Leibniz-Center for Informatics within their LIPIcs series. STACS 2019 has received funds and help from the Deutsche Forschungsgemeinschaft (DFG) and support and help from the Technische Universität Berlin (TU Berlin), for which we are very grateful.

Berlin and Montpellier, March 2019

Rolf Niedermeier and Christophe Paul
<figure><img src="image_13.png" /></figure>

# Conference Organization

## Program Committee

Christoph Berkholz

Benedikt Bollig

Karl Bringmann

Gerth Stølting Brodal

Maike Buchin

David Eppstein

Serge Gaspers

Edward Hirsch

Telikepalli Kavitha

Hartmut Klauck

Antonín Kučera

K Narayan Kumar

Dietrich Kuske

Jérôme Lang

Sophie Laplante

Kazuhisa Makino

Barnaby Martin

Cyril Nicaud

Rolf Niedermeier

Jakob Nordström

Christophe Paul

Pascal Schweitzer

Shinnosuke Seki

Michał Skrzypczak

Srikanth Srinivasan

Jan Arne Telle

Denis Trystram

Takeaki Uno

Mikhail Volkov

Stefan Woltran

Humboldt-Universität zu Berlin

LSV & ENS Paris-Saclay, CNRS

Max Planck Institute for Informatics, Saarbrücken

Aarhus University

Ruhr-Universität Bochum

University of California, Irvine

UNSW Sydney and Data61, CSIRO

St. Petersburg State University

Tata Institute of Fundamental Research, Mumbai

National University of Singapore

Masaryk University, Brno

Chennai Mathematical Institute

TU Ilmenau

CNRS, LAMSADE, Université Paris-Dauphine

IRIF, Université Paris Diderot

Kyoto University

Durham University

Université Paris Est, LIGM

TU Berlin (co-chair)

KTH Royal Institute of Technology, Stockholm

LIRMM, CNRS, Université de Montpellier (co-chair)

TU Kaiserslautern

University of Electro-Communications, Tokyo

University of Warsaw

Indian Institute of Technology Bombay, Mumbai

University of Bergen

University Grenoble Alpes

National Institute of Informatics, Tokyo

Ural Federal University, Ekaterinburg

TU Wien
Local Organizing Committee (TU Berlin)

Matthias Bentert

Robert Bredereck

Till Fluschnik

Vincent Froese

Klaus Heeger

Anne-Sophie Himmel

Andrzej Kaczmarczyk

Dušan Knop

Leon Kellerhals

Hendrik Molter

André Nichterlein

Rolf Niedermeier (chair)

Malte Renken

Christlinde Thielcke

Philipp Zschoche
## External Reviewers

Amir Abboud
Peyman Afshani
S. Akshay
Kazuyuki Amano
Bo An
Dmitry Ananichev
Eric Angel
Antonios Antoniadis
Tetsuya Araki
Elena Arseneva Khramtcova
James Aspnes
Albert Atserias
Nathalie Aubrun
David Avis
Haris Aziz
Maxim Babenko
Arturs Backurs
Nikhil Balaji
Jozsef Balogh
Hideo Bannai
Nikhil Bansal
Jérémy Barbay
Nicolas Basset
Julien Baste
Isabel Beckenbach
Djamal Belazzougui
Rémy Belmonte
Alexander Belov
Matthias Bentert
Cédric Bentz
Sebastian Berndt
Vincent Berry
Nathalie Bertrand
Dietmar Berwanger
Amey Bhangale
Umang Bhaskar
Sayan Bhattacharya
Laurent Bienvenu
Johanna Björklund
Thomas Bläsius
Bernhard Bliem
Ivan Bliznets
Achim Blumensath
Ilario Bonacina
Edouard Bonnet
Bartłomiej Bosek
Nicolas Bousquet
Cornelius Brand
Tomas Brazdil

Sabine Broda
Jonah Brown-Cohen
Guido Brückner
Binh-Minh Bui-Xuan
Christina Büsing
Michaël Cadilhac
Alan Cain
Florent Capelli
Francesco Caravelli
Arnaud Carayol
Marco Carmosino
Olivier Carton
André Chailloux
Sourav Chakraborty
Yi-Jun Chang
Steven Chaplick
Vaggos Chatziafratis
Jiehua Chen
Victor Chepoi
Danila Cherkashin
Ashish Chiplunkar
Dmitry Chistikov
Rajesh Chitnis
Ananya Christman
Vincent Cohen-Addad
Thomas Colcombet
Stefano Coniglio
Alessio Conte
Miguel Couceiro
Ágnes Cseh
Wojciech Czerwiński
Mattia D'Emidio
Konrad Kazimierz Dabrowski
Ugo Dal Lago
Peter Damaschke
Bireswar Das
Syamantak Das
Laure Daviaud
Ronald de Haan
Arnaud de Mesmay
Susanna F. de Rezende
Holger Dell
Dariusz Dereniowski
Stéphane Devismes
Benjamin Doerr
Francesco Dolce
Ran Duan
Devdatt Dubhashi
François Durand

Pierre-Francois Dutot
Wolfgang Dvořák
Attila Egri-Nagy
Eduard Eiben
Khaled Elbassioni
Murray Elder
Jan Elffers
Marek Eliáš
Elaine Eschen
Kousha Etessami
Angelo Fanelli
John Fearnley
Carl Feghali
Stefan Felsner
Asaf Ferber
Henning Fernau
Laurent Feuilloley
Johannes Fichte
Hendrik Fichtenberger
Aris Filos-Ratsikas
Arnold Filtser
Jorg Flum
Till Fluschnik
Jacob Focke
Sebastian Forster
Fabrizio Frati
Dominik D. Freydenberger
André Frochaux
Vincent Froese
Matthias Függer
Hiroshi Fujiwara
Eric Fusy
Ariel Gabizon
Jakub Gajarsky
Pietro Galliani
Philippe Gambette
Robert Ganian
Mohit Garg
Naveen Garg
Paul Gastin
Cyril Gavoille
Pawel Gawrychowski
Enrico Gerding
Panos Giannopoulos
Archontia Giannopoulou
Hugo Gilbert
Andreas Göbel
Stephan Gocht
Tomasz Gogacz
0:xiv External Reviewers

Alexander Göke
Petr Golovach
Alexander Golovnev
Mika Göös
Gramoz Goranci
Daniel Graça
Erich Grädel
Fabrizio Grandoni
Kasper Green Larsen
Elena Grigorescu
Martin Grohe
Rohit Gurjar
Gregory Gutin
Marc Gyssens
Christoph Haase
Vesa Halava
Guangyue Han
Xin Han
Prahladh Harsha
Frédéric Havet
Markus Hecher
Loic Helouet
Petr Hlineny
Markus Holzer
Kaave Hosseini
Chien-Chung Huang
Pavel Hubáček
Tomohiro I
Rasmus Ibsen-Jensen
Shinji Imahori
Dmitry Itsykson
Yoichi Iwata
Lars Jaffke
Petr Jancar
Bart M. P. Jansen
Bruno Jartoux
Ismaël Jecker
Artur Jeż
Łukasz Jeż
Zhengfeng Ji
Matthew Johnson
Martin Jonas
Peter Jonsson
Gwenaël Joret
Vincent Jugé
Marcin Jurdzinski
Andrzej Kaczmarczyk
Naoyuki Kamiyama
Iyad Kanj
Adam Karczmarz
Jarkko Kari
Nikolai Karpov
Yoshiyuki Karuno

Steve Kass
Yasushi Kawase
Jens Keppeler
Thomas Kesselheim
Emanuel Kieronski
Benjamin Kiesl
Shuji Kijima
Eunjung Kim
Sang-Sub Kim
Kei Kimura
Tamás Király
Masashi Kiyomi
Joachim Klein
Kim-Manuel Klein
Alexander Knop
Dušan Knop
Yusuke Kobayashi
Eryk Kopczynski
Dominik Köppl
Arpita Korwar
Dmitry Kosolobov
Robin Kothari
Martin Koutecký
Yiannis Koutis
Łukasz Kowalik
Alexander Kozachinskiy
Jan Kretinsky
Amer Krivosija
Markus Kröll
Manfred Kufleitner
Alexander Kulikov
Amit Kumar
Michal Kunc
Marvin Künnemann
Kazuhiro Kurita
O-Joung Kwon
Sébastien Labbé
Arnaud Labourel
Guillaume Lagarde
Jean Marie Lagniez
Michael Lampis
John Lapinskas
Massimo Lauria
Mathieu Laurière
Tien-Nam Le
Francois Le Gall
Thierry Lecroq
Johannes Lengler
Pascal Lenzner
Avivit Levy
Nathan Lhote
Nutan Limaye
Stratis Limnios

Andrea Lincoln
Zhenming Liu
Christof Löding
Markus Lohrey
Satyanarayana Lokam
Daniel Lokshtanov
Sylvain Lombardy
Anna Lubiw
Giorgio Lucarelli
Junjie Luo
Ramanujan M. S.
Jeremy Macdonald
Alexander Mäcker
Meena Mahajan
Mohammad Mahmoody
Cécile Mailler
Adam Malinowski
Jan Maly
Florin Manea
David Manlove
Maurice Margenstern
Andrea Marino
Claire Mathieu
Samuel McCauley
Andrew McGregor
Kitty Meeks
Saeed Mehrabi
Or Meir
Stefan Mengel
Robert Mercas
Wolfgang Merkle
Friedhelm Meyer Auf der Heide
David Mezlaf
Mehdi Mhalla
Othon Michail
Vincent Michielini
Ivan Mikhajlin
Martin Milanič
Dor Minzer
Ilya Mironov
Neeldhara Misra
Valia Mitsou
Shuichi Miyazaki
Matthias Mnich
Xavier Molinero
Hendrik Molter
Tobias Mömke
Clement Mommessin
Nelma Moreira
Antoine Mottet
Amer Mouawad
Grégory Mounié
Aida Mousavifar
External Reviewers

0:xv

Sagnik Mukhopadhyay
Martin Mundhenk
Kengo Nakamura
Anand Natarajan
Jesper Nederlof
Volodymyr Nekrashevych
Jelani Nelson
Stefan Neumann
André Nichterlein
Matthias Niewerth
Sergey Nikolenko
Aleksandar Nikolov
Prajakta Nimbhorkar
Reino Niskanen
Alexandre Niveau
Alexandre Nolin
Petr Novotný
Jan Obdrzalek
Pascal Ochem
Joanna Ochremiak
Alexander Okhotin
Krzysztof Onak
Tim Oosterwijk
Sebastian Ordyniak
Magdalena Ortiz
Yota Otachi
Martin Otto
Shayan Oveis Gharan
Dana Pardubska
Paweł Parys
Ami Paz
Timothée Pecatte
Tomáš Peitl
Vianney Perchet
Simon Perdrix
Sylvain Perifel
Clément Pernet
Fedor Petrov
Elena Petrova
Giovanni Pighizzini
Michał Pilipczuk
G. Michele Pinna
Solon Pissis
Alexandru Popa
Natacha Portier
Igor Potapov
Anupam Prakash
M. Praveen
Nicola Prezza
Elena Pribavkina
Kirk Pruhs
Marcin Przybyłko
Gabriele Puppis
Svetlana Puzynina
Jaikumar Radhakrishnan

Jakub Radoszewski
Benjamin Raichel
Günther Raidl
Venkatesh Raman
Narad Rampersad
Michael Rao
Gaurav Rattan
Bhaskar Ray Chaudhury
Jean-Florent Raymond
Igor Razgon
Damien Regnault
Vojtech Rehak
Daniel Reichman
Felix Reidl
Jan Reimann
Fabian Reiter
Malte Renken
Anja Rey
Pierre-Alain Reynier
Gaétan Richard
David Richerby
Kilian Risse
Cristian Riveros
Robert Robere
Emanuele Rodaro
Jérémie Roland
Jonathan Rollin
Andrei Romashchenko
Adi Rosén
Raphael Rossignol
Thomas Rothvoss
Andrew Ryzhikov
Toshiki Saitoh
Prakash Saivasan
Andrej Sajenko
Ville Salo
Rahul Santhanam
Swagato Sanyal
Ramprasad Saptharishi
Thatchaphol Saranurak
Ignasi Sau
Thomas Sauerwald
David Saulpic
Nitin Saurabh
Saket Saurabh
Nadja Scharf
Kevin Schewior
Markus L. Schmid
Jens M. Schmidt
Nicole Schweikardt
Alexander Shen
Xiangkun Shen
Akiyoshi Shioura
Takeharu Shiraga
Arseny Shur

Sebastian Siebertz
Florian Sikora
Rodrigo Silveira
Sunil Simon
Friedrich Slivovsky
Alexander Smal
Christian Sohler
Dmitry Sokolov
Manuel Sorge
Jiri Srba
A V Sreejith
Abhinav Srivastav
Piyush Srivastava
K V Subrahmanyam
Zhaohong Sun
Anupa Sunny
Akira Suzuki
Joseph Swernofsky
Marek Sys
Kenjiro Takazawa
Navid Talebanfard
Suguru Tamaki
Shin-Ichi Tanigawa
Till Tantau
Alexandre Termier
Sumedh Tirodkar
Sophie Tison
Ioan Todinca
Meng-Tsung Tsai
Ryuhei Uehara
René van Bevern
Jan van den Brand
Rob van Stee
Pascal Vanier
Carmine Ventre
Nikolay Vereshchagin
Sergey Verlan
Marc Vinyals
Caterina Viola
Ben Lee Volk
Moritz von Looz
Magnus Wahlström
Haitao Wang
Kunihiro Wasa
Oren Weimann
Armin Weiss
Mathias Weller
Philip Wellnitz
Josef Widder
Piotr Więcek
Andreas Wiese
Ryan Williams
Sarah Winter
Gerhard J. Woeginger
Dominik Wojtczak
0:xvi External Reviewers

Marcin Wrochna

Mingyu Xiao

Chao Xu

Easton Li Xu

Masaki Yamamoto

Katsuhisa Yamanaka

Koichi Yamazaki

Yu Yokoi

Yuichi Yoshida

Raphael Yuster

Viktor Zamaraev

Meirav Zehavi

Peter Zeman

Thomas Zeume

Jingru Zhang

Yong Zhang

Arjana Žitnik

Stanislav Živný

Philipp Zschoche

Paweł Žyliński