1. Preface of STACS 2020 Special Issue

   • Christophe Paul
   • Markus Bläser

   EditorialNotes 07 January 2023 Pages: 1 - 3

2. Observation and Distinction: Representing Information in Infinite Games

   • Dietmar Berwanger
   • Laurent Doyen

   OriginalPaper 21 March 2022 Pages: 4 - 27

   

3. Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs

   • Thomas Bläsius
   • Philipp Fischbeck
   • Maximilian Katzmann

   OriginalPaper Open access 28 October 2021 Pages: 28 - 51

   

4. Typical Sequences Revisited — Computing Width Parameters of Graphs

   • Hans L. Bodlaender
   • Lars Jaffke
   • Jan Arne Telle

   OriginalPaper Open access 26 March 2021 Pages: 52 - 88

   

5. Fixed-Parameter Algorithms for Unsplittable Flow Cover

   • Andrés Cristi
   • Mathieu Mari
   • Andreas Wiese

   OriginalPaper 03 July 2021 Pages: 89 - 124

   

6. Decidability and Periodicity of Low Complexity Tilings

   • Jarkko Kari
   • Etienne Moutot

   OriginalPaper Open access 28 October 2021 Pages: 125 - 148

   

7. Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms

   • Nikhil Vyas
   • R. Ryan Williams

   OriginalPaper Open access 04 November 2022 Pages: 149 - 177

8. An Automaton Group with PSPACE-Complete Word Problem

   • Jan Philipp Wächter
   • Armin Weiß

   OriginalPaper Open access 21 April 2022 Pages: 178 - 218