| 0 | -- | 0 | Zeev Nutov. Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies |
| 0 | -- | 0 | Florian Barbero, Christophe Paul, Michal Pilipczuk. Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs |
| 0 | -- | 0 | Timothy M. Chan. Improved Deterministic Algorithms for Linear Programming in Low Dimensions |
| 0 | -- | 0 | Matti Karppa, Petteri Kaski, Jukka Kohonen. A Faster Subquadratic Algorithm for Finding Outlier Correlations |
| 0 | -- | 0 | Niv Buchbinder, Moran Feldman. Deterministic Algorithms for Submodular Maximization Problems |
| 0 | -- | 0 | Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm. On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique |
| 0 | -- | 0 | Harold N. Gabow. f-factors |
| 0 | -- | 0 | Shiri Chechik, Christian Wulff-Nilsen. Near-Optimal Light Spanners |
| 0 | -- | 0 | Rasmus Pagh. CoveringLSH: Locality-Sensitive Hashing without False Negatives |
| 0 | -- | 0 | Arnab Bhattacharyya, Fabrizio Grandoni 0001, Aleksandar Nikolov, Barna Saha, Saket Saurabh 0001, Aravindan Vijayaraghavan, Qin Zhang. Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue |
| 0 | -- | 0 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Michal Pilipczuk, Marcin Wrochna. Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth |
| 0 | -- | 0 | Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir. Subtree Isomorphism Revisited |
| 0 | -- | 0 | Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk. Subexponential Parameterized Algorithm for Interval Completion |
| 0 | -- | 0 | Mark de Berg, Joachim Gudmundsson, Mehran Mehr. Faster Algorithms for Computing Plurality Points |