An improved coarsening process for multilevel hypergraph partitioning that incorporates global information about the community structure is presented that significantly improves the solutions found by the initial partitioning algorithm and consistently improves overall solution quality.