| 0 | -- | 0 | Sergio Cabello. Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs |
| 0 | -- | 0 | David Adjiashvili. Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs |
| 0 | -- | 0 | Ami Paz, Gregory Schwartzman. A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model |
| 0 | -- | 0 | Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour. Approximation Schemes for Clustering with Outliers |
| 0 | -- | 0 | Nikhil Bansal, Marek Eliés, Lukasz Jez, Grigorios Koumoutsos. h, k)-Server Problem on Bounded Depth Trees |
| 0 | -- | 0 | David Adjiashvili, Andrea Baggio, Rico Zenklusen. Firefighting on Trees Beyond Integrality Gaps |
| 0 | -- | 0 | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger. Domination When the Stars Are Out |
| 0 | -- | 0 | Dániel Marx, Virginia Vassilevska Williams, Neal E. Young. Introduction to the Special Issue on SODA 2017 |
| 0 | -- | 0 | Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek. Even Delta-Matroids and the Complexity of Planar Boolean CSPs |
| 0 | -- | 0 | Jiawei Gao 0001, Russell Impagliazzo, Antonina Kolokolova, Ryan Williams 0001. Completeness for First-order Properties on Sparse Structures with Algorithmic Applications |
| 0 | -- | 0 | Diodato Ferraioli, Carmine Ventre. Metastability of the Logit Dynamics for Asymptotically Well-Behaved Potential Games |
| 0 | -- | 0 | Aravind Srinivasan. Editorial |
| 0 | -- | 0 | Veli Mäkinen, Alexandru I. Tomescu, Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi. Sparse Dynamic Programming on DAGs with Small Width |
| 0 | -- | 0 | Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz. Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes |