Accepted Papers

• Jack H. Lutz and Neil Lutz.
  Algorithmic information, plane Kakeya sets, and conditional dimension
• Zdenek Dvorak, Daniel Kral and Bojan Mohar.
  Graphic TSP in cubic graphs
• Dominik D. Freydenberger and Markus L. Schmid.
  Deterministic Regular Expressions With Back-References
• Pascal Koiran, Ignacio Garcia-Marco, Timothée Pecatte and Stéphan Thomassé.
  On the complexity of partial derivatives
• Marius Zimand.
  List approximation for increasing Kolmogorov complexity
• Tillmann Miltzow, Édouard Bonnet and Paweł Rzążewski.
  Complexity of Token Swapping and its Variants
• Gaétan Richard.
  On the synchronisation problem over cellular automata
• Zdenek Dvorak and Bernard Lidicky.
  Independent sets near the lower bound in bounded degree graphs
• Arnaud Carayol and Stefan Göller.
  On long words avoiding Zimin patterns
• Petr Gregor and Torsten Mütze.
  Trimming and gluing Gray codes
• Eldar Fischer, Oded Lachish and Yadu Vasudev.
  Improving and extending the testing of distributions for shape-restricted properties
• Mikołaj Bojańczyk and Michał Pilipczuk.
  Optimizing tree decompositions in MSO
• Michael Kompatscher and Trung Van Pham.
  A complexity dichotomy for poset constraint satisfaction
• Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly and James Worrell.
  Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
• Stephane Le Roux, Arno Pauly and Jean-Francois Raskin.
  Minkowski games
• Lorenzo Clemente, Wojciech Czerwiński, Sławomir Lasota and Charles Paperman.
  Separability of Reachability Sets of Vector Addition Systems
• Alexander Knop, Dmitry Itsykson, Dmitry Sokolov and Andrei Romashchenko.
  On OBDD based algorithms and proof systems that dynamically change order of variables
• Stanislav Böhm, Stefan Göller, Simon Halfon and Piotr Hofman.
  On Büchi one-counter automata
• Martin Koutecky, Dušan Knop and Matthias Mnich.
  Voting and Bribing in Single-Exponential Time
• Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud and Dennis Olivetti.
  Local Distributed Verification
• Vasco Brattka, Rupert Hölzl and Rutger Kuyper.
  Monte Carlo Computability
• Fedor Fomin, Daniel Lokshtanov, S. M. Meesum, Saket Saurabh and Meirav Zehavi.
  Matrix Rigidity from the Viewpoint of Parameterized Complexity
• Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak and Thomas Sauerwald.
  Multiple Random Walks on Paths and Grids
• Robert Ganian, Ramanujan M. S. and Stefan Szeider.
  Combining Treewidth and Backdoors for CSP
• Paul Gallot, Anca Muscholl, Gabriele Puppis and Sylvain Salvati.
  On the decomposition of finite-valued streaming string transducers
• Lin Chen, Dániel Marx, Deshi Ye and Guochuan Zhang.
  Parameterized and approximation results for scheduling with a low rank processing time matrix
• Piotr Sankowski and Karol Węgrzycki.
  Improved Distance Queries and Cycle Counting by Frobenius Normal Form
• Titouan Carette, Mathieu Lauriere and Frederic Magniez.
  Extended Learning Graphs for Triangle Finding
• Mohit Garg and Jaikumar Radhakrishnan.
  Set membership with non-adaptive bit probes
• Yann Disser and Stefan Kratsch.
  Robust and adaptive search
• Moses Ganardi, Markus Lohrey, Danny Hucke and Daniel König.
  Circuit Evaluation for Finite Semirings
• Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz and Grischa Weberstädt.
  Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs
• Aleksi Saarela.
  Word equations where a power equals a product of powers
• Bernd Finkbeiner and Martin Zimmermann.
  The First-Order Logic of Hyperproperties
• Vittorio Bilò and Marios Mavronicolas.
  ∃ℝ-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games
• Samuel J. V. Gool and Benjamin Steinberg.
  Pro-aperiodic monoids via saturated models
• Arkadev Chattopadhyay, Pavel Dvorak, Michal Koucky, Bruno Loff and Sagnik Mukhopadhyay.
  Lower Bounds for Elimination via Weak Regularity
• Shahrzad Haddadan and Peter Winkler.
  Mixing of Permutations by Biased Transposition
• Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh and Meirav Zehavi.
  Split Contraction: The Untold Story
• Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld and Paolo Penna.
  Energy-efficient Delivery by Heterogenous Mobile Agents
• Alexander Kulikov and Vladimir Podolskii.
  Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates
• Abhishek Bhrushundi, Prahladh Harsha and Srikanth Srinivasan.
  On polynomial approximations over Z/2^kZ
• Suman Kalyan Bera and Amit Chakrabarti.
  Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams
• Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth and Yannik Stein.
  Improved Time-Space Trade-offs for Computing Voronoi Diagrams
• Radu Curticapean, Holger Dell and Marc Roth.
  Counting edge-injective homomorphisms and matchings on restricted graph classes
• Marianne Akian, Stephane Gaubert, Julien Grand-Clement and Jeremie Guillaud.
  The operator approach to entropy games
• Qian Li and Xiaoming Sun.
  On the Sensitivity Complexity of k-Uniform Hypergraph Properties
• Peter Høyer and Mojtaba Komeili.
  Efficient quantum walk on the grid with multiple marked elements
• Benjamin Burton, Sergio Cabello, Stefan Kratsch and William Pettersson.
  The parameterized complexity of finding a 2-sphere in a simplicial complex
• Markus Lohrey and Georg Zetzsche.
  The Complexity of Knapsack in Graph Groups
• Maciej Skorski.
  Key Derivation for Squared-Friendly Applications: Lower Bounds
• Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon Puglisi and Arseny Shur.
  On the Size of Lempel-Ziv and Lyndon Factorizations
• Dmitry Chistikov, Szabolcs Ivan, Anna Lubiw and Jeffrey Shallit.
  Fractional coverings, greedy coverings, and rectifier networks
• Vikraman Arvind, Johannes Koebler, Sebastian Kuhnert and Jacobo Toran.
  Parameterized complexity of small weight automorphisms