Set Families with Low Pairwise Intersection. - Calvin Beideman; Jeremiah Blocki (CoRR, 2014)

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs. - Calvin Beideman; Karthekeyan Chandrasekaran; Chao Xu 002 (CoRR, 2020)

Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. - Calvin Beideman; Karthekeyan Chandrasekaran; Chandra Chekuri; Chao Xu 002 (FSTTCS, 2022)

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

Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. - Calvin Beideman; Karthekeyan Chandrasekaran; Sagnik Mukhopadhyay; Danupon Nanongkai (IPCO, 2022)

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

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

Multicriteria cuts and size-constrained k-cuts in hypergraphs. - Calvin Beideman; Karthekeyan Chandrasekaran; Chao Xu 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)

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)