| 2024 | Isomorphism for Tournaments of Small Twin Width. | Martin Grohe, Daniel Neuen |
| 2024 | Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. | Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski |
| 2024 | Solution Discovery via Reconfiguration for Problems in P. | Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz |
| 2024 | Sharp Noisy Binary Search with Monotonic Probabilities. | Lucas Gretta, Eric Price |
| 2024 | Linear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided Error. | Guy Goldberg |
| 2024 | Forcing, Transition Algebras, and Calculi. | Hashimoto Go, Daniel Gaina, Ionut Tutu |
| 2024 | T-Rex: Termination of Recursive Functions Using Lexicographic Linear Combinations. | Raphael Douglas Giles, Vincent Jackson, Christine Rizkallah |
| 2024 | A Characterization of Complexity in Public Goods Games. | Matan Gilboa |
| 2024 | On the Smoothed Complexity of Combinatorial Local Search. | Yiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos |
| 2024 | Low-Memory Algorithms for Online Edge Coloring. | Prantar Ghosh, Manuel Stoeckl |
| 2024 | BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting. | Sevag Gharibian, Jonas Kamminga |
| 2024 | Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems. | Serge Gaspers, Jerry Zirui Li |
| 2024 | A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. | Robert Ganian, Haiko Mller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki |
| 2024 | Deciding Linear Height and Linear Size-To-Height Increase of Macro Tree Transducers. | Paul Gallot, Sebastian Maneth, Keisuke Nakano, Charles Peyrat |
| 2024 | Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. | Esther Galby, Sndor Kisfaludi-Bak, Dniel Marx, Roohani Sharma |
| 2024 | On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification. | Jakub Gajarsk, Rose McCarty |
| 2024 | Improved Algorithm for Reachability in d-VASS. | Yuxi Fu, Qizhe Yang, Yangluo Zheng |
| 2024 | Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. | Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2024 | Optimal Electrical Oblivious Routing on Expanders. | Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2024 | Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time. | Nick Fischer, Leo Wennmann |
| 2024 | A Note on Approximating Weighted Nash Social Welfare with Additive Valuations. | Yuda Feng, Shi Li |
| 2024 | Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. | Andreas Emil Feldmann, Michael Lampis |
| 2024 | Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. | Baris Can Esmer, Jacob Focke, Dniel Marx, Pawel Rzazewski |
| 2024 | Group Fairness: Multiwinner Voting and Beyond (Invited Talk). | Edith Elkind |
| 2024 | Testing C_k-Freeness in Bounded-Arboricity Graphs. | Talya Eden, Reut Levi, Dana Ron |