LIPIcs, Volume 96, STACS 2018

Rolf Niedermeier and Brigitte Vallée LIPIcs, Volume 96, STACS'18, Complete Volume 10.4230/LIPIcs.STACS.2018
Rolf Niedermeier and Brigitte Vallée Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.STACS.2018.0
Bruno Salvy Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation 10.4230/LIPIcs.STACS.2018.1
Meena Mahajan Lower Bound Techniques for QBF Proof Systems 10.4230/LIPIcs.STACS.2018.2
Damien Pous On the Positive Calculus of Relations with Transitive Closure 10.4230/LIPIcs.STACS.2018.3
Gerhard J. Woeginger The Open Shop Scheduling Problem 10.4230/LIPIcs.STACS.2018.4
Anna Adamaszek, Antonios Antoniadis, Amit Kumar, and Tobias Mömke Approximating Airports and Railways 10.4230/LIPIcs.STACS.2018.5
Isolde Adler and Frederik Harwath Property Testing for Bounded Degree Databases 10.4230/LIPIcs.STACS.2018.6
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, and Meirav Zehavi Erdös-Pósa Property of Obstructions to Interval Graphs 10.4230/LIPIcs.STACS.2018.7
Andris Ambainis, Martins Kokainis, Krisjanis Prusis, and Jevgenijs Vihrovs All Classical Adversary Methods are Equivalent for Total Functions 10.4230/LIPIcs.STACS.2018.8
Max Bannach and Till Tantau Computing Hitting Set Kernels By AC^0-Circuits 10.4230/LIPIcs.STACS.2018.9
Rémy Belmonte, Michael Lampis, and Valia Mitsou Parameterized (Approximate) Defective Coloring 10.4230/LIPIcs.STACS.2018.10
Christoph Berkholz The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs 10.4230/LIPIcs.STACS.2018.11
Olaf Beyersdorff and Joshua Blinkhorn Genuine Lower Bounds for QBF Expansion 10.4230/LIPIcs.STACS.2018.12
Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, and Guido Proietti Efficient Oracles and Routing Schemes for Replacement Paths 10.4230/LIPIcs.STACS.2018.13
Davide Bilò and Pascal Lenzner On the Tree Conjecture for the Network Creation Game 10.4230/LIPIcs.STACS.2018.14
Laurent Bienvenu and Rodney Downey On Low for Speed Oracles 10.4230/LIPIcs.STACS.2018.15
Michael Blondin, Javier Esparza, and Stefan Jaax Large Flocks of Small Birds: on the Minimal Size of Population Protocols 10.4230/LIPIcs.STACS.2018.16
Benedikt Bollig, Marie Fortin, and Paul Gastin Communicating Finite-State Machines and Two-Variable Logic 10.4230/LIPIcs.STACS.2018.17
Marco Bressan, Enoch Peserico, and Luca Pretto On Approximating the Stationary Distribution of Time-reversible Markov Chains 10.4230/LIPIcs.STACS.2018.18
Clément Carbonnel, David A. Cohen, Martin C. Cooper, and Stanislav Zivny On Singleton Arc Consistency for CSPs Defined by Monotone Patterns 10.4230/LIPIcs.STACS.2018.19
Bernadette Charron-Bost and Shlomo Moran The Firing Squad Problem Revisited 10.4230/LIPIcs.STACS.2018.20
Suryajith Chillara, Nutan Limaye, and Srikanth Srinivasan Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications 10.4230/LIPIcs.STACS.2018.21
Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, and Tatiana Starikovskaya Upper and Lower Bounds for Dynamic Data Structures on Strings 10.4230/LIPIcs.STACS.2018.22
Debarati Das, Michal Koucký, and Michael Saks Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication 10.4230/LIPIcs.STACS.2018.23
Erik D. Demaine, Sarah Eisenstat, and Mikhail Rudoy Solving the Rubik's Cube Optimally is NP-complete 10.4230/LIPIcs.STACS.2018.24
Gökalp Demirci, Henry Hoffmann, and David H. K. Kim Approximation Algorithms for Scheduling with Resource and Precedence Constraints 10.4230/LIPIcs.STACS.2018.25
Pavel Dvorák, Andreas Emil Feldmann, Dušan Knop, Tomáš Masarík, Tomáš Toufar, and Pavel Veselý Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices 10.4230/LIPIcs.STACS.2018.26
László Egri, Dániel Marx, and Pawel Rzazewski Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization 10.4230/LIPIcs.STACS.2018.27
Eduard Eiben, Robert Ganian, and Sebastian Ordyniak Small Resolution Proofs for QBF using Dependency Treewidth 10.4230/LIPIcs.STACS.2018.28
Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, and Sebastian Siebertz Lossy Kernels for Connected Dominating Set on Sparse Graphs 10.4230/LIPIcs.STACS.2018.29
Lukas Fleischer and Manfred Kufleitner The Intersection Problem for Finite Monoids 10.4230/LIPIcs.STACS.2018.30
Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, and Konstantinos Mamouras Automata Theory on Sliding Windows 10.4230/LIPIcs.STACS.2018.31
Moses Ganardi, Daniel König, Markus Lohrey, and Georg Zetzsche Knapsack Problems for Wreath Products 10.4230/LIPIcs.STACS.2018.32
Robert Ganian, Fabian Klute, and Sebastian Ordyniak On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem 10.4230/LIPIcs.STACS.2018.33
Patrick Gardy, Patricia Bouyer, and Nicolas Markey Dependences in Strategy Logic 10.4230/LIPIcs.STACS.2018.34
Serge Gaspers, Shenwei Huang, and Daniel Paulusma Colouring Square-Free Graphs without Long Induced Paths 10.4230/LIPIcs.STACS.2018.35
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, and Paolo Penna Optimal Dislocation with Persistent Errors in Subquadratic Time 10.4230/LIPIcs.STACS.2018.36
George Giakkoupis and Philipp Woelfel An Improved Bound for Random Binary Search Trees with Concurrent Insertions 10.4230/LIPIcs.STACS.2018.37
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny Shur, and Tomasz Walen String Periods in the Order-Preserving Model 10.4230/LIPIcs.STACS.2018.38
Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, and Stanislav Zivny Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection 10.4230/LIPIcs.STACS.2018.39
John M. Hitchcock and Hadi Shafei Nonuniform Reductions and NP-Completeness 10.4230/LIPIcs.STACS.2018.40
Yoichi Iwata, Tomoaki Ogasawara, and Naoto Ohsaka On the Power of Tree-Depth for Fully Polynomial FPT Algorithms 10.4230/LIPIcs.STACS.2018.41
Lars Jaffke, O-joung Kwon, and Jan Arne Telle A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width 10.4230/LIPIcs.STACS.2018.42
Sven Jäger and Martin Skutella Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling 10.4230/LIPIcs.STACS.2018.43
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, and Jun Tarui Space-Efficient Algorithms for Longest Increasing Subsequence 10.4230/LIPIcs.STACS.2018.44
Chris Köcher Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid 10.4230/LIPIcs.STACS.2018.45
Dmitry Kosolobov Relations Between Greedy and Bit-Optimal LZ77 Encodings 10.4230/LIPIcs.STACS.2018.46
Denis Kuperberg and Anirban Majumdar Width of Non-deterministic Automata 10.4230/LIPIcs.STACS.2018.47
Michael Luttenberger, Raphaela Palenta, and Helmut Seidl Computing the Longest Common Prefix of a Context-free Language in Polynomial Time 10.4230/LIPIcs.STACS.2018.48
Benoit Larose, Barnaby Martin, and Daniel Paulusma Surjective H-Colouring over Reflexive Digraphs 10.4230/LIPIcs.STACS.2018.49
Filip Mazowiecki and Cristian Riveros Pumping Lemmas for Weighted Automata 10.4230/LIPIcs.STACS.2018.50
André Nies and Frank Stephan Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations 10.4230/LIPIcs.STACS.2018.51
Taku Onodera and Tetsuo Shibuya Succinct Oblivious RAM 10.4230/LIPIcs.STACS.2018.52
Pawel Parys Recursion Schemes and the WMSO+U Logic 10.4230/LIPIcs.STACS.2018.53
Aayush Rajasekaran, Jeffrey Shallit, and Tim Smith Sums of Palindromes: an Approach via Automata 10.4230/LIPIcs.STACS.2018.54
Hans U. Simon On the Containment Problem for Linear Sets 10.4230/LIPIcs.STACS.2018.55
Marek Szykula Improving the Upper Bound on the Length of the Shortest Reset Word 10.4230/LIPIcs.STACS.2018.56
Yasuhiro Takahashi and Seiichiro Tani Power of Uninitialized Qubits in Shallow Quantum Circuits 10.4230/LIPIcs.STACS.2018.57
Roei Tell Lower Bounds on Black-Box Reductions of Hitting to Density Estimation 10.4230/LIPIcs.STACS.2018.58