| 28 | -- | 0 | Zachary Friggstad, Mohammad R. Salavatipour. Minimizing movement in mobile facility location problems |
| 29 | -- | 0 | Allan Borodin, David Cashman, Avner Magen. How well can primal-dual and local-ratio algorithms perform? |
| 30 | -- | 0 | Kai-Min Chung, Omer Reingold, Salil P. Vadhan. S-T connectivity on digraphs with a known stationary distribution |
| 31 | -- | 0 | Martin Gairing, Burkhard Monien, Karsten Tiemann. Routing (un-) splittable flow in games with player-specific affine latency functions |
| 32 | -- | 0 | Adi Rosén, Gabriel Scalosub. Rate vs. buffer size-greedy information gathering on the line |
| 33 | -- | 0 | Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie. Minimizing flow time in the wireless gathering problem |
| 34 | -- | 0 | Evangelos Kranakis, Danny Krizanc, Pat Morin. Randomized rendezvous with limited memory |
| 35 | -- | 0 | Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan. Max-coloring and online coloring with bandwidths on interval graphs |
| 36 | -- | 0 | Samir Khuller, Azarakhsh Malekian, Julián Mestre. To fill or not to fill: The gas station problem |
| 37 | -- | 0 | Don Coppersmith, Tomasz Nowicki, Giuseppe Paleologo, Charles Philippe Tresser, Chai Wah Wu. The optimality of the online greedy algorithm in carpool and chairman assignment problems |
| 38 | -- | 0 | Philip Bille, Inge Li Gørtz. The tree inclusion problem: In linear space and faster |
| 39 | -- | 0 | Eduardo Sany Laber, Marco Molinaro. Improved approximations for the hotlink assignment problem |