Table of Contents

• The Firing Squad Problem RevisitedBernadette Charron-Bost, Shlomo Moran. [doi]
• Parameterized (Approximate) Defective ColoringRémy Belmonte, Michael Lampis, Valia Mitsou. [doi]
• The Open Shop Scheduling ProblemGerhard J. Woeginger. [doi]
• Communicating Finite-State Machines and Two-Variable LogicBenedikt Bollig, Marie Fortin, Paul Gastin. [doi]
• Relations Between Greedy and Bit-Optimal LZ77 EncodingsDmitry Kosolobov. [doi]
• Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine SchedulingSven Jäger, Martin Skutella. [doi]
• On the Power of Tree-Depth for Fully Polynomial FPT AlgorithmsYoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka. [doi]
• Solving the Rubik's Cube Optimally is NP-completeErik D. Demaine, Sarah Eisenstat, Mikhail Rudoy. [doi]
• Upper and Lower Bounds for Dynamic Data Structures on StringsRaphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana A. Starikovskaya. [doi]
• On Singleton Arc Consistency for CSPs Defined by Monotone PatternsClément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivny. [doi]
• Recursion Schemes and the WMSO+U LogicPawel Parys. [doi]
• Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner VerticesPavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý. [doi]
• Nonuniform Reductions and NP-CompletenessJohn M. Hitchcock, Hadi Shafei. [doi]
• Lower Bound Techniques for QBF Proof SystemsMeena Mahajan. [doi]
• Large Flocks of Small Birds: on the Minimal Size of Population ProtocolsMichael Blondin, Javier Esparza, Stefan Jaax. [doi]
• Pumping Lemmas for Weighted AutomataFilip Mazowiecki, Cristian Riveros. [doi]
• Lower Bounds on Black-Box Reductions of Hitting to Density EstimationRoei Tell. [doi]
• String Periods in the Order-Preserving ModelGarance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen. [doi]
• On the Tree Conjecture for the Network Creation GameDavide Bilò, Pascal Lenzner. [doi]
• Property Testing for Bounded Degree DatabasesIsolde Adler, Frederik Harwath. [doi]
• Lower Bounds for Combinatorial Algorithms for Boolean Matrix MultiplicationDebarati Das, Michal Koucký, Michael E. Saks. [doi]
• Automata Theory on Sliding WindowsMoses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, Konstantinos Mamouras. [doi]
• A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-WidthLars Jaffke, O-joung Kwon, Jan Arne Telle. [doi]
• Approximating Airports and RailwaysAnna Adamaszek, Antonios Antoniadis, Amit Kumar 0001, Tobias Mömke. [doi]
• Power of Uninitialized Qubits in Shallow Quantum CircuitsYasuhiro Takahashi, Seiichiro Tani. [doi]
• Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue MonoidChris Köcher. [doi]
• Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity CharacterizationLászló Egri, Dániel Marx, Pawel Rzazewski. [doi]
• Computing Hitting Set Kernels By AC^0-CircuitsMax Bannach, Till Tantau. [doi]
• Surjective H-Colouring over Reflexive DigraphsBenoit Larose, Barnaby Martin, Daniël Paulusma. [doi]
• Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with ApplicationsSuryajith Chillara, Nutan Limaye, Srikanth Srinivasan 0001. [doi]
• Closure of Resource-Bounded Randomness Notions Under Polynomial-Time PermutationsAndré Nies, Frank Stephan 0001. [doi]
• Lossy Kernels for Connected Dominating Set on Sparse GraphsEduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz. [doi]
• Optimal Dislocation with Persistent Errors in Subquadratic TimeBarbara Geissmann, Stefano Leucci 0001, Chih-Hung Liu, Paolo Penna. [doi]
• Approximation Algorithms for Scheduling with Resource and Precedence ConstraintsGökalp Demirci, Henry Hoffmann, David H. K. Kim. [doi]
• On Low for Speed OraclesLaurent Bienvenu, Rodney G. Downey. [doi]
• Space-Efficient Algorithms for Longest Increasing SubsequenceMasashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui. [doi]
• The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares ProofsChristoph Berkholz. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• The Intersection Problem for Finite MonoidsLukas Fleischer, Manfred Kufleitner. [doi]
• Knapsack Problems for Wreath ProductsMoses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche. [doi]
• Small Resolution Proofs for QBF using Dependency TreewidthEduard Eiben, Robert Ganian, Sebastian Ordyniak. [doi]
• On the Positive Calculus of Relations with Transitive ClosureDamien Pous. [doi]
• On Approximating the Stationary Distribution of Time-reversible Markov ChainsMarco Bressan 0002, Enoch Peserico, Luca Pretto. [doi]
• Computing the Longest Common Prefix of a Context-free Language in Polynomial TimeMichael Luttenberger, Raphaela Palenta, Helmut Seidl. [doi]
• Dependences in Strategy LogicPatrick Gardy, Patricia Bouyer, Nicolas Markey. [doi]
• On Structural Parameterizations of the Bounded-Degree Vertex Deletion ProblemRobert Ganian, Fabian Klute, Sebastian Ordyniak. [doi]
• Sums of Palindromes: an Approach via AutomataAayush Rajasekaran, Jeffrey Shallit, Tim Smith. [doi]
• Genuine Lower Bounds for QBF ExpansionOlaf Beyersdorff, Joshua Blinkhorn. [doi]
• Improving the Upper Bound on the Length of the Shortest Reset WordMarek Szykula. [doi]
• All Classical Adversary Methods are Equivalent for Total FunctionsAndris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs. [doi]
• On the Containment Problem for Linear SetsHans-Ulrich Simon. [doi]
• An Improved Bound for Random Binary Search Trees with Concurrent InsertionsGeorge Giakkoupis, Philipp Woelfel. [doi]
• Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex IntersectionHiroshi Hirai 0001, Yuni Iwamasa, Kazuo Murota, Stanislav Zivny. [doi]
• Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random GenerationBruno Salvy. [doi]
• Erdös-Pósa Property of Obstructions to Interval GraphsAkanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. [doi]
• Succinct Oblivious RAMTaku Onodera, Tetsuo Shibuya. [doi]
• Colouring Square-Free Graphs without Long Induced PathsSerge Gaspers, Shenwei Huang, Daniël Paulusma. [doi]
• Efficient Oracles and Routing Schemes for Replacement PathsDavide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci 0001, Merav Parter, Guido Proietti. [doi]
• Width of Non-deterministic AutomataDenis Kuperberg, Anirban Majumdar. [doi]