- Keqin Li. On the profits of competing cloud service providers: A game theoretic approach. J. Comput. Syst. Sci., 117:130-153, 2021.
- Arnaud Casteigts, Joseph G. Peters, Jason Schoeters. Temporal cliques admit sparse spanners. J. Comput. Syst. Sci., 121:1-17, 2021.
- Henrik Björklund, Frank Drewes, Petter Ericson, Florian Starke. Uniform parsing for hyperedge replacement grammars. J. Comput. Syst. Sci., 118:1-27, 2021.
- Shuang Zhao, Zongqing Chen, Weihua Yang, Jixiang Meng. Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs. J. Comput. Syst. Sci., 115:64-72, 2021.
- Rodrigo Torres-Avilés. Undecidability of the speed positiveness problem in reversible and complete Turing machines. J. Comput. Syst. Sci., 121:49-56, 2021.
- Jessica A. Enright, Kitty Meeks, Fiona Skerman. Assigning times to minimise reachability in temporal graphs. J. Comput. Syst. Sci., 115:169-186, 2021.
- Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon. Measuring what matters: A hybrid approach to dynamic programming with treewidth. J. Comput. Syst. Sci., 121:57-75, 2021.
- Lorenzo Clemente, Slawomir Lasota 0001. Reachability relations of timed pushdown automata. J. Comput. Syst. Sci., 117:202-241, 2021.
- Xiaotie Deng, Jack R. Edmonds, Zhe Feng 0004, Zhengyang Liu, Qi Qi 0003, Zeying Xu. Understanding PPA-completeness. J. Comput. Syst. Sci., 115:146-168, 2021.
- Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez 0001, Tobias Winkler. The complexity of reachability in parametric Markov decision processes. J. Comput. Syst. Sci., 119:183-210, 2021.