- Fedor V. Fomin, Vijayaragunathan Ramamoorthi. On the Parameterized Complexity of the Expected Coverage Problem. Theory Comput. Syst., 66(2):432-453, 2022.
- Dimitris Fotakis 0001, Evangelos Markakis. Special issue on algorithmic game theory (SAGT 2019). Theory Comput. Syst., 66(3):517-518, 2022.
- Alexsander Andrade de Melo, Mateus de Oliveira Oliveira. Second-Order Finite Automata. Theory Comput. Syst., 66(4):861-909, 2022.
- Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Factorizing Strings into Repetitions. Theory Comput. Syst., 66(2):484-501, 2022.
- Ching-Lueh Chang. On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters. Theory Comput. Syst., 66(4):847-860, 2022.
- Anastasiya Chistopolskaya, Vladimir V. Podolskii. On the Decision Tree Complexity of Threshold Functions. Theory Comput. Syst., 66(6):1074-1098, 2022.
- Laxman Saha, Alamgir Rahaman Basunia, Satyabrata Das, Kalishankar Tiwary. Radio k-chromatic Number of Full m-ary Trees. Theory Comput. Syst., 66(1):114-142, 2022.
- Augustin Chaintreau, Guillaume Ducoffe , Dorian Mazauric. Non-Existence of Stable Social Groups in Information-Driven Networks. Theory Comput. Syst., 66(4):758-777, 2022.
- Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos. Graph Square Roots of Small Distance from Degree One Graphs. Theory Comput. Syst., 66(4):821-846, 2022.
- Péter Gács, Ilkka Törmä. Stable Multi-Level Monotonic Eroders. Theory Comput. Syst., 66(1):322-353, 2022.