KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.

Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.

A list of all publications related to the KaHyPar frameworks.

Multiple-way hypergraph partitioning based on simulated annealing (Moved to Codeberg)

IP formulations for hypergraph partitioning problems

Hypergraph(or bipartite graph) clustering algorithm.