# 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)

Christophe Paul, Markus Bläser

► To cite this version:

Christophe Paul, Markus Bläser. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). STACS 2020 - 37th International Symposium on Theoretical Aspects of Computer Science, 154, 2020, Leibniz International Proceedings in Informatics (LIPIcs), 978-3-95977-140-5. 10.4230/LIPIcs.STACS.2020.0 . lirmm-03027647

HAL Id: lirmm-03027647

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

Submitted on 30 Jun 2021

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_1.png" /></figure>

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

STACS 2020, March 10–13, 2020, Montpellier, France

Edited by

Christophe Paul

Markus Bläser

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

LIPICS

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

SYMPOSIUM
ON THEORETICAL
ASPECTS
OF COMPUTER
SCIENCE
Editors

**Christophe Paul**

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

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

**Markus Bläser**

Universität des Saarlandes, Saarbrücken, Germany
mblaeser@cs.uni-saarland.de

*ACM Classification 2012*

Mathematics of computing → Combinatorics; Mathematics of computing → Graph theory; Theory of computation → Formal languages and automata theory; Theory of computation → Logic; Theory of computation → Design and analysis of algorithms; Theory of computation → Computational complexity and cryptography; Theory of computation → Models of computation

ISBN 978-3-95977-140-5

*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-140-5.

*Publication date*

March, 2020

*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.2020.0

ISBN 978-3-95977-140-5

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)

■ Christel Baier (TU Dresden)

■ Mikolaj Bojanczyk (University of Warsaw)

■ Roberto Di Cosmo (INRIA and University Paris Diderot)

■ Javier Esparza (TU München)

■ Meena Mahajan (Institute of Mathematical Sciences)

■ Dieter van Melkebeek (University of Wisconsin-Madison)

■ Anca Muscholl (University Bordeaux)

■ Luke Ong (University of Oxford)

■ Catuscia Palamidessi (INRIA)

■ Thomas Schwentick (TU Dortmund)

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

ISSN 1868-8969

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

# Contents

## Preface

Christophe Paul and Markus Bläser .................................................... 0:ix-0:x

## Conference organization

.................................................................................................................... 0:xi-0:xii

## Invited Talk

### Statistical Physics and Algorithms

Dana Randall .................................................................................... 1:1-1:6

### Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks

Martin Grohe .................................................................................... 2:1-2:1

### Computability, Complexity and Programming with Ordinary Differential Equations

Olivier Bournez .................................................................................... 3:1-3:13

## Tutorial

### Graphical Models: Queries, Complexity, Algorithms

Martin C. Cooper, Simon de Givry, and Thomas Schiex ............................ 4:1-4:22

## Regular Paper

### Inapproximability Results for Scheduling with Interval and Resource Restrictions

Marten Maack and Klaus Jansen ................................................................ 5:1-5:18

### An Automaton Group with PSPACE-Complete Word Problem

Jan Philipp Wächter and Armin Weiß .................................................... 6:1-6:17

### A Trichotomy for Regular Trail Queries

Wim Martens, Matthias Niewerth, and Tina Trautner .................................... 7:1-7:16

### Descriptive Complexity on Non-Polish Spaces

Antonin Callard and Mathieu Hoyrup .................................................... 8:1-8:16

### NP-Completeness, Proof Systems, and Disjoint NP-Pairs

Titus Dose and Christian Glaßer ............................................................ 9:1-9:18

### String Indexing with Compressed Patterns

Philip Bille, Inge Li Gørtz, and Teresa Anna Steiner .................................... 10:1-10:13

### An FPT Algorithm for Minimum Additive Spanner Problem

Yusuke Kobayashi .................................................................................... 11:1-11:16

### New Bounds for Randomized List Update in the Paid Exchange Model

Susanne Albers and Maximilian Janke .................................................... 12:1-12:17

37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020).

Editors: Christophe Paul and Markus Bläser

<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>

