| 2018 | Lossy Kernels for Connected Dominating Set on Sparse Graphs. | Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz |
| 2018 | Small Resolution Proofs for QBF using Dependency Treewidth. | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
| 2018 | Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. | Lszl Egri, Dniel Marx, Pawel Rzazewski |
| 2018 | Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. | Pavel Dvork, Andreas Emil Feldmann, Dusan Knop, Toms Masark, Tomas Toufar, Pavel Vesel |
| 2018 | Approximation Algorithms for Scheduling with Resource and Precedence Constraints. | Gkalp Demirci, Henry Hoffmann, David H. K. Kim |
| 2018 | Solving the Rubik's Cube Optimally is NP-complete. | Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy |
| 2018 | Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. | Debarati Das, Michal Kouck, Michael E. Saks |
| 2018 | Upper and Lower Bounds for Dynamic Data Structures on Strings. | Raphal Clifford, Allan Grnlund, Kasper Green Larsen, Tatiana Starikovskaya |
| 2018 | Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. | Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan |
| 2018 | The Firing Squad Problem Revisited. | Bernadette Charron-Bost, Shlomo Moran |
| 2018 | On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. | Clment Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivn |
| 2018 | Communicating Finite-State Machines and Two-Variable Logic. | Benedikt Bollig, Marie Fortin, Paul Gastin |
| 2018 | Large Flocks of Small Birds: on the Minimal Size of Population Protocols. | Michael Blondin, Javier Esparza, Stefan Jaax |
| 2018 | On the Tree Conjecture for the Network Creation Game. | Davide Bil, Pascal Lenzner |
| 2018 | Efficient Oracles and Routing Schemes for Replacement Paths. | Davide Bil, Keerti Choudhary, Luciano Gual, Stefano Leucci, Merav Parter, Guido Proietti |
| 2018 | On Low for Speed Oracles. | Laurent Bienvenu, Rodney G. Downey |
| 2018 | Genuine Lower Bounds for QBF Expansion. | Olaf Beyersdorff, Joshua Blinkhorn |
| 2018 | The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs. | Christoph Berkholz |
| 2018 | Parameterized (Approximate) Defective Coloring. | Rmy Belmonte, Michael Lampis, Valia Mitsou |
| 2018 | Computing Hitting Set Kernels By AC^0-Circuits. | Max Bannach, Till Tantau |
| 2018 | All Classical Adversary Methods are Equivalent for Total Functions. | Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs |
| 2018 | Erds-Psa Property of Obstructions to Interval Graphs. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2018 | Property Testing for Bounded Degree Databases. | Isolde Adler, Frederik Harwath |
| 2018 | Approximating Airports and Railways. | Anna Adamaszek, Antonios Antoniadis, Amit Kumar, Tobias Mmke |
| 2018 | On Approximating the Stationary Distribution of Time-reversible Markov Chains. | Marco Bressan, Enoch Peserico, Luca Pretto |