| 2024 | Scalable Distributed String Sorting. | Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek |
| 2024 | A Lower Bound for Local Search Proportional Approval Voting. | Sonja Kraiczy, Edith Elkind |
| 2024 | Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time. | Lukasz Kowalik |
| 2024 | The Algorithmic Power of the Greene-Kleitman Theorem. | Shimon Kogan, Merav Parter |
| 2024 | Giving Some Slack: Shortcuts and Transitive Closure Compressions. | Shimon Kogan, Merav Parter |
| 2024 | Re²Pair: Increasing the Scalability of RePair by Decreasing Memory Usage. | Justin Kim, Rahul Varki, Marco Oliva, Christina Boucher |
| 2024 | Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain. | Matthew J. Katz, Rachel Saban, Micha Sharir |
| 2024 | Steiner Tree Parameterized by Multiway Cut and Even Less. | Bart M. P. Jansen, Cline M. F. Swennenhuis |
| 2024 | Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. | Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa |
| 2024 | Improved Approximations for Flexible Network Design. | Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanit |
| 2024 | Connectivity Oracles for Predictable Vertex Failures. | Bingbing Hu, Evangelos Kosinas, Adam Polak |
| 2024 | Towards Communication-Efficient Peer-To-Peer Networks. | Khalid Hourani, William K. Moses Jr., Gopal Pandurangan |
| 2024 | Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. | Ivor van der Hoog, Irene Parada, Eva Rotenberg |
| 2024 | PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. | Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer |
| 2024 | Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard. | Klaus Heeger, Danny Hermelin |
| 2024 | Approximation Algorithms for Steiner Connectivity Augmentation. | Daniel Hathcock, Michael Zlatin |
| 2024 | Shortest Path Separators in Unit Disk Graphs. | Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng |
| 2024 | A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles. | Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa |
| 2024 | A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. | Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2024 | Fractional Linear Matroid Matching Is in Quasi-NC. | Rohit Gurjar, Taihei Oki, Roshan Raj |
| 2024 | Optimizing Throughput and Makespan of Queuing Systems by Information Design. | Svenja M. Griesbach, Max Klimm, Philipp Warode, Theresa Ziemke |
| 2024 | Practical Expander Decomposition. | Lars Gottesbren, Nikos Parotsidis, Maximilian Probst Gutenberg |
| 2024 | New Algorithms and Lower Bounds for Streaming Tournaments. | Prantar Ghosh, Sahil Kuchlous |
| 2024 | Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity. | Pawel Gawrychowski, Mateusz Wasylkiewicz |
| 2024 | Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices. | Dvir Fried, Tsvi Kopelowitz, Ely Porat |