| 2018 | Parameterized Algorithms for Survivable Network Design with Uniform Demands. | Jrgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2018 | Targeting and Signaling in Ad Auctions. | Ashwinkumar Badanidiyuru, Kshipra Bhawalkar, Haifeng Xu |
| 2018 | Randomized Algorithms for Online Vector Load Balancing. | Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi |
| 2018 | Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. | Sepehr Assadi, Sanjeev Khanna |
| 2018 | Polycubes with Small Perimeter Defect. | Andrei Asinowski, Gill Barequet, Yufei Zheng |
| 2018 | A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs. | Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra |
| 2018 | Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities. | Nima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani |
| 2018 | Approximating the Largest Root and Applications to Interlacing Families. | Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava |
| 2018 | A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. | Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen |
| 2018 | Space-Optimal Majority in Population Protocols. | Dan Alistarh, James Aspnes, Rati Gelashvili |
| 2018 | Recognizing Weak Embeddings of Graphs. | Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tth |
| 2018 | Race Detection and Reachability in Nearly Series-Parallel DAGs. | Kunal Agrawal, Joseph Devietti, Jeremy T. Fineman, I-Ting Angelina Lee, Robert Utterback, Changming Xu |
| 2018 | Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP). | Divesh Aggarwal, Noah Stephens-Davidowitz |
| 2018 | On the complexity of range searching among curves. | Peyman Afshani, Anne Driemel |
| 2018 | Voronoi tessellations in the CRT and continuum random maps of finite excess. | Louigi Addario-Berry, Omer Angel, Guillaume Chapuy, ric Fusy, Christina Goldschmidt |
| 2018 | Ramsey Spanning Trees and their Applications. | Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman |
| 2018 | Near-Optimal Compression for the Planar Graph Metric. | Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2018 | Reachability Preservers: New Extremal Bounds and Approximation Algorithms. | Amir Abboud, Greg Bodwin |
| 2018 | A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs. | Andrew McGregor, Sofya Vorotnikova |
| 2018 | Quasi-regular sequences and optimal schedules for security games. | David Kempe, Leonard J. Schulman, Omer Tamuz |
| 2018 | Revenue Maximization with an Uncertainty-Averse Buyer. | Shuchi Chawla, Kira Goldner, J. Benjamin Miller, Emmanouil Pountourakis |
| 2017 | Front Matter. | |
| 2017 | Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs. | Sam Chiu-wai Wong |
| 2017 | LP-branching algorithms based on biased graphs. | Magnus Wahlstrm |
| 2017 | Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold. | ric Colin de Verdire, Salman Parsa |