Invited: Modern Hypergraph Partitioning: KaHyPar, Mt-KaHyPar, and Beyond

Hypergraph partitioning is a standard abstraction for VLSI circuit partitioning. While hypergraphs naturally capture multi-terminal nets, they also arise in a wide range of non-VLSI applications, including sparse matrix computations, scientific simulations, and data-intensive workloads. Historically, many successful hypergraph partitioning tools have been carefully tuned to the requirements of specific application domains, leaving a gap for general-purpose frameworks that deliver high solution quality and scalable performance across diverse classes of instances.