| 719 | -- | 734 | Emanuele G. Fusco, Andrzej Pelc. Trade-offs Between the Size of Advice and Broadcasting Time in Trees |
| 735 | -- | 742 | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko. Approximating Minimum-Power Degree and Connectivity Problems |
| 766 | -- | 805 | Eldar Fischer, Orly Yahalom. Testing Convexity Properties of Tree Colorings |
| 806 | -- | 818 | Michael Arnold, Enno Ohlebusch. Linear Time Algorithms for Generalizations of the Longest Common Substring Problem |
| 819 | -- | 828 | Robert Dabrowski, Wojciech Plandowski. On Word Equations in One Variable |
| 829 | -- | 852 | Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle. Detecting Regular Visit Patterns |
| 853 | -- | 876 | Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam. Permutation Betting Markets: Singleton Betting with Extra Information |
| 877 | -- | 889 | Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs. Average Rate Speed Scaling |
| 890 | -- | 937 | Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani. Finding a Minimum-depth Embedding of a Planar Graph in ::::O::::(::::n:::::::4:::) Time |
| 938 | -- | 968 | Joshua Buresh-Oppenheim, Sashka Davis, Russell Impagliazzo. A Stronger Model of Dynamic Programming Algorithms |
| 969 | -- | 986 | Zhi-Zhong Chen, Guohui Lin, Lusheng Wang. An Approximation Algorithm for the Minimum Co-Path Set Problem |
| 987 | -- | 1003 | Athanassios Koutsonas, Dimitrios M. Thilikos. Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms |
| 1004 | -- | 1016 | Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid. Algorithms for Marketing-Mix Optimization |
| 1017 | -- | 1030 | Viswanath Nagarajan, R. Ravi. The Directed Orienteering Problem |