| 365 | -- | 385 | Chien-Hung Lin, Jia Jie Liu, Yue-Li Wang. Global Strong Defensive Alliances of Sierpiński-Like Graphs |
| 386 | -- | 423 | Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien. Static Strategies for Worksharing with Unrecoverable Interruptions |
| 424 | -- | 440 | Konstantinos Kollias. Nonpreemptive Coordination Mechanisms for Identical Machines |
| 441 | -- | 453 | Martin Hoefer, Alexander Skopalik. On the Complexity of Pareto-Optimal Nash and Strong Equilibria |
| 454 | -- | 466 | Angsheng Li, Peng Zhang. Unbalanced Graph Partitioning |
| 467 | -- | 502 | Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe. The Complexity of Computing Minimal Unidirectional Covering Sets |
| 503 | -- | 506 | Eric Allender, Vikraman Arvind, Meena Mahajan. Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series |