| 2018 | Prophet Secretary for Combinatorial Auctions and Matroids. | Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla |
| 2018 | Sampling Random Colorings of Sparse Random Graphs. | Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda |
| 2018 | On Sampling Edges Almost Uniformly. | Talya Eden, Will Rosenbaum |
| 2018 | Testing bounded arboricity. | Talya Eden, Reut Levi, Dana Ron |
| 2018 | Thin graph classes and polynomial-time approximation schemes. | Zdenek Dvork |
| 2018 | Nearly Tight Bounds for Sandpile Transience on the Grid. | David Durfee, Matthew Fahrbach, Yu Gao, Tao Xiao |
| 2018 | Robustly Learning a Gaussian: Getting Optimal Error, Efficiently. | Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart |
| 2018 | Truthful Multi-Parameter Auctions with Online Supply: an Impossible Combination. | Nikhil R. Devanur, Balasubramanian Sivan, Vasilis Syrgkanis |
| 2018 | A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications. | Nikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod |
| 2018 | Non interactive simulation of correlated distributions is decidable. | Anindya De, Elchanan Mossel, Joe Neeman |
| 2018 | Envy-free Chore Division for An Arbitrary Number of Agents. | Sina Dehghani, Alireza Farhadi, Mohammad Taghi Hajiaghayi, Hadi Yami |
| 2018 | Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack. | Anindya De |
| 2018 | Which Distribution Distances are Sublinearly Testable? | Constantinos Daskalakis, Gautam Kamath, John Wright |
| 2018 | Testing Ising Models. | Constantinos Daskalakis, Nishanth Dikkala, Gautam Kamath |
| 2018 | Geometric Rescaling Algorithms for Submodular Function Minimization. | Daniel Dadush, Lszl A. Vgh, Giacomo Zambelli |
| 2018 | Fast, Deterministic and Sparse Dimensionality Reduction. | Daniel Dadush, Cristbal Guzmn, Neil Olver |
| 2018 | A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. | Radu Curticapean, Nathan Lindzey, Jesper Nederlof |
| 2018 | Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. | David Coudert, Guillaume Ducoffe, Alexandru Popa |
| 2018 | Randomized Online Matching in Regular Graphs. | Ilan Reuven Cohen, David Wajc |
| 2018 | Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. | Michael B. Cohen, T. S. Jayram, Jelani Nelson |
| 2018 | A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. | Vincent Cohen-Addad, ric Colin de Verdire, Arnaud de Mesmay |
| 2018 | The Bane of Low-Dimensionality Clustering. | Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman |
| 2018 | Hierarchical Clustering: Objective Functions and Algorithms. | Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu |
| 2018 | A Fast Approximation Scheme for Low-Dimensional | Vincent Cohen-Addad |
| 2018 | The Classical Complexity of Boson Sampling. | Peter Clifford, Raphal Clifford |