Shared-memory parallel minimum cut algorithms (inexact, exact, cactus, multiterminal)

FREIGHT: Fast Streaming Hypergraph Partitioning — SEA 2023 Best Paper Award

StreamCPI is a framework for reducing the memory consumption of streaming graph partitioners by compressing the array of block assignments used by such partitioners with run-length compression.

Buffered Streaming Graph Partitioning

Exact minimum cuts in hypergraphs at scale using FPT kernelization

Weighted connectivity augmentation algorithms: heuristics, local search, and ILP-based exact approaches

Streaming Process Mapping

A buffered streaming graph partitioner using prioritized buffering and multilevel refinement. Robust against adversarial node orderings.

Neural LSH implementation!