| 1 | -- | 3 | Christophe Paul, Markus Bläser. Preface of STACS 2020 Special Issue |
| 4 | -- | 27 | Dietmar Berwanger, Laurent Doyen 0001. Observation and Distinction: Representing Information in Infinite Games |
| 28 | -- | 51 | Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich 0001, Maximilian Katzmann. Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs |
| 52 | -- | 88 | Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle. Typical Sequences Revisited - Computing Width Parameters of Graphs |
| 89 | -- | 124 | Andrés Cristi, Mathieu Mari, Andreas Wiese. Fixed-Parameter Algorithms for Unsplittable Flow Cover |
| 125 | -- | 148 | Jarkko Kari, Etienne Moutot. Decidability and Periodicity of Low Complexity Tilings |
| 149 | -- | 177 | Nikhil Vyas 0001, R. Ryan Williams. Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms |
| 178 | -- | 218 | Jan Philipp Wächter, Armin Weiß. An Automaton Group with PSPACE-Complete Word Problem |