Παρακολούθηση
Karthekeyan Chandrasekaran
Karthekeyan Chandrasekaran
University of Illinois, Urbana-Champaign
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα illinois.edu - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Deterministic algorithms for the Lovász local lemma
K Chandrasekaran, N Goyal, B Haeupler
SIAM Journal on Computing 42 (6), 2132-2155, 2013
912013
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
662011
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
542014
Hypergraph k-cut in randomized polynomial time
K Chandrasekaran, C Xu, X Yu
Mathematical Programming, 1-29, 2019
442019
Finding a most biased coin with fewest flips
K Chandrasekaran, R Karp
Conference on Learning Theory, 394-407, 2014
412014
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
272014
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
K Chandrasekaran, C Chekuri
Mathematics of Operations Research 47 (4), 3380-3399, 2022
222022
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
222019
Integer feasibility of random polytopes: random integer programs
K Chandrasekaran, SS Vempala
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
222014
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
22*2012
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
212021
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
202010
Min–max partitioning of hypergraphs and symmetric submodular functions
K Chandrasekaran, C Chekuri
Combinatorica 43 (3), 455-477, 2023
192023
Sampling s-concave functions: The limit of convexity based isoperimetry
K Chandrasekaran, A Deshpande, S Vempala
International Workshop on Approximation Algorithms for Combinatorial …, 2009
162009
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
112019
Additive stabilizers for unstable graphs
K Chandrasekaran, C Gottschalk, J Könemann, B Peis, D Schmand, ...
Discrete Optimization 31, 56-78, 2019
112019
Deciding Orthogonality in Construction-A Lattices
K Chandrasekaran, V Gandikota, E Grigorescu
SIAM Journal on Discrete Mathematics 31 (2), 1244-1262, 2017
92017
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k
C Beideman, K Chandrasekaran, W Wang
Mathematics of Operations Research 49 (4), 2579-2601, 2024
82024
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
82022
Shift lifts preserving Ramanujan property
K Chandrasekaran, A Velingker
Linear Algebra and its Applications 529, 199-214, 2017
82017
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20