7 citations · 9 across the 3 of their papers we have counts for
3 papers
cs.DC2023
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…
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.DS2022★ 7 cited
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…