- Narad Rampersad, Jeffrey O. Shallit, Xinhao Xu. Repetition Factorization of Automatic Sequences. Int. J. Found. Comput. Sci., 36(3):479-499, 2025.
- Lucie Ciencialová, Ludek Cienciala, Erzsébet Csuhaj-Varjú. Language Classes of Extended Distributed Reaction Systems. Int. J. Found. Comput. Sci., 36(7):1017-1040, November 2025.
- Annie Clare Antony, V. Sangeetha. Paired Domination Integrity of Graphs. Int. J. Found. Comput. Sci., 36(2):161-181, February 2025.
- Bin Liu 0009, Zhenming Liu, Feiteng Zhang. Algorithms for the Truss Maintenance Problem on Edge-Weighted Graphs. Int. J. Found. Comput. Sci., 36(5):781-800, August 2025.
- Carlo Mereghetti, Beatrice Palano, Priscilla Raucci. Latvian Quantum Finite State Automata for Unary Languages. Int. J. Found. Comput. Sci., 36(3):419-455, 2025.
- Amit Sharma, P. Venkata Subba Reddy 0001, Subramanian Arumugam 0001, Jakkepalli Pavan Kumar. Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs. Int. J. Found. Comput. Sci., 36(1):25-34, January 2025.
- Henning Bordihn, György Vaszil. Leftmost Derivations in CD Grammar Systems. Int. J. Found. Comput. Sci., 36(3):247-267, 2025.
- Xiaoyan Zhang 0001, Hong Chang 0002, Longkun Guo, Donglei Du, Gaokai Zou, Yuanyuan Xiong. Graph Algorithm Based Submodular Function for Sparsest Cut Problem. Int. J. Found. Comput. Sci., 36(5):619-633, August 2025.
- Yan-Ping Wang, Yiwen Chen, Qiang Wang 0012. Almost Perfect c-Nonlinear Permutations with Trace Functions over 픽2n. Int. J. Found. Comput. Sci., 36(6):939-953, September 2025.
- Michal Hospodár, Galina Jirásková. Conversions Between Six Models of Finite Automata. Int. J. Found. Comput. Sci., 36(3):321-344, 2025.