| No. |
Title |
Author |
Year |
| 1 |
Approximating Submodular k-Partition via Principal Partition Sequence |
Chandrasekaran, Karthekeyan et al. |
2023 |
| 2 |
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions |
Beideman, Calvin et al. |
2022 |
| 3 |
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k |
Beideman, Calvin et al. |
2022 |
| 4 |
?_p-Norm Multiway Cut |
Chandrasekaran, Karthekeyan et al. |
2021 |
| 5 |
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree |
Chandrasekaran, Karthekeyan et al. |
2020 |
| 6 |
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs |
Beideman, Calvin et al. |
2020 |
| 7 |
The Maximum Binary Tree Problem |
Chandrasekaran, Karthekeyan et al. |
2020 |
| 8 |
Spectral Aspects of Symmetric Matrix Signings |
Carlson, Charles et al. |
2019 |
| 9 |
Lattice-based Locality Sensitive Hashing is Optimal |
Chandrasekaran, Karthekeyan et al. |
2018 |
| 10 |
Odd Multiway Cut in Directed Acyclic Graphs |
Chandrasekaran, Karthekeyan et al. |
2018 |
| 11 |
Global and Fixed-Terminal Cuts in Digraphs |
Bérczi, Kristóf et al. |
2017 |
| 12 |
On the Expansion of Group-Based Lifts |
Agarwal, Naman et al. |
2017 |
| 13 |
Local Testing for Membership in Lattices |
Chandrasekaran, Karthekeyan et al. |
2016 |
| 14 |
Deciding Orthogonality in Construction-A Lattices |
Chandrasekaran, Karthekeyan et al. |
2015 |
