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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI