| 14 | -- | 0 | Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck. Data structures for mergeable trees |
| 15 | -- | 0 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania. Decision trees for entity identification: Approximation algorithms and hardness results |
| 16 | -- | 0 | Tobias Jacobs. Constant factor approximations for the hotlink assignment problem |
| 17 | -- | 0 | Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang. Tree exploration with logarithmic memory |
| 18 | -- | 0 | Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev. Set connectivity problems in undirected graphs and the directed steiner network problem |
| 19 | -- | 0 | Éric Colin de Verdière, Alexander Schrijver. Shortest vertex-disjoint two-face paths in planar graphs |
| 20 | -- | 0 | Michael Elkin. Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners |
| 21 | -- | 0 | Graham Cormode, S. Muthukrishnan, Ke Yi. Algorithms for distributed functional monitoring |
| 22 | -- | 0 | Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko. Sum edge coloring of multigraphs via configuration LP |
| 23 | -- | 0 | Avraham Ben-Aroya, Sivan Toledo. Competitive analysis of flash memory algorithms |
| 24 | -- | 0 | Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur. Finding witnesses by peeling |
| 25 | -- | 0 | Yongwook Choi, Wojciech Szpankowski. Constrained pattern matching |
| 26 | -- | 0 | Bin Fu, Ming-Yang Kao, Lusheng Wang. Discovering almost any hidden motif from multiple sequences |
| 27 | -- | 0 | Ge Nong, Sen Zhang, Wai Hong Chan. Computing the inverse sort transform in linear time |