| 579 | -- | 588 | Timothy H. McNicholl. An Effective Carathéodory Theorem |
| 589 | -- | 610 | Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou. The Efficiency of Fair Division |
| 611 | -- | 620 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov. Cops and Robber Game Without Recharging |
| 621 | -- | 640 | Dale Daniel, Timothy H. McNicholl. Effective Versions of Local Connectivity Properties |
| 641 | -- | 674 | Erik Jan van Leeuwen, Jan van Leeuwen. Structure of Polynomial-Time Approximation |
| 675 | -- | 693 | Michael R. Fellows, Serge Gaspers, Frances A. Rosamond. Parameterizing by the Number of Numbers |
| 694 | -- | 705 | Mark Burgin, Bidyut Gupta. Second-Level Algorithms, Superrecursivity, and Recovery Problem in Distributed Systems |
| 706 | -- | 720 | Jan A. Bergstra, Inge Bethke. On the Contribution of Backward Jumps to Instruction Sequence Expressiveness |
| 721 | -- | 738 | Ruo-Wei Hung. Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs |