| 0 | -- | 0 | Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko. Dynamic pricing for impatient bidders |
| 0 | -- | 0 | Philip N. Klein, Shay Mozes, Oren Weimann. Shortest paths in directed planar graphs with negative lengths: A linear-space ::::O::::(::::n:::: log:::2::: ::::n::::)-time algorithm |
| 0 | -- | 0 | Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp. Periodicity testing with sublinear samples and space |
| 0 | -- | 0 | Bruce A. Bobier, Joe Sawada. A fast algorithm to generate open meandric systems and meanders |
| 0 | -- | 0 | Claire Mathieu. Foreword to special issue SODA 2009 |
| 0 | -- | 0 | Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi. Dial a Ride from ::::k::::-forest |
| 0 | -- | 0 | George Christodoulou, Elias Koutsoupias, Annamária Kovács. Mechanism design for fractional scheduling on unrelated machines |
| 0 | -- | 0 | Benjamin Aminof, Orna Kupferman, Robby Lampert. Reasoning about online algorithms with weighted automata |
| 0 | -- | 0 | Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz. Optimization problems in multiple-interval graphs |
| 0 | -- | 0 | Timothy M. Chan. Comparison-based time-space lower bounds for selection |
| 0 | -- | 0 | Alon Shalita, Uri Zwick. Efficient algorithms for the 2-gathering problem |
| 0 | -- | 0 | Dániel Marx. Approximating fractional hypertree width |
| 0 | -- | 0 | Ashish Goel, Michael Kapralov, Sanjeev Khanna. Perfect matchings via uniform sampling in regular bipartite graphs |
| 0 | -- | 0 | Amos Korman. Labeling schemes for vertex connectivity |
| 0 | -- | 0 | Zoya Svitkina, Éva Tardos. Facility location with hierarchical facility costs |
| 0 | -- | 0 | Konstantinos Panagiotou, Angelika Steger. Maximal biconnected subgraphs of random planar graphs |
| 0 | -- | 0 | Yossi Azar, Iftah Gamzu, Shai Gutner. Truthful unsplittable flow for large capacity networks |
| 0 | -- | 0 | James Aspnes, Keren Censor. Approximate shared-memory counting despite a strong adversary |
| 0 | -- | 0 | Omid Madani, Mikkel Thorup, Uri Zwick. Discounted deterministic Markov decision processes and discounted all-pairs shortest paths |
| 0 | -- | 0 | Susanne Albers. Editorial Note |
| 0 | -- | 0 | Sergio Cabello. Finding shortest contractible and shortest separating cycles in embedded graphs |