| 2018 | Improved Coresets for Kernel Density Estimates. | Jeff M. Phillips, Wai Ming Tai |
| 2018 | Estimating Graph Parameters from Random Order Streams. | Pan Peng, Christian Sohler |
| 2018 | Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. | Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams |
| 2018 | A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth. | Mateus de Oliveira Oliveira |
| 2018 | Complex Semidefinite Programming and Max-k-Cut. | Alantha Newman |
| 2018 | On the Decidability of the Frchet Distance between Surfaces. | Amir Nayyeri, Hanzhong Xu |
| 2018 | Impossibility of dimension reduction in the nuclear norm. | Assaf Naor, Gilles Pisier, Gideon Schechtman |
| 2018 | Submodular Minimization Under Congruency Constraints. | Martin Ngele, Benny Sudakov, Rico Zenklusen |
| 2018 | Stability of the Lanczos Method for Matrix Function Approximation. | Cameron Musco, Christopher Musco, Aaron Sidford |
| 2018 | Time and Space Efficient Representations of Distributive Lattices. | J. Ian Munro, Corwin Sinnamon |
| 2018 | Minimum Cut of Directed Planar Graphs in | Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann |
| 2018 | Consistent Hashing with Bounded Loads. | Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam |
| 2018 | Embeddability in ℝ | Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer |
| 2018 | Cycles in Adversarial Regularized Learning. | Panayotis Mertikopoulos, Christos H. Papadimitriou, Georgios Piliouras |
| 2018 | The Robust Sensitivity of Boolean Functions. | Shachar Lovett, Avishay Tal, Jiapeng Zhang |
| 2018 | Probabilistic Existence of Large Sets of Designs. | Shachar Lovett, Sankeerth Rao, Alexander Vardy |
| 2018 | When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2018 | Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. | Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlk |
| 2018 | The complexity of independent set reconfiguration on bipartite graphs. | Daniel Lokshtanov, Amer E. Mouawad |
| 2018 | Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms. | Huan Li, Zhongzhi Zhang |
| 2018 | On the Competition Complexity of Dynamic Mechanism Design. | Siqi Liu, Christos-Alexandros Psomas |
| 2018 | Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. | Andrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams |
| 2018 | Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. | Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stphan Thomass, Meirav Zehavi |
| 2018 | Online Facility Location against a | Harry Lang |