Set families with low pairwise intersection C Beideman, J Blocki
arXiv preprint arXiv:1404.4622, 2014
17 2014 Counting and Enumerating Optimum Cut Sets for Hypergraph k -Partitioning Problems for Fixed k C Beideman, K Chandrasekaran, W Wang
Mathematics of Operations Research, 2023
8 2023 Deterministic enumeration of all minimum k -cut-sets in hypergraphs for fixed k C Beideman, K Chandrasekaran, W Wang
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
7 2022 Faster connectivity in low-rank hypergraphs via expander decomposition C Beideman, K Chandrasekaran, S Mukhopadhyay, D Nanongkai
International Conference on Integer Programming and Combinatorial …, 2022
4 2022 The Sprague-Grundy function for some selective compound games C Beideman, M Bowen, NA Muyesser
arXiv preprint arXiv:1802.08700, 2018
4 2018 Multicriteria cuts and size-constrained k -cuts in hypergraphs C Beideman, K Chandrasekaran, C Xu
Mathematical Programming 197 (1), 27-69, 2023
2 2023 Approximate minimum cuts and their enumeration C Beideman, K Chandrasekaran, W Wang
Symposium on Simplicity in Algorithms (SOSA), 36-41, 2023
1 2023 Approximate representation of symmetric submodular functions via hypergraph cut functions C Beideman, K Chandrasekaran, C Chekuri, C Xu
42nd IARCS Annual Conference on Foundations of Software Technology and …, 2022
1 2022 Deterministic enumeration of all minimum cut-sets and k -cut-sets in hypergraphs for fixed k C Beideman, K Chandrasekaran, W Wang
Mathematical Programming, 1-39, 2023
2023 Cuts and partitions: solving, counting, and enumerating C Beideman
University of Illinois at Urbana-Champaign, 2023
2023 Multicritera Cuts and Size-Constrained C Beideman, K Chandrasekaran, C Xu
arXiv preprint arXiv:2006.11589, 2020
2020 SDP-Hardness of Approximation for Densest k-subgraph C Beideman, R O’Donnell
2017 Consequences of Hardness of Refuting Random CSPs C Beideman
2016 