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