7 citations · 24 across the 8 of their papers we have counts for
13 papers
Open Problems in (Hyper)Graph Decomposition
Deepak Ajwani, Rob H. Bisseling, Katrin Casel +26
Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gai…
A Direct k-Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric
Tobias Heuer
Minimizing wire-lengths is one of the most important objectives in circuit design. The process involves initially placing the logical units (cells) of a circuit onto a physical lay…
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…
SATViz: Real-Time Visualization of Clausal Proofs
Tim Holzenkamp, Kevin Kuryshev, Thomas Oltmann +4
Visual layouts of graphs representing SAT instances can highlight the community structure of SAT instances. The community structure of SAT instances has been associated with both i…
More Recent Advances in (Hyper)Graph Partitioning
Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj +8
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last decade in practical…
Parallel Flow-Based Hypergraph Partitioning
Lars Gottesbüren, Tobias Heuer, Peter Sanders
We present a shared-memory parallelization of flow-based refinement, which is considered the most powerful iterative improvement technique for hypergraph partitioning at the moment…
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…
Deep Multilevel Graph Partitioning
Lars Gottesbüren, Tobias Heuer, Peter Sanders +2
Partitioning a graph into blocks of "roughly equal" weight while cutting only few edges is a fundamental problem in computer science with a wide range of applications. In particula…
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…
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
Tobias Heuer, Peter Sanders, Sebastian Schlag
We present a refinement framework for multilevel hypergraph partitioning that uses max-flow computations on pairs of blocks to improve the solution quality of a -way partition.…
k-way Hypergraph Partitioning via n-Level Recursive Bisection
Sebastian Schlag, Vitali Henne, Tobias Heuer +3
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time. Using several caching and lazy-evaluation techniques during coarsening and…