| 2025 | Holey Graphs: Very Large Betti Numbers are Testable. | Dniel Szab, Simon Apers |
| 2025 | Packed Acyclic Deterministic Finite Automata. | Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga |
| 2025 | Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints. | Sampriti Roy, Yadu Vasudev |
| 2025 | Incremental Computation of the Set of Period Sets. | Eric Rivals |
| 2025 | DAG Scheduling in the BSP Model. | Pl Andrs Papp, Georg Anegg, Albert-Jan Yzelman |
| 2025 | Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs. | Christian Ortlieb |
| 2025 | Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets. | Yutaro Numaya, Yoshito Kawasaki, Ryo Yoshinaka, Ayumi Shinohara |
| 2025 | Disjoint Covering of Bipartite Graphs with s-clubs. | Angelo Monti, Blerina Sinaimeri |
| 2025 | Knowledge Neurons in the Knowledge Graph-based Link Prediction Models. | Grzegorz P. Mika, Amel Bouzeghoub, Katarzyna Wegrzyn-Wolska, Yessin M. Neggaz |
| 2025 | Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees. | Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama |
| 2025 | Visual Complexity of Point Set Mappings. | Wouter Meulemans, Arjen Simons, Kevin Verbeek |
| 2025 | Roman Hitting Set. | Kevin Mann, Henning Fernau |
| 2025 | Exact Characterizations of Non-commutative Algebraic Complexity Without Homogeneity. | Guillaume Malod |
| 2025 | Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs. | Erik Jan van Leeuwen |
| 2025 | Colorful 3-Rainbow Domination. | Tetiana Lavynska |
| 2025 | The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem. | Antonio Lauerbach, Kendra Reiter, Marie Schmidt |
| 2025 | Quantum Algorithm for the Multiple String Matching Problem. | Kamil Khadiev, Danil Serov |
| 2025 | On the Complexity of Minimum Membership Dominating Set. | D. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh, Sanjay Seetharaman |
| 2025 | The Computational Complexity of Equilibria with Strategic Constraints. | Bruce M. Kapron, Koosha Samieefar |
| 2025 | On the Periodic Decompositions of Multidimensional Configurations. | Pyry Herva, Jarkko Kari |
| 2025 | A SUBSET-SUM Characterisation of the A-Hierarchy. | Jan Gutleben, Arne Meier |
| 2025 | On Pumping Problems for Unary Regular Languages. | Hermann Gruber, Markus Holzer, Christian Rauch |
| 2025 | Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds. | Michael T. Goodrich, Ryuto Kitagawa, Michael Mitzenmacher |
| 2025 | Expected Density of Random Minimizers. | Shay Golan, Arseny M. Shur |
| 2025 | Generation of Cycle Permutation Graphs and Permutation Snarks. | Jan Goedgebeur, Jarne Renders |