- Ryunosuke Takeuchi, Yosuke Todo, Tetsu Iwata. Practical committing attacks against Rocca-S. Inf. Process. Lett., 192:106610, 2026.
- Zihui Liu. On some families of binary codes. Inf. Process. Lett., 191:106591, 2026.
- TianQi Chen, Zhiyi Tan 0001. Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan. Inf. Process. Lett., 191:106598, 2026.
- Stefan Kiefer, Andrew Ryzhikov. The complexity of computing the period and the exponent of a digraph. Inf. Process. Lett., 191:106590, 2026.
- Xian Xu, Wenbo Zhang. Logical characterization of branching bisimilarity over random processes. Inf. Process. Lett., 191:106596, 2026.
- Sam Buss, Neil Thapen. A simple supercritical tradeoff between size and height in resolution. Inf. Process. Lett., 191:106589, 2026.
- Manoj Gyawali. Rank-2 module-LIP with special matrices. Inf. Process. Lett., 191:106593, 2026.
- Ronak Bhadra, Raghunath Tewari. Reachability in graphs having linear 2-arboricity two is NL-hard. Inf. Process. Lett., 192:106611, 2026.
- Bhawani Sankar Panda, Soumyashree Rana, Sounaka Mishra. Corrigendum to "On the complexity of co-secure dominating set problem" [Inf. Process. Lett. 185 (2024) 106463]. Inf. Process. Lett., 191:106592, 2026.
- Cláudia Linhares Sales, Thiago Marcilon, Nicolas Almeida Martins, Nicolas Nisse, Rudini M. Sampaio. The harmonious coloring game. Inf. Process. Lett., 192:106609, 2026.