| 359 | -- | 368 | Jean Cardinal, Gwenaël Joret. Hitting All Maximal Independent Sets of a Bipartite Graph |
| 369 | -- | 378 | Erik D. Demaine, John Iacono, Stefan Langerman. Worst-Case Optimal Tree Layout in External Memory |
| 379 | -- | 399 | Danny Ziyi Chen, Xuehou Tan, Haitao Wang, Gangshan Wu. Optimal Point Movement for Covering Circular Regions |
| 400 | -- | 429 | Dana Ron, Rocco A. Servedio. Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities |
| 430 | -- | 449 | Chih-En Kuo, Yue-Li Wang, Jia Jie Liu, Ming-Tat Ko. Resequencing a Set of Strings Based on a Target String |
| 450 | -- | 466 | Richard Cole 0001, Tsvi Kopelowitz, Moshe Lewenstein. Suffix Trays and Suffix Trists: Structures for Faster Text Indexing |
| 467 | -- | 492 | Petra Berenbrink, Robert Elsässer, Thomas Sauerwald. Communication Complexity of Quasirandom Rumor Spreading |
| 493 | -- | 514 | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula. Approximability of Capacitated Network Design |
| 515 | -- | 538 | Wing-Kai Hon, Tsung-Han Ku, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Sharma V. Thankachan, Jeffrey Scott Vitter. Compressing Dictionary Matching Index via Sparsification Technique |
| 539 | -- | 606 | Ittai Abraham, Yair Bartal, Ofer Neiman. Local Embeddings of Metric Spaces |
| 607 | -- | 619 | Andrzej Lingas, Mia Persson. A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows |
| 620 | -- | 655 | Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer. The Approximate Rectangle of Influence Drawability Problem |
| 656 | -- | 685 | Kevin Buchin, Bettina Speckmann, Kevin Verbeek. Angle-Restricted Steiner Arborescences for Flow Map Layout |