| 2025 | HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees. | Alejandro Garca-Castellanos, Aniss Aiman Medbouhi, Giovanni Luca Marchetti, Erik J. Bekkers, Danica Kragic |
| 2025 | SpiderDAN: Matching Augmentation in Demand-Aware Networks. | Aleksander Figiel, Darya Melnyk, Andr Nichterlein, Arash Pourdamghani, Stefan Schmid |
| 2025 | A Greedy Algorithm for Low-Crossing Partitions for General Set Systems. | Mnika Csiks, Alexandre Louvet, Nabil H. Mustafa |
| 2025 | Constructions, Bounds, and Algorithms for Peaceable Queens. | Katie Clinch, Matthew Drescher, Tony Huynh, Abdallah Saffidine |
| 2025 | Optimal Neighborhood Exploration for Dynamic Independent Sets. | Jannick Borowitz, Ernestine Gromann, Christian Schulz |
| 2025 | The Constrained Layer Tree Problem and Applications to Solar Farm Cabling. | Thomas Blsius, Max Gttlicher, Sascha Gritzbach, Wendy Yi |
| 2025 | A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order. | Arne Beines, Michael Kaibel, Philip Mayer, Petra Mutzel, Jonas Sauer |
| 2025 | Another L Makes It Better? Lagrange Meets LLL and May Improve BKZ Pre-Processing. | Sbastien Balny, Claire Delaplace, Gilles Dequen |
| 2025 | Batched k-Mer Lookup on the Spectral Burrows-Wheeler Transform. | Jarno N. Alanko, Elena Biagi, Joel Mackenzie, Simon J. Puglisi |
| 2025 | Engineering Optimal Parallel Task Scheduling. | Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber |
| 2024 | Interactive Exploration of the Temporal α-Shape. | Felix Weitbrecht |
| 2024 | Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. | Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun |
| 2024 | Parallel Unconstrained Local Search for Partitioning Irregular Graphs. | Nikolai Maas, Lars Gottesbren, Daniel Seemaier |
| 2024 | ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. | Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
| 2024 | Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points. | Moritz Laupichler, Peter Sanders |
| 2024 | Near-Optimal Coverage Path Planning with Turn Costs. | Dominik Krupke |
| 2024 | A Direct | Tobias Heuer |
| 2024 | Experimental Evaluation of Fully Dynamic | Monika Henzinger, David Saulpic, Leonhard Sidl |
| 2024 | Covering Rectilinear Polygons with Area-Weighted Rectangles. | Kathrin Hanauer, Martin P. Seybold, Julian Unterweger |
| 2024 | 2-Fault-Tolerant Strong Connectivity Oracles. | Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis |
| 2024 | Simple and Robust Dynamic Two-Dimensional Convex Hull. | Emil Toftegaard Gde, Inge Li Grtz, Ivor van der Hoog, Christoffer Krogh, Eva Rotenberg |
| 2024 | Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm. | Simon D. Fink, Ignaz Rutter |
| 2024 | Fast and Delay-Robust Multimodal Journey Planning. | Dominik Bez, Jonas Sauer |
| 2024 | Fast and simple unrooted dynamic forests. | Benjamin Aram Berendsohn |
| 2024 | Counting Polyominoes, Revisited. | Gill Barequet, Gil Ben-Shachar |