SYMPOSIUM
ON THEORETICAL
ASPECTS
OF COMPUTER
SCIENCE
<table>
  <tbody>
    <tr>
      <td>On Covering Segments with Unit Intervals<br><i>Dan Bergren, Eduard Eiben, Robert Ganian, and Iyad Kanj</i></td>
      <td>13:1–13:17</td>
    </tr>
    <tr>
      <td>Decidability and Periodicity of Low Complexity Tilings<br><i>Jarkko Kari and Etienne Moutot</i></td>
      <td>14:1–14:12</td>
    </tr>
    <tr>
      <td>The Tandem Duplication Distance Is NP-Hard<br><i>Manuel Lafond, Binhai Zhu, and Peng Zou</i></td>
      <td>15:1–15:15</td>
    </tr>
    <tr>
      <td>Existential Length Universality<br><i>Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey Shallit, and Marek Szykula</i></td>
      <td>16:1–16:14</td>
    </tr>
    <tr>
      <td>On the Termination of Flooding<br><i>Walter Hussak and Amitabh Trehan</i></td>
      <td>17:1–17:13</td>
    </tr>
    <tr>
      <td>Generalised Pattern Matching Revisited<br><i>Bartlomiej Dudek, Pawel Gawrychowski, and Tatiana Starikovskaya</i></td>
      <td>18:1–18:18</td>
    </tr>
    <tr>
      <td>Parameterized Pre-Coloring Extension and List Coloring Problems<br><i>Gregory Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, and Magnus Wahlström</i></td>
      <td>19:1–19:18</td>
    </tr>
    <tr>
      <td>Oracle Complexity Classes and Local Measurements on Physical Hamiltonians<br><i>Sevag Gharibian, Stephen Piddock, and Justin Yirka</i></td>
      <td>20:1–20:37</td>
    </tr>
    <tr>
      <td>Secret Key Agreement from Correlated Data, with No Prior Information<br><i>Marius Zimand</i></td>
      <td>21:1–21:12</td>
    </tr>
    <tr>
      <td>Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before<br><i>Michał Gańczorz</i></td>
      <td>22:1–22:29</td>
    </tr>
    <tr>
      <td>Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model<br><i>Taisuke Izumi, François Le Gall, and Frédéric Magniez</i></td>
      <td>23:1–23:13</td>
    </tr>
    <tr>
      <td>Lower Bounds for Arithmetic Circuits via the Hankel Matrix<br><i>Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, and Olivier Serre</i></td>
      <td>24:1–24:16</td>
    </tr>
    <tr>
      <td>Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs<br><i>Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, and Maximilian Katzmann</i></td>
      <td>25:1–25:14</td>
    </tr>
    <tr>
      <td>Domino Problem Under Horizontal Constraints<br><i>Nathalie Aubrun, Julien Esnay, and Mathieu Sablik</i></td>
      <td>26:1–26:15</td>
    </tr>
    <tr>
      <td>Computing Maximum Matchings in Temporal Graphs<br><i>George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, and Philipp Zschoche</i></td>
      <td>27:1–27:14</td>
    </tr>
    <tr>
      <td>Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths<br><i>Brieuc Guinard and Amos Korman</i></td>
      <td>28:1–28:14</td>
    </tr>
    <tr>
      <td>Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space<br><i>Falko Hegerfeld and Stefan Kratsch</i></td>
      <td>29:1–29:16</td>
    </tr>
    <tr>
      <td>Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements<br><i>Mitsuru Funakoshi and Julian Pape-Lange</i></td>
      <td>30:1–30:16</td>
    </tr>
  </tbody>
