| 40 | -- | 0 | Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée. Philippe flajolet, the father of analytic combinatorics |
| 41 | -- | 0 | Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas. Three-coloring triangle-free planar graphs in linear time |
| 42 | -- | 0 | Shlomo Moran, Sagi Snir, Wing-Kin Sung. Partial convex recolorings of trees and galled networks: Tight upper and lower bounds |
| 43 | -- | 0 | Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote. Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension |
| 44 | -- | 0 | Paul Bonsma, Frederic Dorn. Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree |
| 45 | -- | 0 | Liam Roditty, Asaf Shapira. All-pairs shortest paths with a sublinear additive error |
| 46 | -- | 0 | David Pritchard, Ramakrishna Thurimella. Fast computation of small cuts via cycle space sampling |
| 47 | -- | 0 | Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller. Broadcast scheduling: Algorithms and complexity |
| 48 | -- | 0 | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani. An improved approximation algorithm for resource allocation |
| 49 | -- | 0 | Dimitris Fotakis. Memoryless facility location in one pass |
| 50 | -- | 0 | Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang, Yong Zhang. A new upper bound 2.5545 on 2D Online Bin Packing |
| 51 | -- | 0 | Jeff Edmonds, Kirk Pruhs. Cake cutting really is not a piece of cake |
| 52 | -- | 0 | Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti. Succinct indexes for strings, binary relations and multilabeled trees |
| 53 | -- | 0 | Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira. Fully compressed suffix trees |
| 54 | -- | 0 | Alexander Izsak, Nicholas Pippenger. Carry propagation in multiplication by constants |