| 0 | -- | 0 | Timothy M. Chan. On the bichromatic ::::k::::-set problem |
| 0 | -- | 0 | Kenneth L. Clarkson. Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm |
| 0 | -- | 0 | Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani. Fast asynchronous Byzantine agreement and leader election with full information |
| 0 | -- | 0 | Marcel R. Ackermann, Johannes Blömer, Christian Sohler. Clustering for metric and nonmetric distance measures |
| 0 | -- | 0 | Ulrich Faigle, Britta Peis. Two-phase greedy algorithms for some classes of combinatorial linear programs |
| 0 | -- | 0 | Steve Oudot, Leonidas J. Guibas, Jie Gao, Yue Wang. Geodesic delaunay triangulations in bounded planar domains |
| 0 | -- | 0 | Yuval Emek, David Peleg, Liam Roditty. A near-linear-time algorithm for computing replacement paths in planar directed graphs |
| 0 | -- | 0 | Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang. Hausdorff distance under translation for points and balls |
| 0 | -- | 0 | Mohammad Taghi Hajiaghayi, Shang-Hua Teng. Foreword to special issue on SODA 2008 |
| 0 | -- | 0 | Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar. Finding one tight cycle |
| 0 | -- | 0 | Susanne Albers. Editorial note |
| 0 | -- | 0 | Reid Andersen. A local algorithm for finding dense subgraphs |
| 0 | -- | 0 | Virginia Vassilevska Williams. Nondecreasing paths in a weighted graph or: How to optimally read a train schedule |
| 0 | -- | 0 | John Gunnar Carlsson, Benjamin Armbruster, Yinyu Ye. Finding equitable convex partitions of points in a polygon efficiently |
| 0 | -- | 0 | Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina. On distributing symmetric streaming computations |
| 0 | -- | 0 | Zoya Svitkina. Lower-bounded facility location |