Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. - Calvin Beideman; Karthekeyan Chandrasekaran; Weihang Wang 002 (ICALP, 2022)

Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k. - Calvin Beideman; Karthekeyan Chandrasekaran; Weihang Wang 002 (SODA, 2022)

ℓ p-Norm Multiway Cut. - Karthekeyan Chandrasekaran; Weihang Wang 002 (Algorithmica, 2022)

Approximate minimum cuts and their enumeration. - Calvin Beideman; Karthekeyan Chandrasekaran; Weihang Wang 002 (SOSA, 2023)

Fixed parameter approximation scheme for min-max k-cut. - Karthekeyan Chandrasekaran; Weihang Wang 002 (Math. Program., 2023)

Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. - Calvin Beideman; Karthekeyan Chandrasekaran; Weihang Wang 002 (Math. Oper. Res., 2024)

Approximating Submodular ({k} )-Partition via Principal Partition Sequence. - Karthekeyan Chandrasekaran; Weihang Wang 002 (SIAM J. Discret. Math., 2024)

Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. - Calvin Beideman; Karthekeyan Chandrasekaran; Weihang Wang 002 (Math. Program., 2024)