Chandrasekaran, Karthekeyan
- Algorithms for Implicit Hitting Set Problems
2011/02/07 by Karthekeyan Chandrasekaran, Chandrasekaran, Karthekeyan, Richard M. Karp +5 · 2 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #F.2 #FOS: Computer and information sciences #Machine Learning and Algorithms
- Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families
2009/04/03 by Chandrasekaran, Karthekeyan, Dadush, Daniel, Vempala, Santosh · 1 citation
#Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #Functional Analysis (math.FA) #Probability (math.PR)
- Approximate minimum cuts and their enumeration
2022/11/30 by Beideman, Calvin, Chandrasekaran, Karthekeyan, Wang, Weihang · 2 citations
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Faster Private Release of Marginals on Small Databases
2013/04/13 by Karthekeyan Chandrasekaran, Justin Thaler, Chandrasekaran, Karthekeyan +5 · 1 citation
Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Privacy-Preserving Technologies in Data
- Splitting-off in Hypergraphs
2023/07/17 by Bérczi, Kristóf, Chandrasekaran, Karthekeyan, Király, Tamás +1 · 2 citations
#Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- Approximating submodular k-partition via principal partition sequence
2023/05/01 by Chandrasekaran, Karthekeyan, Wang, Weihang · 2 citations
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Monotone Submodular Multiway Partition
2024/11/08 by Bi, Richard, Chandrasekaran, Karthekeyan, Joshi, Soham · 2 citations
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences