| 251 | -- | 274 | János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin. Online Clustering with Variable Sized Clusters |
| 275 | -- | 316 | Dániel Marx, Ildikó Schlotter. Cleaning Interval Graphs |
| 317 | -- | 338 | Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara. Route-Enabling Graph Orientation Problems |
| 339 | -- | 353 | Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann. Unified Compression-Based Acceleration of Edit-Distance Computation |
| 354 | -- | 370 | Kuan-Yu Chen, Kun-Mao Chao. A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings |
| 371 | -- | 390 | Moshe Hershcovitch, Haim Kaplan. I/O Efficient Dynamic Data Structures for Longest Prefix Queries |
| 391 | -- | 408 | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour. Two-stage Robust Network Design with Exponential Scenarios |
| 409 | -- | 442 | Graham Cormode, Michael Mitzenmacher, Justin Thaler. Streaming Graph Computations with a Helpful Advisor |
| 443 | -- | 466 | Chung-Shou Liao, D. T. Lee. Power Domination in Circular-Arc Graphs |
| 467 | -- | 479 | Bang Ye Wu. A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem |