- Vahan Mkrtchyan, Garik Petrosyan, K. Subramani 0001, Piotr Wojciechowski 0002. On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective. Theory Comput. Syst., 68(1):122-143, February 2024.
- Qisheng Wang, Mingsheng Ying. Quantum Algorithm for Lexicographically Minimal String Rotation. Theory Comput. Syst., 68(1):29-74, February 2024.
- Frank Gurski, Jörg Rothe, Robin Weishaupt. Stability, Vertex Stability, and Unfrozenness for Special Graph Classes. Theory Comput. Syst., 68(1):75-102, February 2024.
- Pierre Bergé, Guillaume Ducoffe , Michel Habib. Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs. Theory Comput. Syst., 68(1):144-193, February 2024.
- Vincent Froese, Pascal Kunz, Philipp Zschoche. Disentangling the Computational Complexity of Network Untangling. Theory Comput. Syst., 68(1):103-121, February 2024.
- Andreas Maletti, Andreea-Teodora Nász. Weighted Tree Automata with Constraints. Theory Comput. Syst., 68(1):1-28, February 2024.
- Henning Fernau, Mikhail V. Volkov. Preface of the Special Issue Dedicated to Selected Papers from CSR 2020. Theory Comput. Syst., 67(2):219-220, April 2023.
- Rodolfo Conde, Sergio Rajsbaum. The Solvability of Consensus in Iterated Models Extended with Safe-Consensus. Theory Comput. Syst., 67(5):901-955, October 2023.
- Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich 0001, Maximilian Katzmann. Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Theory Comput. Syst., 67(1):28-51, February 2023.
- David Furcy, Scott M. Summers, Logan Withers. Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D. Theory Comput. Syst., 67(5):1082-1130, October 2023.