| 383 | -- | 393 | Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca. On Independent Vertex Sets in Subclasses of Apple-Free Graphs |
| 394 | -- | 412 | Vladimir Kolmogorov. A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph |
| 413 | -- | 436 | Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi. Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs |
| 437 | -- | 447 | Satoru Iwata, Yusuke Kobayashi. An Algorithm for Minimum Cost Arc-Connectivity Orientations |
| 448 | -- | 479 | Eyal Amir. Approximation Algorithms for Treewidth |
| 480 | -- | 504 | Sudheer Sahu, John H. Reif. Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly |
| 529 | -- | 549 | Danny Segev, Gil Segev. Approximate ::::k::::-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing |
| 550 | -- | 576 | Antonio Fernández, Ernesto Jiménez, Michel Raynal, Gilles Trédan. A Timing Assumption and Two ::::t::::-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems |
| 577 | -- | 604 | Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao. ::::::::l::::::::::2:::::2::: Spreading Metrics for Vertex Ordering Problems |
| 605 | -- | 620 | Chris Studholme, Ian F. Blake. Random Matrices and Codes for the Erasure Channel |