- Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos. (In)approximability of maximum minimal FVS. J. Comput. Syst. Sci., 124:26-40, 2022.
- Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan. On the threshold of intractability. J. Comput. Syst. Sci., 124:1-25, 2022.
- Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès. Medians in median graphs and their cube complexes in linear time. J. Comput. Syst. Sci., 126:80-105, 2022.
- Sankardeep Chakraborty, Anish Mukherjee 0001, Venkatesh Raman 0001, Srinivasa Rao Satti. Frameworks for designing in-place graph algorithms. J. Comput. Syst. Sci., 123:1-19, 2022.
- Florian Bridoux, Amélia Durbec, Kévin Perrot, Adrien Richard. Complexity of fixed point counting problems in Boolean networks. J. Comput. Syst. Sci., 126:138-164, 2022.
- Ville Salo. Cutting corners. J. Comput. Syst. Sci., 128:35-70, 2022.
- Thomas Bläsius, Tobias Friedrich 0001, Julius Lischeid, Kitty Meeks, Martin Schirneck. Efficiently enumerating hitting sets of hypergraphs arising in data profiling. J. Comput. Syst. Sci., 124:192-213, 2022.
- Marco Canini, Iosif Salem, Liron Schiff, Elad Michael Schiller, Stefan Schmid 0001. Renaissance: A self-stabilizing distributed SDN control plane using in-band communications. J. Comput. Syst. Sci., 127:91-121, 2022.
- Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno. Dual domination problems in graphs. J. Comput. Syst. Sci., 128:18-34, 2022.
- Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström. Many-visits TSP revisited. J. Comput. Syst. Sci., 124:112-128, 2022.