4 citations · 7 across the 4 of their papers we have counts for
11 papers
High-Quality Hypergraph Partitioning
Sebastian Schlag, Tobias Heuer, Lars Gottesbüren +3
This paper considers the balanced hypergraph partitioning problem, which asks for partitioning the vertices into disjoint blocks of bounded size while minimizing an objective f…
Shared-Memory n-level Hypergraph Partitioning
Lars Gottesbüren, Tobias Heuer, Peter Sanders +1
We present a shared-memory algorithm to compute high-quality solutions to the balanced -way hypergraph partitioning problem. This problem asks for a partition of the vertex set…
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…
Scalable Shared-Memory Hypergraph Partitioning
Lars Gottesbüren, Tobias Heuer, Peter Sanders +1
Hypergraph partitioning is an important preprocessing step for optimizing data placement and minimizing communication volumes in high-performance computing applications. To cope wi…
Advanced Flow-Based Multilevel Hypergraph Partitioning
Lars Gottesbüren, Michael Hamann, Sebastian Schlag +1
The balanced hypergraph partitioning problem is to partition a hypergraph into disjoint blocks of bounded size such that the sum of the number of blocks connected by each hyper…
Multilevel Acyclic Hypergraph Partitioning
Merten Popp, Sebastian Schlag, Christian Schulz +1
A directed acyclic hypergraph is a generalized concept of a directed acyclic graph, where each hyperedge can contain an arbitrary number of tails and heads. Directed hypergraphs ca…