- Hans Raj Tiwary. Extension Complexity of Formal Languages. Theory Comput. Syst., 64(5):735-753, 2020.
- Max Bannach, Till Tantau. 0-Circuits. Theory Comput. Syst., 64(3):374-399, 2020.
- Beate Bollig, Matthias Buttkus. On Limitations of Structured (Deterministic) DNNFs. Theory Comput. Syst., 64(5):799-825, 2020.
- Nicolás Alvarez, Olivier Carton. On Normality in Shifts of Finite Type. Theory Comput. Syst., 64(5):783-798, 2020.
- Pablo Barceló, Miguel Romero 0001, Thomas Zeume. A More General Theory of Static Approximations for Conjunctive Queries. Theory Comput. Syst., 64(5):916-964, 2020.
- Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase. Approximating Node-Weighted k-MST on Planar Graphs. Theory Comput. Syst., 64(4):626-644, 2020.
- Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou. Periodicity in Data Streams with Wildcards. Theory Comput. Syst., 64(1):177-197, 2020.
- Pallavi Jain 0001, Lawqueen Kanesh, Pranabendu Misra. Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. Theory Comput. Syst., 64(6):1067-1093, 2020.
- Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. Theory Comput. Syst., 64(2):251-271, 2020.
- Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart. Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst., 64(5):861-914, 2020.