| 2018 | Brief Announcement: Erasure-Resilience Versus Tolerance to Errors. | Sofya Raskhodnikova, Nithin Varma |
| 2018 | Separating Without Any Ambiguity. | Thomas Place, Marc Zeitoun |
| 2018 | CacheShuffle: A Family of Oblivious Shuffles. | Sarvar Patel, Giuseppe Persiano, Kevin Yeo |
| 2018 | (Delta+1) Coloring in the Congested Clique Model. | Merav Parter |
| 2018 | Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration. | Rafail Ostrovsky, Yuval Rabani, Arman Yousefi |
| 2018 | Fully Dynamic MIS in Uniformly Sparse Graphs. | Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein |
| 2018 | An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences. | Dirk Nowotka, Aleksi Saarela |
| 2018 | Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States. | Chinmay Nirkhe, Umesh V. Vazirani, Henry Yuen |
| 2018 | Sparsity - an Algorithmic Perspective (Invited Paper). | Jaroslav Nesetril |
| 2018 | Improved Algorithms for Adaptive Compressed Sensing. | Vasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang |
| 2018 | Ring Packing and Amortized FHEW Bootstrapping. | Daniele Micciancio, Jessica Sorrell |
| 2018 | Eigenvector Computation and Community Detection in Asynchronous Gossip Models. | Frederik Mallmann-Trenn, Cameron Musco, Christopher Musco |
| 2018 | Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery. | Anand Louis, Rakesh Venkat |
| 2018 | Reducing CMSO Model Checking to Highly Connected Graphs. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2018 | Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT. | Sixue Liu |
| 2018 | Polynomial Vector Addition Systems With States. | Jrme Leroux |
| 2018 | A Centralized Local Algorithm for the Sparse Spanning Graph Problem. | Christoph Lenzen, Reut Levi |
| 2018 | Finer Tight Bounds for Coloring on Clique-Width. | Michael Lampis |
| 2018 | Gaifman Normal Forms for Counting Extensions of First-Order Logic. | Dietrich Kuske, Nicole Schweikardt |
| 2018 | The Unfortunate-Flow Problem. | Orna Kupferman, Gal Vardi |
| 2018 | Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. | Dariusz R. Kowalski, Miguel A. Mosteiro |
| 2018 | A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. | Martin Kouteck, Asaf Levin, Shmuel Onn |
| 2018 | On the Identity Problem for the Special Linear Group and the Heisenberg Group. | Sang-Ki Ko, Reino Niskanen, Igor Potapov |
| 2018 | Spectrally Robust Graph Isomorphism. | Alexandra Kolla, Ioannis Koutis, Vivek Madan, Ali Kemal Sinop |