| 20 | -- | 0 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi. Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location |
| 21 | -- | 0 | Alessandro Panconesi, Jaikumar Radhakrishnan. Expansion properties of (secure) wireless networks |
| 22 | -- | 0 | Ulrich Meyer, Norbert Zeh. I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths |
| 23 | -- | 0 | Chandra Chekuri, Nitish Korula, Martin Pál. Improved algorithms for orienteering and related problems |
| 24 | -- | 0 | Arash Asadpour, Uriel Feige, Amin Saberi. Santa claus meets hypergraph matchings |
| 25 | -- | 0 | Angelo Fanelli, Michele Flammini, Luca Moscardelli. The speed of convergence in congestion games under best-response dynamics |
| 26 | -- | 0 | Philippe Baptiste, Marek Chrobak, Christoph Dürr. Polynomial-time algorithms for minimum energy scheduling |
| 27 | -- | 0 | Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson. Tight approximation algorithms for scheduling with fixed jobs and nonavailability |
| 28 | -- | 0 | Jeff Edmonds, Kirk Pruhs. Scalably scheduling processes with arbitrary speedup curves |
| 29 | -- | 0 | Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin. Entropy, triangulation, and point location in planar subdivisions |
| 30 | -- | 0 | Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, Till Tantau. Smoothed analysis of left-to-right maxima with applications |
| 31 | -- | 0 | Frédérique Bassino, Julien Clément, Pierre Nicodème. Counting occurrences for a finite set of words: Combinatorial methods |
| 32 | -- | 0 | Vikraman Arvind, Piyush P. Kurur. Testing nilpotence of galois groups in polynomial time |