</table>
<table>
  <tbody>
    <tr>
      <td>Maximum Matchings in Geometric Intersection Graphs<br>Édouard Bonnet, Sergio Cabello, and Wolfgang Mulzer</td>
      <td>31:1–31:17</td>
    </tr>
    <tr>
      <td>Unambiguous Separators for Tropical Tree Automata<br>Thomas Colcombet and Sylvain Lombardy</td>
      <td>32:1–32:13</td>
    </tr>
    <tr>
      <td>Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment<br>Mirmahdi Rahgoshay and Mohammad R. Salavatipour</td>
      <td>33:1–33:14</td>
    </tr>
    <tr>
      <td>Streaming Complexity of Spanning Tree Computation<br>Yi-Jun Chang, Martín Farach-Colton, Tsan-Sheng Hsu, and Meng-Tsung Tsai</td>
      <td>34:1–34:19</td>
    </tr>
    <tr>
      <td>Shortest Reconfiguration of Colorings Under Kempe Changes<br>Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, and Kunihiro Wasa</td>
      <td>35:1–35:14</td>
    </tr>
    <tr>
      <td>Elimination Distances, Blocking Sets, and Kernels for Vertex Cover<br>Eva-Maria C. Hols, Stefan Kratsch, and Astrid Pieterse</td>
      <td>36:1–36:14</td>
    </tr>
    <tr>
      <td>Near-Optimal Complexity Bounds for Fragments of the Skolem Problem<br>S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, and Nikhil Vyas</td>
      <td>37:1–37:18</td>
    </tr>
    <tr>
      <td>Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths<br>Stefan Kratsch and Florian Nelles</td>
      <td>38:1–38:15</td>
    </tr>
    <tr>
      <td>Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width<br>Michal Wrona</td>
      <td>39:1–39:16</td>
    </tr>
    <tr>
      <td>Succinct Population Protocols for Presburger Arithmetic<br>Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, and Stefan Jaax</td>
      <td>40:1–40:15</td>
    </tr>
    <tr>
      <td>A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem<br>Lech Duraj</td>
      <td>41:1–41:18</td>
    </tr>
    <tr>
      <td>Fixed-Parameter Algorithms for Unsplittable Flow Cover<br>Andrés Cristi, Mathieu Mari, and Andreas Wiese</td>
      <td>42:1–42:17</td>
    </tr>
    <tr>
      <td>Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm<br>Frank Fuhlbrück, Johannes Köbler, and Oleg Verbitsky</td>
      <td>43:1–43:18</td>
    </tr>
    <tr>
      <td>Better Approximations for General Caching and UFP-Cover Under Resource Augmentation<br>Andrés Cristi and Andreas Wiese</td>
      <td>44:1–44:14</td>
    </tr>
    <tr>
      <td>Improved Bounds on Fourier Entropy and Min-Entropy<br>Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, and Ronald de Wolf</td>
      <td>45:1–45:19</td>
    </tr>
    <tr>
      <td>Information Distance Revisited<br>Bruno Bauwens</td>
      <td>46:1–46:14</td>
    </tr>
    <tr>
      <td>On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits<br>Suryajith Chillara</td>
      <td>47:1–47:16</td>
    </tr>
  </tbody>
