- Klaus Heeger, Danny Hermelin. Minimizing the weighted number of tardy jobs is W[1]-hard. J. Comput. Syst. Sci., 161:103817, 2026.
- Hua Chen, Lin Chen, Shenghao Ye, Guochuan Zhang. Approximation algorithms for two extensions of min-k-union. J. Comput. Syst. Sci., 157:103750, 2026.
- Jiehua Chen 0001, Rolf Niedermeier, Piotr Skowron 0001. Stable marriage with multi-modal preferences. J. Comput. Syst. Sci., 160:103778, 2026.
- 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.
- George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis. Temporal graph realization with bounded stretch. J. Comput. Syst. Sci., 160:103814, 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.
- Magnus Bordewich, Simone Linz, Charles Semple. When is a set of phylogenetic trees displayed by a normal network?. J. Comput. Syst. Sci., 160:103811, 2026.
- Naoto Ohsaka. Gap preserving reductions between reconfiguration problems. J. Comput. Syst. Sci., 157:103733, 2026.