1. Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, and Danupon Nanongkai. 2022. Faster connectivity in low-rank hypergraphs via expander decomposition. In Proceedings of the International Conference on Integer Programming and Combinatorial Optimization (IPCO’22). 70–83.
2. Calvin Beideman, Karthekeyan Chandrasekaran, and Weihang Wang. 2022. Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k. In Proceedings of the 49th International Colloquium on Automata, Languages, and Programming (ICALP’22), Vol. 229. 16:1–16:18.
3. Calvin Beideman, Karthekeyan Chandrasekaran, and Weihang Wang. 2022. Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’22). 2208–2228.
4. Karthekeyan Chandrasekaran and Chandra Chekuri. 2020. Hypergraph k-cut for fixed k in deterministic polynomial time. In Proceedings of the IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS’20). IEEE, 810–821.
5. Karthekeyan Chandrasekaran and Chandra Chekuri. 2021. Min-max partitioning of hypergraphs and symmetric submodular functions. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’21). SIAM, 1026–1038.