Table of Contents

• On Long Words Avoiding Zimin PatternsArnaud Carayol, Stefan Göller. [doi]
• Independent Sets near the Lower Bound in Bounded Degree GraphsZdenek Dvorák, Bernard Lidický. [doi]
• Circuit Evaluation for Finite SemiringsMoses Ganardi, Danny Hucke, Daniel König, Markus Lohrey. [doi]
• Complexity of Token Swapping and its VariantsÉdouard Bonnet, Tillmann Miltzow, Pawel Rzazewski. [doi]
• Separability of Reachability Sets of Vector Addition SystemsLorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman. [doi]
• Algorithmic Information, Plane Kakeya Sets, and Conditional DimensionJack H. Lutz, Neil Lutz. [doi]
• Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph StreamsSuman K. Bera, Amit Chakrabarti. [doi]
• Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk)Antoine Joux. [doi]
• On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of VariablesDmitry Itsykson, Alexander Knop, Andrei Romashchenko, Dmitry Sokolov. [doi]
• On the Sensitivity Complexity of k-Uniform Hypergraph PropertiesQian Li, Xiaoming Sun. [doi]
• Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time MatrixLin Chen 0011, Dániel Marx, Deshi Ye, Guochuan Zhang. [doi]
• Multiple Random Walks on Paths and GridsAndrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald. [doi]
• Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed GraphsStephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Grischa Weberstädt. [doi]
• Computing Majority by Constant Depth Majority Circuits with Low Fan-in GatesAlexander S. Kulikov, Vladimir V. Podolskii. [doi]
• Deterministic Regular Expressions with Back-ReferencesDominik D. Freydenberger, Markus L. Schmid. [doi]
• On the Synchronisation Problem over Cellular AutomataGaétan Richard. [doi]
• Robust and Adaptive SearchYann Disser, Stefan Kratsch. [doi]
• Lower Bounds for Elimination via Weak RegularityArkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay. [doi]
• Recompression: New Approach to Word Equations and Context Unification (Invited Talk)Artur Jez. [doi]
• On Polynomial Approximations Over Z/2^kZ*Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan. [doi]
• Mixing of Permutations by Biased TranspositionShahrzad Haddadan, Peter Winkler. [doi]
• What Can Be Verified Locally?Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti. [doi]
• Improving and Extending the Testing of Distributions for Shape-Restricted PropertiesEldar Fischer, Oded Lachish, Yadu Vasudev. [doi]
• The Complexity of Knapsack in Graph GroupsMarkus Lohrey, Georg Zetzsche. [doi]
• The Parameterized Complexity of Finding a 2-Sphere in a Simplicial ComplexBenjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson. [doi]
• Lower Bounds on Key Derivation for Square-Friendly ApplicationsMaciej Skorski. [doi]
• Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player GamesVittorio Bilò, Marios Mavronicolas. [doi]
• Extended Learning Graphs for Triangle FindingTitouan Carette, Mathieu Laurière, Frédéric Magniez. [doi]
• A Complexity Dichotomy for Poset Constraint SatisfactionMichael Kompatscher, Van Trung Pham. [doi]
• Set Membership with Non-Adaptive Bit ProbesMohit Garg 0003, Jaikumar Radhakrishnan. [doi]
• Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph ClassesRadu Curticapean, Holger Dell, Marc Roth. [doi]
• On Büchi One-Counter AutomataStanislav Böhm, Stefan Göller, Simon Halfon, Piotr Hofman. [doi]
• Monte Carlo ComputabilityVasco Brattka, Rupert Hölzl, Rutger Kuyper. [doi]
• Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers [doi]
• On the Decomposition of Finite-Valued Streaming String TransducersPaul Gallot, Anca Muscholl, Gabriele Puppis, Sylvain Salvati. [doi]
• List Approximation for Increasing Kolmogorov ComplexityMarius Zimand. [doi]
• Optimizing Tree Decompositions in MSOMikolaj Bojanczyk, Michal Pilipczuk. [doi]
• Trimming and Gluing Gray CodesPetr Gregor, Torsten Mütze. [doi]
• Split Contraction: The Untold StoryAkanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi. [doi]
• Word Equations Where a Power Equals a Product of PowersAleksi Saarela. [doi]
• Energy-Efficient Delivery by Heterogeneous Mobile AgentsAndreas Bärtschi, Jérémie Chalopin, Shantanu Das 0001, Yann Disser, Daniel Graf 0001, Jan Hackfeld, Paolo Penna. [doi]
• Computational Aspects of Logics in Team Semantics (Tutorial)Juha Kontinen. [doi]
• On the Size of Lempel-Ziv and Lyndon FactorizationsJuha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur. [doi]
• Parameterized Complexity of Small Weight AutomorphismsVikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán. [doi]
• The Operator Approach to Entropy GamesMarianne Akian, Stéphane Gaubert, Julien Grand-Clément, Jérémie Guillaud. [doi]
• Improved Time-Space Trade-Offs for Computing Voronoi DiagramsBahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein. [doi]
• Improved Distance Queries and Cycle Counting by Frobenius Normal FormPiotr Sankowski, Karol Wegrzycki. [doi]
• Pro-Aperiodic Monoids via Saturated ModelsSamuel Jacob van Gool, Benjamin Steinberg. [doi]
• Minkowski GamesStéphane Le Roux 0001, Arno Pauly, Jean-François Raskin. [doi]
• Voting and Bribing in Single-Exponential TimeDusan Knop, Martin Koutecký, Matthias Mnich. [doi]
• Graphic TSP in Cubic GraphsZdenek Dvorák, Daniel Král, Bojan Mohar. [doi]
• Fractional Coverings, Greedy Coverings, and Rectifier NetworksDmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey Shallit. [doi]
• Efficient Quantum Walk on the Grid with Multiple Marked ElementsPeter Høyer, Mojtaba Komeili. [doi]
• The First-Order Logic of HyperpropertiesBernd Finkbeiner, Martin Zimmermann 0002. [doi]
• Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk)Till Tantau. [doi]
• Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit ProblemNathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell. [doi]
• Combining Treewidth and Backdoors for CSPRobert Ganian, M. S. Ramanujan, Stefan Szeider. [doi]
• On the Complexity of Partial DerivativesIgnacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé. [doi]
• Matrix Rigidity from the Viewpoint of Parameterized ComplexityFedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi. [doi]