| 2026 | Fundamentals of Computation Theory - 25th International Symposium, FCT 2025, Wrocław, Poland, September 15-17, 2025, Proceedings Artur Jez, Jan Otop |
| 2025 | A Study of the Binary and Boolean Rank of Matrices with Small Constant Real Rank. Michal Parnas, Adi Shraibman |
| 2025 | Combinatorics of Palindromes. Michael Itzhaki |
| 2025 | Complexity of Identifying Fitting-Free Groups. Joshua A. Grochow, Dan Johnson, Michael Levet |
| 2025 | Complexity of Minimal Faithful Permutation Degree for Fitting-Free Groups. Michael Levet, Pranjal Srivastava, Dhara Thakkar |
| 2025 | Complexity of Positive Influence Domination on Partial Grids. Enrico Iurlano, Günther R. Raidl |
| 2025 | Computing Diverse and Nice Triangulations. Waldo Gálvez, Mayank Goswami, Arturo Merino, Gibeom Park, Meng-Tsung Tsai |
| 2025 | Cyclic Equalizability of Words and Its Application to Card-Based Cryptography. Kazumasa Shinagawa, Koji Nuida |
| 2025 | Determining the Metric Dimension of K Valentin Gledel, Gerold Jäger |
| 2025 | Disjointness, Inclusion, and Regularity of ømega-Rational Trace Languages - Extended Abstract -. Dietrich Kuske |
| 2025 | Finding d-Cuts in Probe H-Free Graphs. Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson, Giacomo Paesani, Daniël Paulusma |
| 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 | Inductive Tracing and the Complexity of Finding Hamiltonian Path in DAGs. Ronak Bhadra, Raghunath Tewari |
| 2025 | Linear Time Algorithms for Colorful 3-Rainbow Domination in Block and Cactus Graphs. Tetiana Lavynska |
| 2025 | Minimizers in Semi-dynamic Strings. Wiktor Zuba, Oded Lachish, Solon P. Pissis |
| 2025 | On Complementation of Nondeterministic Finite Automata Without Full Determinization. Lukás Holík, Ondrej Lengál, Juraj Major, Adéla Stepková, Jan Strejcek |
| 2025 | On Distance-d Independent Set Problems for Some Graph Classes. Sandip Das, Soura Sena Das, Sweta Das, Sk Samim Islam |
| 2025 | On Saving Energy in Boolean Circuits via Negations. Jayalal Sarma, Kei Uchizawa |
| 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 the Exact & Approximate Complexity of the Strongly Connected Steiner Subgraph Problem on Two Terminals with Demands. Kevin Kurien Alex, Rajesh Chitnis, Alex Tempest |
| 2025 | On the Parameterized Complexity of Connected Cluster Vertex Deletion. Ankit Abhinav, Sriram Bhyravarapu, A. Mohanapriya, Saket Saurabh |
| 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 | Parameterized Algorithms for Editing to Uniform Cluster Graph. Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity |
| 2025 | Parameterized Restless Temporal Path. Justine Cauvi, Laurent Viennot |
| 2025 | Partially Ordered Sets Corresponding to the Partition Problem. Susumu Kubo |
| 2025 | Quantum First-Order Logics and Quantum Natural Deduction. Tomoyuki Yamakami |
| 2025 | Reconfiguring Planar Perfect Matchings via Bounded Length Alternating Cycles. Robert D. Barish, Tetsuo Shibuya |
| 2025 | Red-Blue Unshared Dominators. Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno |
| 2025 | Shallow-Rotation Distance via Forest Representations. S. K. M. Anoop, Jayalal Sarma |
| 2025 | Simultaneous Contact Representations of Planar Graphs. Jan Kratochvíl, Melanie Reihl |
| 2025 | Tight Bounds for the Number of Absent Subsequences. Duncan Adamson, Pamela Fleischmann, Annika Huch, Florin Manea, Paul Sarnighausen-Cahn, Max Wiedenhöft |
| 2025 | m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs. Tiziana Calamoneri, Federico Corò, Neeldhara Misra, Saraswati Girish Nanoti, Giacomo Paesani |