| 2018 | On the Positive Calculus of Relations with Transitive Closure. | Damien Pous |
| 2018 | Recursion Schemes and the WMSO+U Logic. | Pawel Parys |
| 2018 | Succinct Oblivious RAM. | Taku Onodera, Tetsuo Shibuya |
| 2018 | Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations. | Andr Nies, Frank Stephan |
| 2018 | Pumping Lemmas for Weighted Automata. | Filip Mazowiecki, Cristian Riveros |
| 2018 | Lower Bound Techniques for QBF Proof Systems. | Meena Mahajan |
| 2018 | Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. | Michael Luttenberger, Raphaela Palenta, Helmut Seidl |
| 2018 | Surjective H-Colouring over Reflexive Digraphs. | Benot Larose, Barnaby Martin, Danil Paulusma |
| 2018 | Width of Non-deterministic Automata. | Denis Kuperberg, Anirban Majumdar |
| 2018 | Relations Between Greedy and Bit-Optimal LZ77 Encodings. | Dmitry Kosolobov |
| 2018 | Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid. | Chris Kcher |
| 2018 | Space-Efficient Algorithms for Longest Increasing Subsequence. | Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui |
| 2018 | Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling. | Sven Jger, Martin Skutella |
| 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 | On the Power of Tree-Depth for Fully Polynomial FPT Algorithms. | Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka |
| 2018 | Nonuniform Reductions and NP-Completeness. | John M. Hitchcock, Hadi Shafei |
| 2018 | String Periods in the Order-Preserving Model. | Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen |
| 2018 | An Improved Bound for Random Binary Search Trees with Concurrent Insertions. | George Giakkoupis, Philipp Woelfel |
| 2018 | Optimal Dislocation with Persistent Errors in Subquadratic Time. | Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna |
| 2018 | Colouring Square-Free Graphs without Long Induced Paths. | Serge Gaspers, Shenwei Huang, Danil Paulusma |
| 2018 | Dependences in Strategy Logic. | Patrick Gardy, Patricia Bouyer, Nicolas Markey |
| 2018 | On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. | Robert Ganian, Fabian Klute, Sebastian Ordyniak |
| 2018 | Knapsack Problems for Wreath Products. | Moses Ganardi, Daniel Knig, Markus Lohrey, Georg Zetzsche |
| 2018 | Automata Theory on Sliding Windows. | Moses Ganardi, Danny Hucke, Daniel Knig, Markus Lohrey, Konstantinos Mamouras |
| 2018 | The Intersection Problem for Finite Monoids. | Lukas Fleischer, Manfred Kufleitner |