Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry. - Karthekeyan Chandrasekaran; Amit Deshpande 001; Santosh S. Vempala (APPROX-RANDOM, 2009)

Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families - Karthekeyan Chandrasekaran; Daniel Dadush; Santosh S. Vempala (CoRR, 2009)

The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions - Karthekeyan Chandrasekaran; Amit Deshpande 001; Santosh S. Vempala (CoRR, 2009)

Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. - Karthekeyan Chandrasekaran; Daniel Dadush; Santosh S. Vempala (SODA, 2010)

Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections - Karthekeyan Chandrasekaran; Navin Goyal; Bernhard Haeupler (CoRR, 2010)

Algorithms for Implicit Hitting Set Problems. - Karthekeyan Chandrasekaran; Richard M. Karp; Erick Moreno-Centeno; Santosh S. Vempala (SODA, 2011)

A Discrepancy based Approach to Integer Programming - Karthekeyan Chandrasekaran; Santosh S. Vempala (CoRR, 2011)

New approaches to integer programming. - Karthekeyan Chandrasekaran (2012)

Deterministic Algorithms for the Lovász Local Lemma. - Karthekeyan Chandrasekaran; Navin Goyal; Bernhard Haeupler (SIAM J. Comput., 2013)

Finding a most biased coin with fewest flips. - Karthekeyan Chandrasekaran; Richard M. Karp (COLT, 2014)

Faster private release of marginals on small databases. - Karthekeyan Chandrasekaran; Justin Thaler; Jonathan R. Ullman; Andrew Wan (ITCS, 2014)

Integer feasibility of random polytopes: random integer programs. - Karthekeyan Chandrasekaran; Santosh S. Vempala (ITCS, 2014)

Constructing Ramanujan Graphs Using Shift Lifts. - Karthekeyan Chandrasekaran; Ameya Velingker (CoRR, 2015)

Finding small stabilizers for unstable graphs. - Adrian Bock; Karthekeyan Chandrasekaran; Jochen Könemann; Britta Peis; Laura Sanità (Math. Program., 2015)

Largest Eigenvalue and Invertibility of Symmetric Matrix Signings. - Charles Carlson 002; Karthekeyan Chandrasekaran; Hsien-Chih Chang; Alexandra Kolla (CoRR, 2016)

Local Testing for Membership in Lattices. - Karthekeyan Chandrasekaran; Mahdi Cheraghchi; Venkata Gandikota; Elena Grigorescu (Electron. Colloquium Comput. Complex., 2016)

The Cutting Plane Method is Polynomial for Perfect Matchings. - Karthekeyan Chandrasekaran; László A. Végh; Santosh S. Vempala (Math. Oper. Res., 2016)

Global and Fixed-Terminal Cuts in Digraphs. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Euiwoong Lee; Chao Xu 002 (APPROX-RANDOM, 2017)

Odd Multiway Cut in Directed Acyclic Graphs. - Karthekeyan Chandrasekaran; Sahand Mozaffari (IPEC, 2017)

Deciding Orthogonality in Construction-A Lattices. - Karthekeyan Chandrasekaran; Venkata Gandikota; Elena Grigorescu (SIAM J. Discret. Math., 2017)

Lattice-based Locality Sensitive Hashing is Optimal. - Karthekeyan Chandrasekaran; Daniel Dadush; Venkata Gandikota; Elena Grigorescu (ITCS, 2018)

A tight -approximation for Linear 3-Cut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Vivek Madan (SODA, 2018)

Hypergraph k-Cut in Randomized Polynomial Time. - Karthekeyan Chandrasekaran; Chao Xu 002; Xilin Yu (SODA, 2018)

Local Testing of Lattices. - Karthekeyan Chandrasekaran; Mahdi Cheraghchi; Venkata Gandikota; Elena Grigorescu (SIAM J. Discret. Math., 2018)

Additive stabilizers for unstable graphs. - Karthekeyan Chandrasekaran; Corinna Gottschalk; Jochen Könemann; Britta Peis; Daniel Schmand; Andreas Wierz (Discret. Optim., 2019)

Beating the 2-approximation factor for global bicut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Euiwoong Lee; Chao Xu 002 (Math. Program., 2019)

On the Expansion of Group-Based Lifts. - Naman Agarwal; Karthekeyan Chandrasekaran; Alexandra Kolla; Vivek Madan (SIAM J. Discret. Math., 2019)

Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. - Karthekeyan Chandrasekaran; Chandra Chekuri (FOCS, 2020)

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. - Karthekeyan Chandrasekaran; Elena Grigorescu; Gabriel Istrate; Shubhang Kulkarni; Young-San Lin; Minshen Zhu (IPEC, 2020)

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs. - Calvin Beideman; Karthekeyan Chandrasekaran; Chao Xu 002 (CoRR, 2020)

