| 2025 | Restricted CSPs and F-Free Digraph Algorithmics. | Santiago Guzmn-Pro, Barnaby Martin |
| 2025 | On Incremental Approximate Shortest Paths in Directed Graphs. | Adam Grkiewicz, Adam Karczmarz |
| 2025 | Fully Dynamic Algorithms for Transitive Reduction. | Gramoz Goranci, Adam Karczmarz, Ali Momeni, Nikos Parotsidis |
| 2025 | Incremental Approximate Maximum Flow via Residual Graph Sparsification. | Gramoz Goranci, Monika Henzinger, Harald Rcke, A. R. Sricharan |
| 2025 | Revisiting Directed Disjoint Paths on Tournaments (And Relatives). | Guilherme de C. M. Gomes, Raul Lopes, Ignasi Sau |
| 2025 | On the Complexity of Client-Waiter and Waiter-Client Games. | Valentin Gledel, Nacim Oijid, Sbastien Tavenas, Stphan Thomass |
| 2025 | Repetition Aware Text Indexing for Matching Patterns with Wildcards. | Daniel Gibney, Jackson Huffstutler, Mano Prakash Parthasarathi, Sharma V. Thankachan |
| 2025 | IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates. | Giordano Giambartolomei, Frederik Mallmann-Trenn, Raimundo Saona |
| 2025 | Bayesian Inference in Quantum Programs. | Christina Gehnen, Dominique Unruh, Joost-Pieter Katoen |
| 2025 | Optimal Distance Labeling for Permutation Graphs. | Pawel Gawrychowski, Wojciech Janczewski |
| 2025 | Towards the Proximity Conjecture on Group-Labeled Matroids. | Dniel Garamvlgyi, Ryuhei Mizutani, Taihei Oki, Tams Schwarcz, Yutaro Yamaguchi |
| 2025 | One-Shot Learning for k-SAT. | Andreas Galanis, Leslie Ann Goldberg, Xusheng Zhang |
| 2025 | Low-Temperature Sampling on Sparse Random Graphs. | Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova |
| 2025 | (Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs. | Harmender Gahlawat, Abhishek Rathod, Meirav Zehavi |
| 2025 | Worst-Case and Average-Case Hardness of Hypercycle and Database Problems. | Cheng-Hao Fu, Andrea Lincoln, Rene Reyes |
| 2025 | Deterministic Even-Cycle Detection in Broadcast CONGEST. | Pierre Fraigniaud, Mal Luce, Frdric Magniez, Ioan Todinca |
| 2025 | Faster Dynamic (Δ+1)-Coloring Against Adaptive Adversaries. | Maxime Flin, Magns M. Halldrsson |
| 2025 | Membership and Conjugacy in Inverse Semigroups. | Lukas Fleischer, Florian Stober, Alexander Thumm, Armin Wei |
| 2025 | The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs. | Nick Fischer, Marvin Knnemann, Mirza Redzic, Julian Stie |
| 2025 | Minimizing Recourse in an Adaptive Balls and Bins Game. | Adi Fine, Haim Kaplan, Uri Stemmer |
| 2025 | Approximate Problems for Finite Transducers. | Emmanuel Filiot, Ismal Jecker, Khushraj Madnani, Saina Sunny |
| 2025 | Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model. | Shiyuan Feng, William Swartworth, David P. Woodruff |
| 2025 | Even Faster Algorithm for the Chamfer Distance. | Ying Feng, Piotr Indyk |
| 2025 | Drainability and Fillability of Polyominoes in Diverse Models of Global Control. | Sndor P. Fekete, Peter Kramer, Jan-Marc Reinhardt, Christian Rieck, Christian Scheffer |
| 2025 | Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems. | Baris Can Esmer, Ariel Kulik |