- Zhongzheng Tang, Haoyang Zou, Zhuo Diao. Some sharp upper bounds on the eliminating feedback number of regular hypergraphs. J. Comput. Syst. Sci., 163:103844, 2027.
- Junteng Song, Shuilian Liu, Yicheng Xu, Yong Zhang 0001. An improved FPT approximation algorithm for diversity-aware l-centrum. J. Comput. Syst. Sci., 163:103845, 2027.
- Abdenour Azerine, Mourad Boudhar, Djamal Rebaine. Job shop scheduling problem with competing agents. J. Comput. Syst. Sci., 163:103842, 2027.
- 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.
- Nikolay Bazhenov 0001, Manat Mustafa. On computability-theoretic universality of Boolean-valued models. J. Comput. Syst. Sci., 161:103821, 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.