</table>
<table>
  <tbody>
    <tr>
      <td>Observation and Distinction. Representing Information in Infinite Games<br><i>Dietmar Berwanger and Laurent Doyen</i></td>
      <td>48:1-48:17</td>
    </tr>
    <tr>
      <td>How Fast Can You Escape a Compact Polytope?<br><i>Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, and James Worrell</i></td>
      <td>49:1-49:11</td>
    </tr>
    <tr>
      <td>The SDP Value for Random Two-Eigenvalue CSPs<br><i>Sidhanth Mohanty, Ryan O'Donnell, and Pedro Paredes</i></td>
      <td>50:1-50:45</td>
    </tr>
    <tr>
      <td>Asymptotic Divergences and Strong Dichotomy<br><i>Xiang Huang, Jack H. Lutz, Elvira Mayordomo, and Donald M. Stull</i></td>
      <td>51:1-51:15</td>
    </tr>
    <tr>
      <td>Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs<br><i>S. M. Dhannya and N. S. Narayanaswamy</i></td>
      <td>52:1-52:16</td>
    </tr>
    <tr>
      <td>Constant-Time Dynamic (Δ + 1)-Coloring<br><i>Monika Henzinger and Pan Peng</i></td>
      <td>53:1-53:18</td>
    </tr>
    <tr>
      <td>Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards<br><i>Marcelo Arenas, Juan Reutter, Etienne Toussaint, Martín Ugarte, Francisco Vial, and Domagoj Vrgoč</i></td>
      <td>54:1-54:16</td>
    </tr>
    <tr>
      <td>Randomness and Initial Segment Complexity for Probability Measures<br><i>André Nies and Frank Stephan</i></td>
      <td>55:1-55:14</td>
    </tr>
    <tr>
      <td>Computing Shrub-Depth Decompositions<br><i>Jakub Gajarský and Stephan Kreutzer</i></td>
      <td>56:1-56:17</td>
    </tr>
    <tr>
      <td>Typical Sequences Revisited – Computing Width Parameters of Graphs<br><i>Hans L. Bodlaender, Lars Jaffke, and Jan Arne Telle</i></td>
      <td>57:1-57:16</td>
    </tr>
    <tr>
      <td>Grundy Coloring &amp; Friends, Half-Graphs, Bicliques<br><i>Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, and Florian Sikora</i></td>
      <td>58:1-58:18</td>
    </tr>
    <tr>
      <td>Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms<br><i>Nikhil Vyas and R. Ryan Williams</i></td>
      <td>59:1-59:17</td>
    </tr>
    <tr>
      <td>Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space<br><i>Jacobo Torán and Florian Wörz</i></td>
      <td>60:1-60:18</td>
    </tr>
  </tbody>
</table>
<figure><img src="image_10.png" /></figure>

# Preface

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 10-13 in Montpellier) is the 37th 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), Berlin (2019).

The interest in STACS has remained at a very high level over the past years. The STACS 2020 call for papers led to 242 submissions with authors from 43 countries. Each paper was assigned to three program committee members who, at their discretion, asked external reviewers for reports. For the sixth 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. The committee selected 56 papers during a three-week electronic meeting held in November/December 2019. This means an acceptance rate of only 23%. As co-chairs of the program committee, we would like to sincerely thank all its members and the 448 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.

We would like to express our thanks to the three invited speakers: Dana Randal (Georgia Technical Institute, Atlanta, USA), Olivier Bournez (LIX, École Polytechnique, Palaiseau, France), and Martin Grohe (RWTH Aachen University, Germany). Since 2011, the conference program includes tutorials. This year, we are pleased to invite Thomas Schiex (INRAE, Toulouse, France) and Stéphan Thomassé (LIP, ENS Lyon, France) to the tutorial session.

Special thanks go to the local organizing committee for continuous help throughout the conference organization. In particular, we wish to thank the colleagues and student from the ALGCO, ECO and ESCAPE research groups for their help as well as Mégane Miquel and Virginie Fèche from LIRMM laboratory staff for her permanent organisation support.

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

37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020).

Editors: Christophe Paul and Markus Bläser

<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>

SYMPOSIUM
ON THEORETICAL
ASPECTS
OF COMPUTER
SCIENCE
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. Finally we would like to thank our sponsors for their financial supports: Occitanie Region District, Institut des Sciences de l'Information et leurs Interaction (INS2I) of CNRS; the University of Montpellier and the I-Site MUSE project; the LabEx NUMEV and the LIRMM Laboratory.

Montpellier and Saarbrücken, March 2020

Christophe Paul and Markus Bläser
# Conference organization

## Program committee

