Follow
Karthekeyan Chandrasekaran
Karthekeyan Chandrasekaran
Verified email at illinois.edu - Homepage
Title
Cited by
Cited by
Year
Deterministic algorithms for the Lovász local lemma
K Chandrasekaran, N Goyal, B Haeupler
SIAM Journal on Computing 42 (6), 2132-2155, 2013
872013
Algorithms for implicit hitting set problems
K Chandrasekaran, R Karp, E Moreno-Centeno, S Vempala
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011
572011
Faster private release of marginals on small databases
K Chandrasekaran, J Thaler, J Ullman, A Wan
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
482014
Hypergraph k-cut in randomized polynomial time
K Chandrasekaran, C Xu, X Yu
Mathematical Programming, 1-29, 2019
402019
Finding a most biased coin with fewest flips
K Chandrasekaran, R Karp
Conference on Learning Theory, 394-407, 2014
382014
Finding small stabilizers for unstable graphs
A Bock, K Chandrasekaran, J Könemann, B Peis, L Sanitŕ
Integer Programming and Combinatorial Optimization, 150-161, 2014
242014
The cutting plane method is polynomial for perfect matchings
K Chandrasekaran, LA Végh, S Vempala
Foundations of Computer Science (FOCS), 2012 IEEE 53rd Annual Symposium on …, 2012
20*2012
Integer feasibility of random polytopes: random integer programs
K Chandrasekaran, SS Vempala
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
192014
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
K Chandrasekaran, C Chekuri
Mathematics of Operations Research 47 (4), 3380-3399, 2022
182022
Improving the smoothed complexity of FLIP for max cut problems
A Bibak, C Carlson, K Chandrasekaran
ACM Transactions on Algorithms (TALG) 17 (3), 1-38, 2021
182021
Improving the Integrality Gap for Multiway Cut
K Bérczi, K Chandrasekaran, T Király, V Madan
International Conference on Integer Programming and Combinatorial …, 2019
172019
Thin partitions: Isoperimetric inequalities and a sampling algorithm for star shaped bodies
K Chandrasekaran, D Dadush, S Vempala
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
152010
Min–max partitioning of hypergraphs and symmetric submodular functions
K Chandrasekaran, C Chekuri
Combinatorica 43 (3), 455-477, 2023
142023
Sampling s-concave functions: The limit of convexity based isoperimetry
K Chandrasekaran, A Deshpande, S Vempala
International Workshop on Approximation Algorithms for Combinatorial …, 2009
132009
Additive stabilizers for unstable graphs
K Chandrasekaran, C Gottschalk, J Könemann, B Peis, D Schmand, ...
Discrete Optimization 31, 56-78, 2019
102019
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
82023
On the Expansion of Group-Based Lifts
N Agarwal, K Chandrasekaran, A Kolla, V Madan
SIAM Journal on Discrete Mathematics 33 (3), 1338-1373, 2019
82019
Global and fixed-terminal cuts in digraphs
K Bérczi, K Chandrasekaran, T Király, E Lee, C Xu
arXiv preprint arXiv:1612.00156, 2016
82016
Thin partitions: Isoperimetric inequalities and sampling algorithms for some nonconvex families
K Chandrasekaran, D Dadush, S Vempala
arXiv preprint arXiv:0904.0583, 2009
82009
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
72022
The system can't perform the operation now. Try again later.
Articles 1–20