- Irving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer. The Ground-Set-Cost Budgeted Maximum Coverage Problem. Theory Comput. Syst., 69(4):39, December 2025.
- Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada 0001. Gathering on Rings for Myopic Asynchronous Robots with Lights. Theory Comput. Syst., 69(1):8, March 2025.
- Zebin Wang, Chenhui Jin, Jiyan Zhang, Ting Cui. Improved Methods to Solve Nonlinear Invariants with Low Algebraic Degree for Linear Transformation. Theory Comput. Syst., 69(1):15, March 2025.
- Takashi Ishizuka. Note on Constrained Long Choice with Multiple Beginning Elements. Theory Comput. Syst., 69(1):2, March 2025.
- Takashi Horiyama, Kazuhisa Seto, Ryu Suzuki. The Complexity of Pre-assignment Problem for Unique Minimum Vertex Cover on Bipartite Graphs. Theory Comput. Syst., 69(4):35, December 2025.
- Pallavi Jain 0001, Lawqueen Kanesh, Willian Lochet, Saket Saurabh 0001, Roohani Sharma. Exact and Approximate Digraph Bandwidth. Theory Comput. Syst., 69(1):10, March 2025.
- Duncan Adamson, Paul Sarnighausen-Cahn, Marius Dumitran, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer. Longest Common Subsequence with Gap Constraints. Theory Comput. Syst., 69(2):25, June 2025.
- Erik D. Demaine, Kritkorn Karntikoon, Nipun Pitimanaaree. 2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs. Theory Comput. Syst., 69(2):22, June 2025.
- Sunny Kumar Sharma, Vijay Kumar Bhat, Latif Hanna, Maryam Al-Kandari. Some Symmetrical Planar Structures with their Fault-Tolerant Metric Dimension. Theory Comput. Syst., 69(4):36, December 2025.
- Barbara M. Anthony, Ricky Birnbaum, Sara Boyd, Christine Chung 0001, Ananya Das 0003, Patrick Davis, Jigar Dhimar, Duc Tran, David S. Yuen. Maximizing Rides Served for Dial-a-Ride on the Uniform Metric. Theory Comput. Syst., 69(1):5, March 2025.