| 2017 | Distributed Degree Splitting, Edge Coloring, and Orientations. | Mohsen Ghaffari, Hsin-Hao Su |
| 2017 | Random Contractions and Sampling for Hypergraph and Hedge Connectivity. | Mohsen Ghaffari, David R. Karger, Debmalya Panigrahi |
| 2017 | Strong Connectivity in Directed Graphs under Failures, with Applications. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2017 | Sparse Suffix Tree Construction in Optimal Time and Space. | Pawel Gawrychowski, Tomasz Kociumaka |
| 2017 | Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications. | Jiawei Gao, Russell Impagliazzo, Antonina Kolokolova, R. Ryan Williams |
| 2017 | On the insertion time of random walk cuckoo hashing. | Alan M. Frieze, Tony Johansson |
| 2017 | LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. | Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli |
| 2017 | Permutation Property Testing under Different Metrics with Low Query Complexity. | Jacob Fox, Fan Wei |
| 2017 | A tight bound for Green's arithmetic triangle removal lemma in vector spaces. | Jacob Fox, Lszl Mikls Lovsz |
| 2017 | Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. | Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna |
| 2017 | Spanning Circuits in Regular Matroids. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2017 | Building a Good Team: Secretary Problems and the Supermodular Degree. | Moran Feldman, Rani Izsak |
| 2017 | Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization. | Vitaly Feldman, Cristbal Guzmn, Santosh S. Vempala |
| 2017 | Reordering Buffers with Logarithmic Diameter Dependency for Trees. | Matthias Englert, Harald Rcke |
| 2017 | Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. | Michael Elkin, Ofer Neiman |
| 2017 | Convergence of Incentive-Driven Dynamics in Fisher Markets. | Krishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman |
| 2017 | Best-Response Dynamics in Combinatorial Auctions with Item Bidding. | Paul Dtting, Thomas Kesselheim |
| 2017 | Scaling Algorithms for Weighted Matching in General Graphs. | Ran Duan, Seth Pettie, Hsin-Hao Su |
| 2017 | Connectivity Oracles for Graphs Subject to Vertex Failures. | Ran Duan, Seth Pettie |
| 2017 | Parameter-free Topology Inference and Sparsification for Data on Manifolds. | Tamal K. Dey, Zhe Dong, Yusu Wang |
| 2017 | Random Walks with the Minimum Degree Local Rule Have | Roee David, Uriel Feige |
| 2017 | Robust algorithms with polynomial loss for near-unanimity CSPs. | Vctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal |
| 2017 | Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in ( | Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu |
| 2017 | Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling. | Michael B. Cohen, Cameron Musco, Christopher Musco |
| 2017 | Exploring an Infinite Space with Finite Memory Scouts. | Lihi Cohen, Yuval Emek, Oren Louidor, Jara Uitto |