<table><tr><td>Spyros Angelopoulos</td><td>CNRS, Sorbonne Université, Paris, France</td></tr><tr><td>V. Arvind</td><td>The Institute of Mathematical Sciences (HBNI), Chennai, India</td></tr><tr><td>Sayan Bhattacharya</td><td>University of Warwick, United Kingdom</td></tr><tr><td>Laurent Bienvenu</td><td>CNRS, Université de Bordeaux, France</td></tr><tr><td>Markus Bläser</td><td>Saarland University, Saarbrücken, Germany, co-chair</td></tr><tr><td>Manuel Bodirsky</td><td>Technische Universität Dresden, Germany</td></tr><tr><td>Jop Briët</td><td>CWI, Amsterdam, Netherlands</td></tr><tr><td>Wojciech Czerwiński</td><td>University of Warsaw, Poland</td></tr><tr><td>Holger Dell</td><td>IT University of Copenhagen, Denmark</td></tr><tr><td>Faith Ellen</td><td>University of Toronto, Canada</td></tr><tr><td>Petr Golovach</td><td>Bergen University, Norway</td></tr><tr><td>John Hitchcock</td><td>University of Wyoming, USA</td></tr><tr><td>Christian Ikenmeyer</td><td>University of Liverpool, United Kingdom</td></tr><tr><td>Shunsuke Inenaga</td><td>Kyushu University, Fukuoka, Japan</td></tr><tr><td>Christian Konrad</td><td>University of Bristol, United Kingdom</td></tr><tr><td>Kasper Green Larsen</td><td>Aarhus University, Denmark</td></tr><tr><td>Ranko Lazic</td><td>University of Warwick, United Kingdom</td></tr><tr><td>Meena Mahajan</td><td>The Institute of Mathematical Sciences (HBNI), Chennai, India</td></tr><tr><td>Ulrich Meyer</td><td>Goethe Universität, Frankfurt am Main, Germany</td></tr><tr><td>Benjamin Monmege</td><td>Aix-Marseille Université, France</td></tr><tr><td>Christophe Paul</td><td>CNRS, Université de Montpellier, France, co-chair</td></tr><tr><td>Marcin Pilipczuk</td><td>University of Warsaw, Poland</td></tr><tr><td>Eva Rotenberg</td><td>Technical University of Denmark, Lingby, Denmark</td></tr><tr><td>Pierre Senellart</td><td>Ecole normale supérieure, Université PSL, France</td></tr><tr><td>Till Tantau</td><td>Universität zu Lübeck, Germany</td></tr><tr><td>Lidia Tendera</td><td>Uniwersytet Opolski, Poland</td></tr><tr><td>Corentin Travers</td><td>Université de Bordeaux, France</td></tr><tr><td>Alfredo Viola</td><td>Universidad de la República de Uruguay, Uruguay</td></tr><tr><td>Georg Zetzsche</td><td>The Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany</td></tr><tr><td>Thomas Zeume</td><td>Technische Universität Dortmund, Germany</td></tr><tr><td>Martin Ziegler</td><td>KAIST, Daejeon, Republic of Korea</td></tr><tr><td>Standa Zivny</td><td>University of Oxford, United Kingdom</td></tr></table>
**Steering committee**

Thomas Colcombet CNRS, Université Paris Diderot, France

Martin Dietzfelbinger Technische Universität Ilmenau, Germany

Arnaud Durand Université Paris Diderot, France

Christoph Dürr CNRS, Sorbonne Université, co-chair, France

Henning Fernau Universität Trier, Germany

Dietrich Kuske Technische Universität Ilmenau, Germany

Arne Meier Leibniz Universität Hannover, Germany

Rolf Niedermeier Technische Universität Berlin, Germany

Natacha Portier ENS Lyon, France

Gilles Schaeffer CNRS, Ecole Polytechnique, Palaiseau, France

Thomas Schwentick Technische Universität Dortmund, co-chair, Germany

Ioan Todinca Université d'Orléans, France

**Local organizing committee (LIRMM, Université de Montpellier, CNRS)**

Marin Bougeret Fabien Jacques

Andrei Romashchenko

Virginie Fèche Hoang La

Ignasi Sau Valls

Daniel Goncalves Romain Lebreton

Alexander Shen

Bruno Grenet Mégane Miquel

Ilaria Zappatore

Emirhan Gürpinar Christophe Paul (Chair)

Lucas Isenmann Alexandre Pinlou

**Sponsors**

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

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

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

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

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

MONTPELLIER UNIVERSITY of EXCELLENCE

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

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