| 2025 | Minimizers in Semi-dynamic Strings. | Wiktor Zuba, Oded Lachish, Solon P. Pissis |
| 2025 | Quantum First-Order Logics and Quantum Natural Deduction. | Tomoyuki Yamakami |
| 2025 | Cyclic Equalizability of Words and Its Application to Card-Based Cryptography. | Kazumasa Shinagawa, Koji Nuida |
| 2025 | On Saving Energy in Boolean Circuits via Negations. | Jayalal Sarma, Kei Uchizawa |
| 2025 | A Study of the Binary and Boolean Rank of Matrices with Small Constant Real Rank. | Michal Parnas, Adi Shraibman |
| 2025 | Complexity of Minimal Faithful Permutation Degree for Fitting-Free Groups. | Michael Levet, Pranjal Srivastava, Dhara Thakkar |
| 2025 | Linear Time Algorithms for Colorful 3-Rainbow Domination in Block and Cactus Graphs. | Tetiana Lavynska |
| 2025 | Disjointness, Inclusion, and Regularity of mega-Rational Trace Languages - Extended Abstract -. | Dietrich Kuske |
| 2025 | Partially Ordered Sets Corresponding to the Partition Problem. | Susumu Kubo |
| 2025 | Simultaneous Contact Representations of Planar Graphs. | Jan Kratochvl, Melanie Reihl |
| 2025 | On the Parameterized Complexity of Cosecure Domination. | D. Karthika, R. Muthucumaraswamy, V. P. Abidha, Pradeesha Ashok, Sriram Bhyravarapu, Sayani Das, Saket Saurabh, Ayush Sawlani, Vikash Tripathi |
| 2025 | Complexity of Positive Influence Domination on Partial Grids. | Enrico Iurlano, Gnther R. Raidl |
| 2025 | Combinatorics of Palindromes. | Michael Itzhaki |
| 2025 | Hardness of Pre-assignment Problem for Unique Minimum Vertex Cover on Planar Graphs with Maximum Degree 3. | Takashi Horiyama, Fumiya Sakamoto, Kazuhisa Seto, Ryu Suzuki |
| 2025 | On Complementation of Nondeterministic Finite Automata Without Full Determinization. | Luks Holk, Ondrej Lengl, Juraj Major, Adla Stepkov, Jan Strejcek |
| 2025 | Complexity of Identifying Fitting-Free Groups. | Joshua A. Grochow, Dan Johnson, Michael Levet |
| 2025 | Determining the Metric Dimension of K | Valentin Gledel, Gerold Jger |
| 2025 | Computing Diverse and Nice Triangulations. | Waldo Glvez, Mayank Goswami, Arturo Merino, GiBeom Park, Meng-Tsung Tsai |
| 2025 | Parameterized Algorithms for Editing to Uniform Cluster Graph. | Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity |
| 2025 | On the Complexity of Locally Rainbow Path. | Hiroshi Eto, Tesshu Hanaka, Eiji Miyano, Shuya Yoshida |
| 2025 | On the Complexity of Problems on Graphs Defined on Groups. | Bireswar Das, Dipan Dey, Jinia Ghosh |
| 2025 | On Distance-d Independent Set Problems for Some Graph Classes. | Sandip Das, Soura Sena Das, Sweta Das, Sk Samim Islam |
| 2025 | Finding d-Cuts in Probe H-Free Graphs. | Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson, Giacomo Paesani, Danil Paulusma |
| 2025 | Red-Blue Unshared Dominators. | Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno |
| 2025 | Parameterized Restless Temporal Path. | Justine Cauvi, Laurent Viennot |