| 759 | -- | 788 | Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil. Practical and Efficient Circle Graph Recognition |
| 789 | -- | 843 | Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil. Practical and Efficient Split Decomposition via Graph-Labelled Trees |
| 844 | -- | 863 | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni. On the Advantage of Overlapping Clusters for Minimizing Conductance |
| 864 | -- | 883 | Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang. Cache-Oblivious Hashing |
| 884 | -- | 905 | Feodor F. Dragan, Ekkehard Köhler. An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs |
| 906 | -- | 924 | Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao 0001. Optimal Indexes for Sparse Bit Vectors |
| 925 | -- | 957 | Anne Benoit, Matthieu Gallet, Bruno Gaujal, Yves Robert. Computing the Throughput of Probabilistic and Replicated Streaming Applications |
| 958 | -- | 973 | Leonor Frias, Salvador Roura. Multikey Quickselect |