| 1 | -- | 0 | Ignaz Rutter, Alexander Wolff. Computing large matchings fast |
| 2 | -- | 0 | Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa. Approximation algorithms for the sex-equal stable marriage problem |
| 3 | -- | 0 | Hristo Djidjev. A faster algorithm for computing the girth of planar and bounded genus graphs |
| 4 | -- | 0 | Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella. Length-bounded cuts and flows |
| 5 | -- | 0 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie. Additive spanners and (alpha, beta)-spanners |
| 6 | -- | 0 | Michele Flammini, Gaia Nicosia. On the bicriteria ::::k::::-server problem |
| 8 | -- | 0 | Jie Gao, Michael Langberg, Leonard J. Schulman. Clustering lines in high-dimensional space: Classification of incomplete data |
| 9 | -- | 0 | Atlas F. Cook, Carola Wenk. Geodesic Fréchet distance inside a simple polygon |
| 10 | -- | 0 | Paolo Ferragina, Rossano Venturini. The compressed permuterm index |
| 11 | -- | 0 | Pankaj K. Agarwal, Lars Arge, Ke Yi. I/O-efficient batched union-find and its applications to terrain analysis |
| 12 | -- | 0 | Ashish Goel, Sudipto Guha, Kamesh Munagala. How to probe for an extreme value |
| 13 | -- | 0 | Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos. Taxes for linear atomic congestion games |