- Qiyi Tang 0001, Franck van Breugel. Deciding probabilistic bisimilarity distance one for probabilistic automata. J. Comput. Syst. Sci., 111:57-84, 2020.
- Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen. Disconnected cuts in claw-free graphs. J. Comput. Syst. Sci., 113:60-75, 2020.
- Guillaume Bagan, Angela Bonifati, Benoît Groz. A trichotomy for regular simple path queries on graphs. J. Comput. Syst. Sci., 108:29-48, 2020.
- Juraj Hromkovic, Peter Rossmanith. What one has to know when attacking P vs. NP. J. Comput. Syst. Sci., 107:142-155, 2020.
- Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma. Clique-width and well-quasi-ordering of triangle-free graph classes. J. Comput. Syst. Sci., 108:64-91, 2020.
- Keren Censor Hillel, Mikaël Rabie. Distributed reconfiguration of maximal independent sets. J. Comput. Syst. Sci., 112:85-96, 2020.
- Eduard Eiben, Robert Ganian, Sebastian Ordyniak. Using decomposition-parameters for QBF: Mind the prefix!. J. Comput. Syst. Sci., 110:1-21, 2020.
- Alexsander A. Melo, Celina M. H. de Figueiredo, Uéverton S. Souza. A multivariate analysis of the strict terminal connection problem. J. Comput. Syst. Sci., 111:22-41, 2020.
- Chia-Wen Cheng, Sun-Yuan Hsieh, Ralf Klasing. Vulnerability of super extra edge-connected graphs. J. Comput. Syst. Sci., 108:1-9, 2020.
- Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs. J. Comput. Syst. Sci., 107:28-53, 2020.