| 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 |
| Fixed parameter approximation scheme for min-max k-cut K Chandrasekaran, W Wang Mathematical Programming 197 (2), 1093-1144, 2023 | 2 | 2023 |
| -Norm Multiway Cut K Chandrasekaran, W Wang Algorithmica 84 (9), 2667-2701, 2022 | 2 | 2022 |
| Approximate minimum cuts and their enumeration C Beideman, K Chandrasekaran, W Wang Symposium on Simplicity in Algorithms (SOSA), 36-41, 2023 | 1 | 2023 |
| 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 |
Karthekeyan ChandrasekaranUniversity of Illinois, Urbana-ChampaignVerified email at illinois.edu
