| 1 | -- | 18 | Moses Ganardi, Danny Hucke, Markus Lohrey. ∗ |
| 441 | -- | 443 | René van Bevern, Gregory Kucherov. Special Issue on Computer Science Symposium in Russia (2019) |
| 462 | -- | 478 | Sergey M. Dudakov, Boris Karlov. On Decidability of Theories of Regular Languages |
| 479 | -- | 496 | Elena A. Petrova, Arseny M. Shur. Transition Property for Cube-Free Words |
| 497 | -- | 514 | Bireswar Das, Shivdutt Sharma. Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes |
| 515 | -- | 540 | Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001. Parameterized Complexity of Conflict-Free Set Cover |
| 541 | -- | 558 | Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman. Belga B-Trees |
| 559 | -- | 578 | Eric Allender, Rahul Ilango, Neekon Vafa. The Non-hardness of Approximating Circuit Size |
| 579 | -- | 592 | Suthee Ruangwises, Toshiya Itoh. Unpopularity Factor in the Marriage and Roommates Problems |
| 593 | -- | 612 | Shmuel T. Klein, Shoham Saadia, Dana Shapira. Forward Looking Huffman Coding |
| 613 | -- | 633 | Ludmila Glinskih, Dmitry Itsykson. On Tseitin Formulas, Read-Once Branching Programs and Treewidth |