- Andre Opris. Many-objective problems where crossover is provably essential. Artificial Intelligence, 350:104453, 2026.
- Xinyuan Zhao, Hanlin Gu, Lixin Fan, Yuxing Han 0001, Qiang Yang. Disentangling data distribution for optimal and communication-efficient federated learning. Artificial Intelligence, 351:104455, 2026.
- Christine Solnon. LAD2025, A constraint-based solver for the subgraph isomorphism problem. Artificial Intelligence, 352:104474, 2026.
- Edith Elkind, Matthias Greger, Patrick Lederer, Warut Suksompong, Nicholas Teh. Settling the score: Portioning with cardinal preferences. Artificial Intelligence, 352:104487, 2026.
- Lexin Zhou, Pablo A. M. Casares, Fernando Martínez-Plumed, John Burden, Ryan Burnell, Lucy Cheke, Cèsar Ferri, Alexandru Marcoci, Behzad Mehrbakhsh, Yael Moros-Daval, Seán Sáirséal Ó hÉigeartaigh, Danaja Rutar, Wout Schellaert, Konstantinos Voudouris, José Hernández-Orallo. Predictable artificial intelligence. Artificial Intelligence, 353:104491, 2026.
- Johannes Schmalz, Felipe W. Trevizan. Efficient constraint generation for stochastic shortest path problems. Artificial Intelligence, 354:104505, 2026.
- Philip A. LeMaitre, Marius Krumm, Hans-J. Briegel. Multi-excitation projective simulation with a many-body physics-inspired inductive bias. Artificial Intelligence, 352:104489, 2026.
- Matteo Cardellini, Enrico Giunchiglia, Marco Maratea. Symbolic pattern planning. Artificial Intelligence, 352:104482, 2026.
- Moran Barenboim, Vadim Indelman. Online POMDP planning with anytime deterministic optimality guarantees. Artificial Intelligence, 350:104442, 2026.
- Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider. A General Theoretical Framework for Learning Smallest Interpretable Models. Artificial Intelligence, 350:104441, 2026.