| 581 | -- | 614 | Christoph Berkholz, Paul S. Bonsma, Martin Grohe. Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement |
| 615 | -- | 636 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna. Polynomial Kernelization for Removing Induced Claws and Diamonds |
| 637 | -- | 670 | Spyros Angelopoulos 0001, Diogo Arsénio, Christoph Dürr, Alejandro López-Ortiz. Multi-processor Search and Scheduling Problems with Setup Cost |
| 671 | -- | 676 | Alexander Rybalov. On the Generic Undecidability of the Halting Problem for Normalized Turing Machines |
| 677 | -- | 694 | Achour Mostéfaoui, Matoula Petrolia, Michel Raynal, Claude Jard. Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems |
| 695 | -- | 736 | Benedikt Bollig, Dietrich Kuske, Roy Mennicke. The Complexity of Model Checking Multi-Stack Systems |
| 737 | -- | 758 | Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt 0001, Heribert Vollmer. Paradigms for Parameterized Enumeration |
| 759 | -- | 783 | Takuya Yoshino, Kouichi Hirata. Tai Mapping Hierarchy for Rooted Labeled Trees Through Common Subforest |