Karthekeyan Chandrasekaran

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 69

Top Venues

Georgia Institute of Technology, Atlanta, GA, USA (PHD)

Education History

Georgia Institute of Technology, Atlanta, GA, USA

PHD

Publications

Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. CoRR (2024)
Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set. CoRR (2023)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time. CoRR (2023)
Karthekeyan Chandrasekaran, Weihang Wang
Approximating submodular k-partition via principal partition sequence. CoRR (2023)
Karthekeyan Chandrasekaran, Weihang Wang
Approximating Submodular k-Partition via Principal Partition Sequence. APPROX/RANDOM (2023)
Karthekeyan Chandrasekaran, Chandra Chekuri
Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions. Comb. 43 (3) (2023)
Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
Multicriteria cuts and size-constrained k-cuts in hypergraphs. Math. Program. 197 (1) (2023)
Karthekeyan Chandrasekaran, Weihang Wang
Fixed parameter approximation scheme for min-max k-cut. Math. Program. 197 (2) (2023)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Aditya Pillai
Analyzing Residual Random Greedy for monotone submodular maximization. Inf. Process. Lett. 180 (2023)
Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
Approximate minimum cuts and their enumeration. SOSA (2023)
Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k. CoRR (2022)
Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. ICALP (2022)
Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
Approximate minimum cuts and their enumeration. CoRR (2022)
Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai
Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. IPCO (2022)
Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k. SODA (2022)
Karthekeyan Chandrasekaran, Weihang Wang
-Norm Multiway Cut. Algorithmica 84 (9) (2022)
Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS (2022)
Karthekeyan Chandrasekaran, Chandra Chekuri
in Deterministic Polynomial Time. Math. Oper. Res. 47 (4) (2022)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. CoRR (2021)
Karthekeyan Chandrasekaran, Chandra Chekuri
Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. SODA (2021)
Karthekeyan Chandrasekaran, Weihang Wang
-norm Multiway Cut. CoRR (2021)
Karthekeyan Chandrasekaran, Weihang Wang
-Norm Multiway Cut. ESA (2021)
Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu
Hypergraph k-cut in randomized polynomial time. Math. Program. 186 (1) (2021)
Karthekeyan Chandrasekaran, Weihang Wang
Fixed Parameter Approximation Scheme for Min-Max k-Cut. IPCO (2021)
Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. CoRR (2021)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
The Maximum Binary Tree Problem. Algorithmica 83 (8) (2021)
Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
Improving the Smoothed Complexity of FLIP for Max Cut Problems. ACM Trans. Algorithms 17 (3) (2021)
Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. APPROX-RANDOM (2020)
Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla
Spectral aspects of symmetric matrix signings. Discret. Optim. 37 (2020)
Karthekeyan Chandrasekaran, Chandra Chekuri
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. FOCS (2020)
Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari
Odd Multiway Cut in Directed Acyclic Graphs. SIAM J. Discret. Math. 34 (2) (2020)
Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs. CoRR (2020)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
The Maximum Binary Tree Problem. ESA (2020)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
A tight $\sqrt{2}$-approximation for linear 3-cut. Math. Program. 184 (1) (2020)
Karthekeyan Chandrasekaran, Chandra Chekuri
Hypergraph k-cut for fixed k in deterministic polynomial time. CoRR (2020)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
Improving the integrality gap for multiway cut. Math. Program. 183 (1) (2020)
Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai
Faster connectivity in low-rank hypergraphs via expander decomposition. CoRR (2020)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. IPEC (2020)
Karthekeyan Chandrasekaran, Weihang Wang
Fixed Parameter Approximation Scheme for Min-max k-cut. CoRR (2020)
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz
Additive stabilizers for unstable graphs. Discret. Optim. 31 (2019)
Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan
On the Expansion of Group-Based Lifts. SIAM J. Discret. Math. 33 (3) (2019)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Beating the 2-approximation factor for global bicut. Math. Program. 177 (1-2) (2019)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
Improving the Integrality Gap for Multiway Cut. IPCO (2019)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
The Maximum Binary Tree Problem. CoRR (2019)
Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla
Spectral Aspects of Symmetric Matrix Signings. MFCS (2019)
Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
Improving the smoothed complexity of FLIP for max cut problems. SODA (2019)
Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
Local Testing of Lattices. SIAM J. Discret. Math. 32 (2) (2018)
Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu
Lattice-based Locality Sensitive Hashing is Optimal. ITCS (2018)
Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu
-Cut in Randomized Polynomial Time. SODA (2018)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
Improving the Integrality Gap for Multiway Cut. CoRR (2018)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
A tight -approximation for Linear 3-Cut. SODA (2018)
Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
Improving the smoothed complexity of FLIP for max cut problems. CoRR (2018)
Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari
Odd Multiway Cut in Directed Acyclic Graphs. CoRR (2017)
Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
Deciding Orthogonality in Construction-A Lattices. SIAM J. Discret. Math. 31 (2) (2017)
Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan
On the Expansion of Group-Based Lifts. APPROX-RANDOM (2017)
Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu
Lattice-based Locality Sensitive Hashing is Optimal. CoRR (2017)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM (2017)
Karthekeyan Chandrasekaran, Sahand Mozaffari
Odd Multiway Cut in Directed Acyclic Graphs. IPEC (2017)
Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Alexandra Kolla
Largest Eigenvalue and Invertibility of Symmetric Matrix Signings. CoRR (2016)
Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
The Cutting Plane Method is Polynomial for Perfect Matchings. Math. Oper. Res. 41 (1) (2016)
Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
Local Testing for Membership in Lattices. FSTTCS (2016)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Global and fixed-terminal cuts in digraphs. CoRR (2016)
Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
Local Testing for Membership in Lattices. CoRR (2016)
Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
Local Testing for Membership in Lattices. Electron. Colloquium Comput. Complex. 23 (2016)
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz
Additive Stabilizers for Unstable Graphs. CoRR (2016)
Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
Finding small stabilizers for unstable graphs. Math. Program. 154 (1-2) (2015)
Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
Deciding Orthogonality in Construction-A Lattices. FSTTCS (2015)
Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
Deciding Orthogonality in Construction-A Lattices. CoRR (2015)
Karthekeyan Chandrasekaran, Ameya Velingker
Constructing Ramanujan Graphs Using Shift Lifts. CoRR (2015)
Karthekeyan Chandrasekaran, Santosh S. Vempala
Integer feasibility of random polytopes: random integer programs. ITCS (2014)
Karthekeyan Chandrasekaran, Justin Thaler, Jonathan R. Ullman, Andrew Wan
Faster private release of marginals on small databases. ITCS (2014)
Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
Finding Small Stabilizers for Unstable Graphs. IPCO (2014)
Karthekeyan Chandrasekaran, Richard M. Karp
Finding a most biased coin with fewest flips. COLT (2014)
Karthekeyan Chandrasekaran, Justin Thaler, Jonathan R. Ullman, Andrew Wan
Faster Private Release of Marginals on Small Databases CoRR (2013)
Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
Deterministic Algorithms for the Lovász Local Lemma. SIAM J. Comput. 42 (6) (2013)
Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
The Cutting Plane Method is Polynomial for Perfect Matchings CoRR (2012)
Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
The Cutting Plane Method Is Polynomial for Perfect Matchings. FOCS (2012)
Karthekeyan Chandrasekaran, Richard M. Karp
Finding the most biased coin with fewest flips CoRR (2012)
Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno, Santosh S. Vempala
Algorithms for Implicit Hitting Set Problems. SODA (2011)
Karthekeyan Chandrasekaran, Santosh S. Vempala
A Discrepancy based Approach to Integer Programming CoRR (2011)
Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno, Santosh S. Vempala
Algorithms for Implicit Hitting Set Problems CoRR (2011)
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh S. Vempala
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. SODA (2010)
Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections CoRR (2010)
Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
Deterministic Algorithms for the Lovász Local Lemma. SODA (2010)
Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
Deterministic Algorithms for the Lovasz Local Lemma CoRR (2009)
Karthekeyan Chandrasekaran, Amit Deshpande, Santosh S. Vempala
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry. APPROX-RANDOM (2009)
Karthekeyan Chandrasekaran, Amit Deshpande, Santosh S. Vempala
The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions CoRR (2009)
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh S. Vempala
Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families CoRR (2009)

Karthekeyan Chandrasekaran.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Karthekeyan Chandrasekaran