Spectral aspects of symmetric matrix signings. - Charles Carlson 002; Karthekeyan Chandrasekaran; Hsien-Chih Chang; Naonori Kakimura; Alexandra Kolla (Discret. Optim., 2020)

Improving the integrality gap for multiway cut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Vivek Madan (Math. Program., 2020)

A tight $ sqrt{2}$-approximation for linear 3-cut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Vivek Madan (Math. Program., 2020)

Odd Multiway Cut in Directed Acyclic Graphs. - Karthekeyan Chandrasekaran; Matthias Mnich; Sahand Mozaffari (SIAM J. Discret. Math., 2020)

The Maximum Binary Tree Problem. - Karthekeyan Chandrasekaran; Elena Grigorescu; Gabriel Istrate; Shubhang Kulkarni; Young-San Lin; Minshen Zhu (Algorithmica, 2021)

Hypergraph k-cut in randomized polynomial time. - Karthekeyan Chandrasekaran; Chao Xu 002; Xilin Yu (Math. Program., 2021)

Improving the Smoothed Complexity of FLIP for Max Cut Problems. - Ali Bibak; Charles Carlson 002; Karthekeyan Chandrasekaran (ACM Trans. Algorithms, 2021)

Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. - Calvin Beideman; Karthekeyan Chandrasekaran; Chandra Chekuri; Chao Xu 002 (FSTTCS, 2022)

Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. - Calvin Beideman; Karthekeyan Chandrasekaran; Weihang Wang 002 (ICALP, 2022)

Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. - Calvin Beideman; Karthekeyan Chandrasekaran; Sagnik Mukhopadhyay; Danupon Nanongkai (IPCO, 2022)

Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k. - Calvin Beideman; Karthekeyan Chandrasekaran; Weihang Wang 002 (SODA, 2022)

ℓ p-Norm Multiway Cut. - Karthekeyan Chandrasekaran; Weihang Wang 002 (Algorithmica, 2022)

Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time. - Karthekeyan Chandrasekaran; Chandra Chekuri (Math. Oper. Res., 2022)

Approximate minimum cuts and their enumeration. - Calvin Beideman; Karthekeyan Chandrasekaran; Weihang Wang 002 (SOSA, 2023)

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set. - Karthekeyan Chandrasekaran; Chandra Chekuri; Samuel Fiorini; Shubhang Kulkarni; Stefan Weltge (CoRR, 2023)

Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Shubhang Kulkarni (CoRR, 2023)

Analyzing Residual Random Greedy for monotone submodular maximization. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Aditya Pillai (Inf. Process. Lett., 2023)

Multicriteria cuts and size-constrained k-cuts in hypergraphs. - Calvin Beideman; Karthekeyan Chandrasekaran; Chao Xu 002 (Math. Program., 2023)

Fixed parameter approximation scheme for min-max k-cut. - Karthekeyan Chandrasekaran; Weihang Wang 002 (Math. Program., 2023)

Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions. - Karthekeyan Chandrasekaran; Chandra Chekuri (Comb., 2023)

On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. - Karthekeyan Chandrasekaran; Chandra Chekuri; Manuel R. Torres; Weihao Zhu (APPROX/RANDOM, 2024)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Shubhang Kulkarni (ESA, 2024)

Splitting-Off in Hypergraphs. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Shubhang Kulkarni (ICALP, 2024)

Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. - Calvin Beideman; Karthekeyan Chandrasekaran; Weihang Wang 002 (Math. Oper. Res., 2024)

Approximating Submodular ({k} )-Partition via Principal Partition Sequence. - Karthekeyan Chandrasekaran; Weihang Wang 002 (SIAM J. Discret. Math., 2024)

Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. - Calvin Beideman; Karthekeyan Chandrasekaran; Weihang Wang 002 (Math. Program., 2024)

On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions. - Karthekeyan Chandrasekaran; Chandra Chekuri; Shubhang Kulkarni (ICALP, 2025)

Online Disjoint Spanning Trees and Polymatroid Bases. - Karthekeyan Chandrasekaran; Chandra Chekuri; Weihao Zhu (ICALP, 2025)

Scarf's Algorithm on Arborescence Hypergraphs. - Karthekeyan Chandrasekaran; Yuri Faenza; Chengyue He; Jay Sethuraman (ICALP, 2025)

Minimum Cost Nowhere-Zero Flows and Cut-Balanced Orientations. - Karthekeyan Chandrasekaran; Siyue Liu; R. Ravi 001 (ICALP, 2025)

Monotone Submodular Multiway Partition. - Richard Bi; Karthekeyan Chandrasekaran; Soham Joshi (IPCO, 2025)

Approximating Submodular Matroid-Constrained Partitioning. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Daniel P. Szabo (CoRR, 2025)