| 2019 | Towards a Unified Theory of Sparsification for Matching Problems. | Sepehr Assadi, Aaron Bernstein |
| 2019 | Assignment Mechanisms under Distributional Constraints. | Itai Ashlagi, Amin Saberi, Ali Shameli |
| 2019 | Fully Polynomial-Time Approximation Schemes for Fair Rent Division. | Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi |
| 2019 | Constructive Polynomial Partitioning for Algebraic Curves in R | Boris Aronov, Esther Ezra, Joshua Zahl |
| 2019 | A Nearly-Linear Bound for Chasing Nested Convex Bodies. | C. J. Argue, Sbastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee |
| 2019 | A PTAS for Euclidean TSP with Hyperplane Neighborhoods. | Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior |
| 2019 | Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. | Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs |
| 2019 | Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices. | Georgios Amanatidis, Pieter Kleer |
| 2019 | An Illuminating Algorithm for the Light Bulb Problem. | Josh Alman |
| 2019 | Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications. | AmirMahdi Ahmadinejad, Arun Jambulapati, Amin Saberi, Aaron Sidford |
| 2019 | Interval Vertex Deletion Admits a Polynomial Kernel. | Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2019 | Stochastic Submodular Cover with Limited Adaptivity. | Arpit Agarwal, Sepehr Assadi, Sanjeev Khanna |
| 2019 | Theorems of Carathodory, Helly, and Tverberg without dimension. | Karim A. Adiprasito, Imre Brny, Nabil H. Mustafa |
| 2019 | Iterative Refinement for ℓp-norm Regression. | Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva |
| 2019 | Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. | Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2019 | SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. | Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay |
| 2019 | Non-empty Bins with Simple Tabulation Hashing. | Anders Aamand, Mikkel Thorup |
| 2019 | Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. | Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang |
| 2019 | Extremal and probabilistic results for order types. | Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni |
| 2019 | High-Dimensional Robust Mean Estimation in Nearly-Linear Time. | Yu Cheng, Ilias Diakonikolas, Rong Ge |
| 2019 | Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. | Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse |
| 2019 | Pricing for Online Resource Allocation: Intervals and Paths. | Shuchi Chawla, J. Benjamin Miller, Yifeng Teng |
| 2019 | (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. | Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon |
| 2019 | Zeros of Holant problems: locations and algorithms. | Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang |
| 2018 | Minor-matching hypertree width. | Nikola Yolov |