- Haitao Wang 0001, Yiming Zhao. Computing the Minimum Bottleneck Moving Spanning Tree. Algorithmica, 88(1):6, February 2026.
- Michaela Borzechowski, Patrick Schnider, Simon Weber 0001. An FPT Algorithm for Splitting a Necklace Among Two Thieves. Algorithmica, 88(1):1, February 2026.
- Martin S. Krejca, Carsten Witt. A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive. Algorithmica, 88(1):5, February 2026.
- Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev. Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. Algorithmica, 88(1):2, February 2026.
- Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt. Recognition Complexity of Subgraphs of bf k-Connected Planar Cubic Graphs. Algorithmica, 88(1):11, February 2026.
- Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber. Geometric Thickness of Multigraphs is $\exists \mathbb {R}$-Complete. Algorithmica, 88(1):3, February 2026.
- Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. Algorithmica, 88(1):8, February 2026.
- Felicia Lucke, Ali Momeni 0003, Daniël Paulusma, Siani Smith. Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. Algorithmica, 88(1):7, February 2026.
- Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre 0001, Ivan Rapaport, Ioan Todinca. Distributed Model Checking on Graphs of Bounded Treedepth. Algorithmica, 88(1):10, February 2026.
- Katrin Casel, Tobias Friedrich 0001, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif. Combining Crown Structures for Vulnerability Measures. Algorithmica, 88(1):9, February 2026.