| 2025 | Subsequence Matching and LCS with Segment Number Constraints. | Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara |
| 2025 | Unit Refutations in Horn Constraint Systems. | Piotr Wojciechowski, K. Subramani |
| 2025 | On the Price of Anarchy in Packet Routing Games with FIFO. | Daniel Schmand, Torben Schrenberg, Martin Strehler |
| 2025 | Arithmetic Circuits with Division. | Silas Cato Sacher |
| 2025 | Tatami Printer: Physical ZKPs for Tatami Puzzles. | Suthee Ruangwises |
| 2025 | Nonpartisan Feedback Vertex Set. | Nidhi Purohit, Souvik Saha, Saket Saurabh, Anannya Upasana |
| 2025 | On the Discrete and Semi-continuous Versions of the Two-Watchtower Problem in the Plane. | Leonidas Palios |
| 2025 | A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering. | Kensuke Oowa, Peter Fulla, Takuro Fukunaga |
| 2025 | Bounded Degree QBF and Positional Games. | Nacim Oijid |
| 2025 | Longest Path Transversals in Claw-Free and P | Paloma T. Lima, Amir Nikabadi |
| 2025 | Pinwheel Covering. | Akitoshi Kawamura, Yusuke Kobayashi, Yosuke Kusano |
| 2025 | On The Computational Complexity of Games with Uncertainty. | Bruce M. Kapron, Koosha Samieefar |
| 2025 | Exact and Approximate High-Multiplicity Scheduling on Identical Machines. | Klaus Jansen, Kai Kahler, Esther Zwanger |
| 2025 | Disjoint Temporal Walks Under Waiting Time Constraints. | Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva |
| 2025 | Supereulerian Testing on Semi-Eulerian Graphs. | Wing-Kai Hon, Meng-Tsung Tsai, Ching-Yu Yang |
| 2025 | Network Creation Games with 2-Neighborhood Maximization. | Merlin de La Haye, Pascal Lenzner, Daniel Schmand, Nicole Schrder |
| 2025 | Parameterized Complexity of Disconnected Matchings. | Sushmita Gupta, Pallavi Jain, Lawqueen Kanesh, Sounak Modak, Saket Saurabh |
| 2025 | Fast Geographic Routing in Fixed-Growth Graphs. | Ofek Gila, Michael T. Goodrich, Abraham M. Illickan, Vinesh Sridhar |
| 2025 | On Two Simple[st] Learning Tasks. | Omrit Filtser, Kien C. Huynh, Anastasia Lemetti, Joseph S. B. Mitchell, Tatiana Polishchuk, Valentin Polishchuk |
| 2025 | Computational Complexity of Combinatorial Distance Matrix Realisation. | David L. Fairbairn, George B. Mertzios, Norbert Peyerimhoff |
| 2025 | Perpetual Scheduling with Explorable Uncertainty. | William S. Evans, Seyed Ali Tabatabaee |
| 2025 | General Position Subset Selection in Line Arrangements. | Adrian Dumitrescu |
| 2025 | Improved Bounds for Geodetic Hulls. | Gregor Diatzko, Sabine Storandt, Tobias Tpfer |
| 2025 | Online Bichromatic Piercing Set Problem. | Minati De, Ratnadip Mandal |
| 2025 | The Complexity of Landmark Hub Labeling. | Louann Coste, Ruoying Li, Sabine Storandt, Tobias Tpfer |