- Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras 0002, Markus L. Schmid. On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory Comput. Syst., 65(2):344-409, 2021.
- Xiao Zeng, Guowu Yang. Computing the Number of Affine Equivalent Classes on ℛ(s, n)/ℛ(k, n). Theory Comput. Syst., 65(5):869-883, 2021.
- Sounaka Mishra, B. Arjuna Krishna, Shijin Rajakrishnan. Approximability of open k-monopoly problems. Theory Comput. Syst., 65(5):798-814, 2021.
- Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos. Minimum Reload Cost Graph Factors. Theory Comput. Syst., 65(5):815-838, 2021.
- Beate Bollig, Martin Farenholtz. On the Relation Between Structured d-DNNFs and SDDs. Theory Comput. Syst., 65(2):274-295, 2021.
- Rolf Niedermeier, Christophe Paul. Preface of STACS 2019 Special Issue. Theory Comput. Syst., 65(4):635-637, 2021.
- Floris Geerts. On the Expressive Power of Linear Algebra on Graphs. Theory Comput. Syst., 65(1):179-239, 2021.
- Antoine Mottet, Karin Quaas. The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata. Theory Comput. Syst., 65(4):706-735, 2021.
- Rémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora. Token Sliding on Split Graphs. Theory Comput. Syst., 65(4):662-686, 2021.
- Shaull Almagor, Joël Ouaknine, James Worrell 0001. First-Order Orbit Queries. Theory Comput. Syst., 65(4):638-661, 2021.