- Jinshan Zhang 0001, Hao Xu, Feng Wang 0048, Meng Xi 0002, Xiaotie Deng, Jianwei Yin. Truthful approximation for rank-maximal matchings. Inf. Comput., 308:105404, 2026.
- Yuzhen Zhao, Zhen Yang 0044, Yueguo Luo, Hui Li, Wenke Zang. Spiking neural P systems with non-gated channels. Inf. Comput., 308:105399, 2026.
- Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt. Deterministic pushdown automata with translucent input letters. Inf. Comput., 308:105403, 2026.
- Jingyang Zhao, Mingyu Xiao. Improved approximations for the capacitated vehicle routing problem with fixed capacity. Inf. Comput., 308:105405, 2026.
- Marco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange 0001. Verifying and interpreting neural networks using finite automata. Inf. Comput., 308:105398, 2026.
- Da-Wei Yang, Hongyang Zhang, Rong-Xia Hao, Sun-Yuan Hsieh. A perfect matching reciprocity method for embedding multiple hypercubes in an augmented cube: Application to Hamiltonian decomposition. Inf. Comput., 308:105401, 2026.
- Nikolay Vereshchagin. Total conditional complexity of certain objects. Inf. Comput., 308:105400, 2026.
- Yusai Wu, Liqing Yu, Yu Yu. Corrigendum to "On the equivalence of uniform key agreement and sequential composition insecurity" [Information and Computation 307 (2025) 105365]. Inf. Comput., 308:105402, 2026.
- Kun He 0011, Liang Li, Xingwu Liu, Yuyi Wang, Mingji Xia. Variable version Lovász local lemma: A tale of two boundaries. Inf. Comput., 308:105386, 2026.
- Andrei Romashchenko. Algebraic barriers to halving algorithmic information quantities in correlated strings. Inf. Comput., 308:105396, 2026.