2 citations · 3 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…
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…