| 2019 | Near Optimal Algorithms For The Single Source Replacement Paths Problem. | Shiri Chechik, Sarel Cohen |
| 2019 | Hierarchical Clustering better than Average-Linkage. | Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh |
| 2019 | Exact Distance Oracles for Planar Graphs with Failing Vertices. | Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka |
| 2019 | Distributed Triangle Detection via Expander Decomposition. | Yi-Jun Chang, Seth Pettie, Hengjie Zhang |
| 2019 | Simple Contention Resolution via Multiplicative Weight Updates. | Yi-Jun Chang, Wenyu Jin, Seth Pettie |
| 2019 | Foundations of Differentially Oblivious Algorithms. | T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi |
| 2019 | Optimal Lower Bounds for Sketching Graph Cuts. | Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan |
| 2019 | I/O-Efficient Algorithms for Topological Sort and Related Problems. | Nairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang |
| 2019 | Approximability of the Six-vertex Model. | Jin-Yi Cai, Tianyu Liu, Pinyan Lu |
| 2019 | Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms. | Jin-Yi Cai, Artem Govorov |
| 2019 | Minimizing Interference Potential Among Moving Entities. | Daniel Busto, William S. Evans, David G. Kirkpatrick |
| 2019 | Strategies for Stable Merge Sorting. | Sam Buss, Alexander Knop |
| 2019 | Quantum algorithms and approximating polynomials for composed functions with shared inputs. | Mark Bun, Robin Kothari, Justin Thaler |
| 2019 | SETH Says: Weak Frchet Distance is Faster, but only if it is Continuous and in One Dimension. | Kevin Buchin, Tim Ophelders, Bettina Speckmann |
| 2019 | Approximating (k, ℓ)-center clustering for curves. | Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Lffler, Martijn Struijs |
| 2019 | k-Servers with a Smile: Online Algorithms via Projections. | Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor |
| 2019 | Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. | Niv Buchbinder, Moran Feldman, Mohit Garg |
| 2019 | Metrical task systems on trees via mirror descent and unfair gluing. | Sbastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee |
| 2019 | Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. | Karl Bringmann, Marvin Knnemann, Philip Wellnitz |
| 2019 | Frchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. | Karl Bringmann, Marvin Knnemann, Andr Nusser |
| 2019 | An Algorithmic Blend of LPs and Ring Equations for Promise CSPs. | Joshua Brakensiek, Venkatesan Guruswami |
| 2019 | On the Spanning and Routing Ratio of Theta-Four. | Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid |
| 2019 | Greedy spanners are optimal in doubling metrics. | Glencora Borradaile, Hung Le, Christian Wulff-Nilsen |
| 2019 | XOR Codes and Sparse Learning Parity with Noise. | Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan |
| 2019 | On the Structure of Unique Shortest Paths in Graphs. | Greg Bodwin |