| 2022 | Shared-Memory n-level Hypergraph Partitioning. | Lars Gottesbren, Tobias Heuer, Peter Sanders, Sebastian Schlag |
| 2022 | Towards the 5/6-Density Conjecture of Pinwheel Scheduling. | Leszek Gasieniec, Benjamin Smith, Sebastian Wild |
| 2022 | Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification. | Tamal K. Dey, Simon Zhang |
| 2022 | Computing Graph Hyperbolicity Using Dominating Sets. | David Coudert, Andr Nusser, Laurent Viennot |
| 2022 | McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. | Jonas Charfreitag, Michael Jnger, Sven Mallach, Petra Mutzel |
| 2022 | Parallel Nearest Neighbors in Low Dimensions with Batch Updates. | Guy E. Blelloch, Magdalen Dobson |
| 2022 | An Efficient Branch-and-Bound Solver for Hitting Set. | Thomas Blsius, Tobias Friedrich, David Stangl, Christopher Weyand |
| 2022 | Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman Problem. | Emil Biju, Sundar Raman P. |
| 2022 | Load Balancing: The Long Road from Theory to Practice. | Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder |
| 2022 | Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques. | Daniel Bahrdt, Stefan Funke, Sokol Makolli, Claudius Proissl |
| 2022 | Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. | Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald |
| 2022 | Efficient Access History for Race Detection. | Yifan Xu, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl |
| 2021 | A Parallel Packed Memory Array to Store Dynamic Graphs. | Brian Wheatman, Helen Xu |
| 2021 | Multilevel Acyclic Hypergraph Partitioning. | Merten Popp, Sebastian Schlag, Christian Schulz, Daniel Seemaier |
| 2021 | SAT-and-Reduce for Vertex Cover: Accelerating Branch-and-Reduce by SAT Solving. | Rick Plachetta, Alexander van der Grinten |
| 2021 | Engineering Data Reduction for Nested Dissection. | Lara Ost, Christian Schulz, Darren Strash |
| 2021 | Computation of Large Asymptotics of 3-Manifold Quantum Invariants. | Clment Maria, Owen Rouill |
| 2021 | Fast Minimal Presentations of Bi-graded Persistence Modules. | Michael Kerber, Alexander Rolle |
| 2021 | Scalable Shared-Memory Hypergraph Partitioning. | Lars Gottesbren, Tobias Heuer, Peter Sanders, Sebastian Schlag |
| 2021 | Fully Dynamic | Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil |
| 2021 | An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. | Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis |
| 2021 | Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. | Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdn Zavlnij |
| 2021 | Fast, Exact and Scalable Dynamic Ridesharing. | Valentin Buchhold, Peter Sanders, Dorothea Wagner |
| 2021 | PFP Compressed Suffix Trees. | Christina Boucher, Ondrej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Gonzalo Navarro, Massimiliano Rossi |
| 2021 | A "Learned" Approach to Quicken and Compress Rank/Select Dictionaries. | Antonio Boffa, Paolo Ferragina, Giorgio Vinciguerra |