| Practical Fully Dynamic Minimum Cut Algorithms. | 0 | 0.34 | 2024 |
| Faster Parallel Multiterminal Cuts. | 0 | 0.34 | 2021 |
| Multilevel Acyclic Hypergraph Partitioning | 0 | 0.34 | 2021 |
| High-Quality Hierarchical Process Mapping | 0 | 0.34 | 2020 |
| Shared-Memory Branch-and-Reduce for Multiterminal Cuts. | 0 | 0.34 | 2020 |
| WeGotYouCovered - The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. | 2 | 0.36 | 2020 |
| High-Quality Shared-Memory Graph Partitioning. | 1 | 0.35 | 2020 |
| Better Process Mapping and Sparse Quadratic Assignment | 1 | 0.35 | 2020 |
| Faster Fully Dynamic Transitive Closure in Practice | 0 | 0.34 | 2020 |
| Efficient Process-to-Node Mapping Algorithms for Stencil Computations | 0 | 0.34 | 2020 |
| Finding All Global Minimum Cuts In Practice | 0 | 0.34 | 2020 |
| Evolutionary multi-level acyclic graph partitioning | 1 | 0.36 | 2020 |
| Fully Dynamic Single-Source Reachability in Practice - An Experimental Study. | 0 | 0.34 | 2020 |
| Dynamic Matching Algorithms in Practice | 0 | 0.34 | 2020 |
| Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. | 0 | 0.34 | 2019 |
| Finding Optimal Longest Paths by Dynamic Programming in Parallel. | 0 | 0.34 | 2019 |
| Faster Support Vector Machines. | 0 | 0.34 | 2019 |
| Engineering Kernelization for Maximum Cut. | 0 | 0.34 | 2019 |
| Evolutionary multi-level acyclic graph partitioning. | 0 | 0.34 | 2018 |
| ILP-Based Local Search for Graph Partitioning | 0 | 0.34 | 2018 |
| Communication-Free Massively Distributed Graph Generation | 2 | 0.37 | 2018 |
| Shared-Memory Exact Minimum Cuts | 0 | 0.34 | 2018 |
| High-Quality Shared-Memory Graph Partitioning. | 4 | 0.38 | 2018 |
| Graph Partitioning with Acyclicity Constraints. | 1 | 0.34 | 2017 |
| Optimal Longest Paths by Dynamic Programming. | 0 | 0.34 | 2017 |
| Better Process Mapping and Sparse Quadratic Assignment. | 1 | 0.35 | 2017 |
| Distributed Evolutionary k-way Node Separators. | 2 | 0.37 | 2017 |
| Scalable Kernelization for Maximum Independent Sets. | 2 | 0.42 | 2017 |
| Memetic multilevel hypergraph partitioning | 3 | 0.39 | 2017 |
| VieM v1.00 - Vienna Mapping and Sparse Quadratic Assignment User Guide. | 0 | 0.34 | 2017 |
| Evolutionary Acyclic Graph Partitioning. | 0 | 0.34 | 2017 |
| Accelerating Local Search for the Maximum Independent Set Problem. | 6 | 0.44 | 2016 |
| Scalable generation of scale-free graphs. | 1 | 0.35 | 2016 |
| k-way Hypergraph Partitioning via n-Level Recursive Bisection. | 4 | 0.39 | 2016 |
| Drawing Large Graphs by Multilevel Maxent-Stress Optimization | 6 | 0.44 | 2015 |
| Practical Massively Parallel Sorting | 9 | 0.76 | 2015 |
| Incorporating Road Networks into Territory Design. | 0 | 0.34 | 2015 |
| Advanced Multilevel Node Separator Algorithms | 1 | 0.37 | 2015 |
| Finding Near-Optimal Independent Sets at Scale | 8 | 0.50 | 2015 |
| Graph Partitioning for Independent Sets. | 4 | 0.39 | 2015 |
| (Semi-)External Algorithms for Graph Partitioning and Clustering. | 0 | 0.34 | 2014 |
| Practical Massively Parallel Sorting - Basic Algorithmic Ideas. | 0 | 0.34 | 2014 |
| Think Locally, Act Globally: Highly Balanced Graph Partitioning. | 44 | 1.49 | 2013 |
| KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide. | 0 | 0.34 | 2013 |
| Efficient parallel and external matching | 5 | 0.45 | 2013 |
| Advanced Coarsening Schemes for Graph Partitioning | 26 | 0.83 | 2012 |
| Optimized hybrid parallel lattice boltzmann fluid flow simulations on complex geometries | 11 | 1.02 | 2012 |
| Think Locally, Act Globally: Perfectly Balanced Graph Partitioning | 2 | 0.45 | 2012 |
| High Quality Graph Partitioning | 11 | 0.58 | 2012 |
| Engineering graph partitioning algorithms | 4 | 0.49 | 2012 |
