| 2019 | Reproducibility and Pseudo-Determinism in Log-Space. | Ofer Grossman, Yang P. Liu |
| 2019 | Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities. | Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin |
| 2019 | Optimizing quantum optimization algorithms via faster quantum gradient computation. | Andrs Gilyn, Srinivasan Arunachalam, Nathan Wiebe |
| 2019 | Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching. | Mohsen Ghaffari, David Wajc |
| 2019 | Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. | Mohsen Ghaffari, Jara Uitto |
| 2019 | Distributed Maximal Independent Set using Small Messages. | Mohsen Ghaffari |
| 2019 | Approximating Maximin Share Allocations. | Jugal Garg, Peter McGlaughlin, Setareh Taki |
| 2019 | Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time. | Shashwat Garg, Janardhan Kulkarni, Shi Li |
| 2019 | Beating Greedy for Stochastic Bipartite Matching. | Buddhima Gamlath, Sagar Kale, Ola Svensson |
| 2019 | Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS. | Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour |
| 2019 | Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions. | Kyle Fox, Debmalya Panigrahi, Fred Zhang |
| 2019 | Embedding Planar Graphs into Low-Treewidth Graphs with Applications to Efficient Approximation Schemes for Metric Problems. | Eli Fox-Epstein, Philip N. Klein, Aaron Schild |
| 2019 | The Complexity of Approximately Counting Retractions. | Jacob Focke, Leslie Ann Goldberg, Stanislav Zivn |
| 2019 | Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. | Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi |
| 2019 | Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. | Hendrik Fichtenberger, Pan Peng, Christian Sohler |
| 2019 | On Primal-Dual Circle Representations. | Stefan Felsner, Gnter Rote |
| 2019 | A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. | Uriel Feige, Janardhan Kulkarni, Shi Li |
| 2019 | Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity. | Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2019 | Popular Matchings and Limits to Tractability. | Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang |
| 2019 | Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity. | lfar Erlingsson, Vitaly Feldman, Ilya Mironov, Ananth Raghunathan, Kunal Talwar, Abhradeep Thakurta |
| 2019 | Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. | David Eppstein, Bruce A. Reed |
| 2019 | Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time. | Alina Ene, Huy L. Nguyen |
| 2019 | New Lower Bounds for the Number of Pseudoline Arrangements. | Adrian Dumitrescu, Ritankar Mandal |
| 2019 | Every Collinear Set in a Planar Graph Is Free. | Vida Dujmovic, Fabrizio Frati, Daniel Gonalves, Pat Morin, Gnter Rote |
| 2019 | A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters. | Guillaume Ducoffe |