- Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos. Dynamic programming on bipartite tree decompositions. J. Comput. Syst. Sci., 156:103722, 2026.
- Floris Persiau, Gert de Cooman, Jasper De Bock. A comparative study of the smallest probability intervals for which a binary sequence is random. J. Comput. Syst. Sci., 157:103734, 2026.
- Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard. Interaction graphs of isomorphic automata networks II: Universal dynamics. J. Comput. Syst. Sci., 156:103717, 2026.
- Jun Le Goh, Joseph S. Miller, Mariya Ivanova Soskova, Linda Westrick. Redundancy of information: Lowering effective dimension. J. Comput. Syst. Sci., 157:103732, 2026.
- Naoto Ohsaka. Gap preserving reductions between reconfiguration problems. J. Comput. Syst. Sci., 157:103733, 2026.
- Robert Bredereck, Piotr Faliszewski, Michal Furdyna, Andrzej Kaczmarczyk 0001, Joanna Kaczmarek 0001, Martin Lackner, Christian Laußmann, Jörg Rothe, Tessa Seeger. How to tamper with a Parliament: Strategic campaigns in apportionment elections. J. Comput. Syst. Sci., 155:103700, 2026.
- Amirali Madani, Anil Maheshwari, Babak Miraftab, Bodhayan Roy. Algorithms and hardness results for the (k,ℓ)-cover problem. J. Comput. Syst. Sci., 156:103727, 2026.
- Pablo Barceló, Gaëlle Fontaine, Sylvain Salvati, Sophie Tison. Corrections to "On the data complexity of consistent query answering over graph databases [Journal of Computer and System Sciences 88 (2017) 164-194]". J. Comput. Syst. Sci., 155:103694, 2026.
- Jakob Dyrseth, Paloma Thomé de Lima. On the complexity of rainbow vertex colouring diametral path graphs. J. Comput. Syst. Sci., 155:103683, 2026.
- Jan Bok, Jirí Fiala 0001, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl. Computational complexity of covering multigraphs with semi-edges: Small cases. J. Comput. Syst. Sci., 156:103714, 2026.