| 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 |
| 2025 | Inductive Tracing and the Complexity of Finding Hamiltonian Path in DAGs. | Ronak Bhadra, Raghunath Tewari |
| 2025 | Reconfiguring Planar Perfect Matchings via Bounded Length Alternating Cycles. | Robert D. Barish, Tetsuo Shibuya |
| 2025 | Shallow-Rotation Distance via Forest Representations. | S. K. M. Anoop, Jayalal Sarma |
| 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 | Tight Bounds for the Number of Absent Subsequences. | Duncan Adamson, Pamela Fleischmann, Annika Huch, Florin Manea, Paul Sarnighausen-Cahn, Max Wiedenhft |
| 2025 | On the Parameterized Complexity of Connected Cluster Vertex Deletion. | Ankit Abhinav, Sriram Bhyravarapu, A. Mohanapriya, Saket Saurabh |
| 2023 | Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata. | Tomoyuki Yamakami |
| 2023 | Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku. | Kodai Tanaka, Takaaki Mizuki |
| 2023 | Subhedge Projection for Stepwise Hedge Automata. | Antonio Al Serhali, Joachim Niehren |
| 2023 | Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. | Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser |
| 2023 | Exact and Parameterized Algorithms for the Independent Cutset Problem. | Johannes Rauch, Dieter Rautenbach, Uverton S. Souza |
| 2023 | Verified Exact Real Computation with Nondeterministic Functions and Limits. | Sewon Park |
| 2023 | Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. | Van Bang Le, Christian Rosenke |
| 2023 | Shortest Dominating Set Reconfiguration Under Token Sliding. | Jan Matys Kristan, Jakub Svoboda |
| 2023 | Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems. | Chris Kcher, Dietrich Kuske |
| 2023 | Vertex Ordering with Precedence Constraints. | Jeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar |
| 2023 | Cordial Forests. | Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams |
| 2023 | Robust Identification in the Limit from Incomplete Positive Data. | Philip Kaelbling, Dakotah Lambert, Jeffrey Heinz |
| 2023 | On Computing a Center Persistence Diagram. | Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu |
| 2023 | The Complexity of (P | Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski |
| 2023 | On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman. | Joshua A. Grochow, Michael Levet |
| 2023 | Parameterized Complexity of the | Ajinkya Gaikwad, Soumen Maity |
| 2023 | Bounds for c-Ideal Hashing. | Fabian Frei, David Wehner |
| 2023 | α-β-Factorization and the Binary Case of Simon's Congruence. | Pamela Fleischmann, Jonas Hfer, Annika Huch, Dirk Nowotka |