- Lixing Tan, Zhaohui Zhu, Jinjin Zhang. Reduced meet over labelling-based semantics in abstract argumentation. Inf. Process. Lett., 187:106514, 2025.
- Fuki Ito. Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees. Inf. Process. Lett., 187:106512, 2025.
- Alexander Dobler. A note on the complexity of one-sided crossing minimization of trees. Inf. Process. Lett., 190:106575, 2025.
- Roberto Colomboni, Emmanuel Esposito, Andrea Paudice. An improved uniform convergence bound with fat-shattering dimension. Inf. Process. Lett., 188:106539, 2025.
- Samuel Hartman, Jonathan P. Sorenson. Reducing the space used by the sieve of Eratosthenes when factoring. Inf. Process. Lett., 188:106537, 2025.
- Katharina T. Huber, Leo van Iersel, Vincent Moulton, Guillaume E. Scholz. Is this network proper forest-based?. Inf. Process. Lett., 187:106500, 2025.
- Daniel Eichhorn, Sven O. Krumke. Online delay management on a single train line with predictions. Inf. Process. Lett., 190:106569, 2025.
- Shabana A. T., Alphy George, S. Sheerazuddin. Counter abstraction for regular open teams. Inf. Process. Lett., 188:106533, 2025.
- Michael B. Dillencourt, Michael T. Goodrich, Michael Mitzenmacher. Leveraging parameterized Chernoff bounds for simplified algorithm analyses. Inf. Process. Lett., 187:106516, 2025.
- Chao Yang, Zhujun Zhang. Friends-and-strangers is PSPACE-complete. Inf. Process. Lett., 190:106573, 2025.