activity
20212026
most citedScalable High-Quality Hypergraph Partitioning

2 citations · 3 across the 6 of their papers we have counts for

collaborators

7 papers

cs.DS2026

High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing

Nikolai Maas

Multi-constraint hypergraph partitioning is a generalization of balanced partitioning, where the vertex set of a hypergraph is partitioned such that the inter-block connectivity of…

cs.DC2025

Deterministic Parallel High-Quality Hypergraph Partitioning

Robert Krause, Lars Gottesbüren, Nikolai Maas

We present a deterministic parallel multilevel algorithm for balanced hypergraph partitioning that matches the state of the art for non-deterministic algorithms. Deterministic para…

cs.DS2025

Linear-Time Multilevel Graph Partitioning via Edge Sparsification

Lars Gottesbüren, Nikolai Maas, Dominik Rosch +2

The current landscape of balanced graph partitioning is divided into high-quality but expensive multilevel algorithms and cheaper approaches with linear running time, such as singl…

cs.DS2024

Engineering Optimal Parallel Task Scheduling

Matthew Akram, Nikolai Maas, Peter Sanders +1

The NP-hard scheduling problem P||C_max encompasses a set of tasks with known execution time which must be mapped to a set of identical machines such that the overall completion ti…

cs.SI2023

Parallel Unconstrained Local Search for Partitioning Irregular Graphs

Nikolai Maas, Lars Gottesbüren, Daniel Seemaier

We present new refinement heuristics for the balanced graph partitioning problem that break with an age-old rule. Traditionally, local search only permits moves that keep the block…

cs.DC2023★ 2 cited

Scalable High-Quality Hypergraph Partitioning

Lars Gottesbüren, Tobias Heuer, Nikolai Maas +2

Balanced hypergraph partitioning is an NP-hard problem with many applications, e.g., optimizing communication in distributed data placement problems. The goal is to place all nodes…

cs.DS2021★ 1 cited

Multilevel Hypergraph Partitioning with Vertex Weights Revisited

Tobias Heuer, Nikolai Maas, Sebastian Schlag

The balanced hypergraph partitioning problem (HGP) is to partition the vertex set of a hypergraph into k disjoint blocks of bounded weight, while minimizing an objective function d…