| 209 |  --  | 210 | Zhi-Zhong Chen, Xiaotie Deng, Ding-Zhu Du. Preface | 
| 211 |  --  | 222 | Sumit Ganguly. Counting distinct items over update streams | 
| 223 |  --  | 236 | Erdong Chen, Linji Yang, Hao Yuan. Longest increasing subsequences in windows based on canonical antichain partition | 
| 237 |  --  | 252 | Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir. Efficient algorithms for center problems in cactus networks | 
| 253 |  --  | 270 | Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking. Decision-making based on approximate and smoothed Pareto curves | 
| 271 |  --  | 291 | Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang. Average case analysis for tree labelling schemes | 
| 292 |  --  | 315 | Bodo Manthey, Rüdiger Reischuk. Smoothed analysis of binary search trees | 
| 316 |  --  | 330 | Lan Liu, Chen Xi, Jing Xiao, Tao Jiang. Complexity and approximation of the minimum recombinant haplotype configuration problem |