We present new refinement heuristics for the balanced graph partitioning problem that break
with an age-old rule. Traditionally, local search only permits moves that keep the block sizes …

The multilevel heuristic is the dominant strategy for high-quality sequential and parallel
graph partitioning. Partition refinement is a key step of multilevel graph partitioning. In this …

Recently, researchers have extended the concept of matchings to the more general problem
of finding $ b $-matchings in hypergraphs broadening the scope of potential applications …

Balanced hypergraph partitioning (BHP) is a fundamental combinatorial optimization
problem in application specific integrated circuit (ASIC) and field-programmable gate array …

Multiway circuit partitioning is a key combinatorial optimization problem that appears many
times throughout the Very Large Scale Integration (VLSI) design workflow. However, as VLSI …

We summarize recent developments in parallel libraries for balanced graph partitioning,
spanning contributions made over several research papers~\citeMT-KAHYPAR-D, MT …