- Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf 0002. Learning from positive and negative examples: New proof for binary alphabets. Inf. Process. Lett., 183:106427, January 2024.
- Florian Hörsch, Zoltán Szigeti. Steiner connectivity problems in hypergraphs. Inf. Process. Lett., 183:106428, January 2024.
- Eduardo Sany Laber. The computational complexity of some explainable clustering problems. Inf. Process. Lett., 184:106437, February 2024.
- Konstantinos Panagiotou, Simon Reisser. The effect of iterativity on adversarial opinion forming. Inf. Process. Lett., 185:106453, March 2024.
- Je Hong Park, Woo-Hwan Kim. Security weakness of a certificate-based proxy signature scheme for IIoT environments. Inf. Process. Lett., 183:106406, January 2024.
- Reynaldo Gil Pons, Max Ward 0001, Loïc Miller. d)-hypernetworks in F-hypergraphs is NP-hard. Inf. Process. Lett., 184:106433, February 2024.
- Majid Mirzanezhad. On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions. Inf. Process. Lett., 183:106405, January 2024.
- Xiaowei Li, Xiwen Lu. The facility location problem with maximum distance constraint. Inf. Process. Lett., 184:106447, February 2024.
- Lijing Zheng, Haibin Kan, Jie Peng, Yanjun Li, Yanbin Zheng. A new class of generalized almost perfect nonlinear monomial functions. Inf. Process. Lett., 184:106445, February 2024.
- Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Tomohiro Koana. FPT approximation and subexponential algorithms for covering few or many edges. Inf. Process. Lett., 185:106471, March 2024.