| 1 | -- | 2 | Fedor V. Fomin, Vladimir V. Podolskii. CSR 2018 Special Issue on TOCS |
| 3 | -- | 16 | Alexander Kozachinskiy. Recognizing Read-Once Functions from Depth-Three Formulas |
| 17 | -- | 34 | Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette. The Clever Shopper Problem |
| 35 | -- | 61 | Emmanuel Jeandel, Etienne Moutot, Pascal Vanier. Slopes of Multidimensional Subshifts |
| 62 | -- | 100 | Jayakrishnan Madathil, Saket Saurabh 0001, Meirav Zehavi. Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree |
| 101 | -- | 119 | Rahul Jain 0001, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs. Quadratically Tight Relations for Randomized Query Complexity |
| 120 | -- | 140 | Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje. Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing |
| 141 | -- | 176 | Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber. Grammar-Based Compression of Unranked Trees |
| 177 | -- | 197 | Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou. Periodicity in Data Streams with Wildcards |