Calvin Beideman

According to our database, Calvin Beideman authored at least 9 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Multicriteria cuts and size-constrained k-cuts in hypergraphs.

Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu

Math. Program., January, 2023

Approximate minimum cuts and their enumeration.

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022

Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k.

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition.

Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k.

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions.

Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k.

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

CoRR, 2021

2020

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs.

Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu

CoRR, 2020

2014

Set Families with Low Pairwise Intersection.

Calvin Beideman, Jeremiah Blocki

CoRR, 2014