Karthekeyan Chandrasekaran

112 papers A* 17A 8B 8Journal 70Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximating submodular matroid-constrained partitioning. Theor. Comput. Sci. Kristóf Bérczi, Tamás Király, Daniel P. Szabo, Karthekeyan Chandrasekaran
2026	J	`jnl`	Splitting-off in hypergraphs. J. Comb. Theory B Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
2025	J	`jnl`	Approximating Submodular Matroid-Constrained Partitioning. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Daniel P. Szabo
2025	J	`jnl`	Hedgegraph Polymatroids. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri, Weihang Wang, Weihao Zhu
2025	J	`jnl`	Hypergraph Splitting-Off via Element-Connectivity Preserving Reductions. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni
2025	A*	`conf`	Minimum Cost Nowhere-Zero Flows and Cut-Balanced Orientations. ICALP Karthekeyan Chandrasekaran, Siyue Liu, R. Ravi
2025	J	`jnl`	Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations. CoRR Karthekeyan Chandrasekaran, Siyue Liu, R. Ravi
2025	B	`conf`	Monotone Submodular Multiway Partition. IPCO Richard Bi, Karthekeyan Chandrasekaran, Soham Joshi
2025	A*	`conf`	On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions. ICALP Karthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni
2025	J	`jnl`	On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni
2025	A*	`conf`	Online Disjoint Spanning Trees and Polymatroid Bases. ICALP Karthekeyan Chandrasekaran, Chandra Chekuri, Weihao Zhu
2025	J	`jnl`	Online Disjoint Spanning Trees and Polymatroid Bases. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri, Weihao Zhu
2025	J	`jnl`	Polyhedral aspects of feedback vertex set and pseudoforest deletion set. Math. Program. Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge
2025	A*	`conf`	Scarf's Algorithm on Arborescence Hypergraphs. ICALP Karthekeyan Chandrasekaran, Yuri Faenza, Chengyue He, Jay Sethuraman
2025	J	`jnl`	{s,t}-Separating Principal Partition Sequence of Submodular Functions. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Daniel P. Szabo
2024	J	`jnl`	Approximating Submodular ${k}$-Partition via Principal Partition Sequence. SIAM J. Discret. Math. Karthekeyan Chandrasekaran, Weihang Wang
2024	J	`jnl`	Counting and Enumerating Optimum Cut Sets for Hypergraph Math. Oper. Res. Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
2024	J	`jnl`	Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. Math. Program. Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
2024	A	`conf`	Hypergraph Connectivity Augmentation in Strongly Polynomial Time. ESA Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
2024	J	`jnl`	Hypergraph Connectivity Augmentation in Strongly Polynomial Time. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
2024	J	`jnl`	Monotone Submodular Multiway Partition. CoRR Richard Bi, Karthekeyan Chandrasekaran, Soham Joshi
2024	A	`conf`	On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. APPROX/RANDOM Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel R. Torres, Weihao Zhu
2024	J	`jnl`	Scarf's Algorithm on Arborescence Hypergraphs. CoRR Karthekeyan Chandrasekaran, Yuri Faenza, Chengyue He, Jay Sethuraman
2024	A*	`conf`	Splitting-Off in Hypergraphs. ICALP Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
2023	J	`jnl`	Analyzing Residual Random Greedy for monotone submodular maximization. Inf. Process. Lett. Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Aditya Pillai
2023	—	`conf`	Approximate minimum cuts and their enumeration. SOSA Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
2023	A	`conf`	Approximating Submodular k-Partition via Principal Partition Sequence. APPROX/RANDOM Karthekeyan Chandrasekaran, Weihang Wang
2023	J	`jnl`	Approximating submodular k-partition via principal partition sequence. CoRR Karthekeyan Chandrasekaran, Weihang Wang
2023	J	`jnl`	Fixed parameter approximation scheme for min-max k-cut. Math. Program. Karthekeyan Chandrasekaran, Weihang Wang
2023	J	`jnl`	Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
2023	J	`jnl`	Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions. Comb. Karthekeyan Chandrasekaran, Chandra Chekuri
2023	J	`jnl`	Multicriteria cuts and size-constrained k-cuts in hypergraphs. Math. Program. Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
2023	J	`jnl`	Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge
2022	—	`conf`	Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu
2022	J	`jnl`	Approximate minimum cuts and their enumeration. CoRR Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
2022	A*	`conf`	Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. ICALP Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
2022	J	`jnl`	Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k. CoRR Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
2022	A*	`conf`	Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k. SODA Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
2022	B	`conf`	Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. IPCO Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai
2022	J	`jnl`	Hypergraph Math. Oper. Res. Karthekeyan Chandrasekaran, Chandra Chekuri
2022	J	`jnl`	ℓ Algorithmica Karthekeyan Chandrasekaran, Weihang Wang
2021	J	`jnl`	Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. CoRR Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
2021	B	`conf`	Fixed Parameter Approximation Scheme for Min-Max k-Cut. IPCO Karthekeyan Chandrasekaran, Weihang Wang
2021	J	`jnl`	Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. CoRR Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
2021	J	`jnl`	Hypergraph k-cut in randomized polynomial time. Math. Program. Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu
2021	J	`jnl`	Improving the Smoothed Complexity of FLIP for Max Cut Problems. ACM Trans. Algorithms Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
2021	A*	`conf`	Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. SODA Karthekeyan Chandrasekaran, Chandra Chekuri
2021	J	`jnl`	The Maximum Binary Tree Problem. Algorithmica Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
2021	A	`conf`	ℓ ESA Karthekeyan Chandrasekaran, Weihang Wang
2021	J	`jnl`	𝓁 CoRR Karthekeyan Chandrasekaran, Weihang Wang
2020	J	`jnl`	A tight $\sqrt{2}$-approximation for linear 3-cut. Math. Program. Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
2020	J	`jnl`	Faster connectivity in low-rank hypergraphs via expander decomposition. CoRR Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai
2020	J	`jnl`	Fixed Parameter Approximation Scheme for Min-max k-cut. CoRR Karthekeyan Chandrasekaran, Weihang Wang
2020	B	`conf`	Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. IPEC Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
2020	A*	`conf`	Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. FOCS Karthekeyan Chandrasekaran, Chandra Chekuri
2020	J	`jnl`	Hypergraph k-cut for fixed k in deterministic polynomial time. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri
2020	J	`jnl`	Improving the integrality gap for multiway cut. Math. Program. Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
2020	J	`jnl`	Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs. CoRR Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
2020	—	`conf`	Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. APPROX-RANDOM Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
2020	J	`jnl`	Odd Multiway Cut in Directed Acyclic Graphs. SIAM J. Discret. Math. Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari
2020	J	`jnl`	Spectral aspects of symmetric matrix signings. Discret. Optim. Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla
2020	A	`conf`	The Maximum Binary Tree Problem. ESA Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
2019	J	`jnl`	Additive stabilizers for unstable graphs. Discret. Optim. Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz
2019	J	`jnl`	Beating the 2-approximation factor for global bicut. Math. Program. Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2019	B	`conf`	Improving the Integrality Gap for Multiway Cut. IPCO Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
2019	A*	`conf`	Improving the smoothed complexity of FLIP for max cut problems. SODA Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
2019	J	`jnl`	On the Expansion of Group-Based Lifts. SIAM J. Discret. Math. Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan
2019	B	`conf`	Spectral Aspects of Symmetric Matrix Signings. MFCS Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla
2019	J	`jnl`	The Maximum Binary Tree Problem. CoRR Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
2018	A*	`conf`	A tight -approximation for Linear 3-Cut. SODA Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
2018	A*	`conf`	Hypergraph SODA Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu
2018	J	`jnl`	Improving the Integrality Gap for Multiway Cut. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
2018	J	`jnl`	Improving the smoothed complexity of FLIP for max cut problems. CoRR Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
2018	A	`conf`	Lattice-based Locality Sensitive Hashing is Optimal. ITCS Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu
2018	J	`jnl`	Local Testing of Lattices. SIAM J. Discret. Math. Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
2017	J	`jnl`	Deciding Orthogonality in Construction-A Lattices. SIAM J. Discret. Math. Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
2017	—	`conf`	Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2017	J	`jnl`	Lattice-based Locality Sensitive Hashing is Optimal. CoRR Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu
2017	B	`conf`	Odd Multiway Cut in Directed Acyclic Graphs. IPEC Karthekeyan Chandrasekaran, Sahand Mozaffari
2017	J	`jnl`	Odd Multiway Cut in Directed Acyclic Graphs. CoRR Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari
2017	—	`conf`	On the Expansion of Group-Based Lifts. APPROX-RANDOM Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan
2016	J	`jnl`	Additive Stabilizers for Unstable Graphs. CoRR Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz
2016	J	`jnl`	Global and fixed-terminal cuts in digraphs. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2016	J	`jnl`	Largest Eigenvalue and Invertibility of Symmetric Matrix Signings. CoRR Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Alexandra Kolla
2016	—	`conf`	Local Testing for Membership in Lattices. FSTTCS Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
2016	J	`jnl`	Local Testing for Membership in Lattices. CoRR Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
2016	J	`jnl`	Local Testing for Membership in Lattices. Electron. Colloquium Comput. Complex. Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu
2016	J	`jnl`	The Cutting Plane Method is Polynomial for Perfect Matchings. Math. Oper. Res. Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
2015	J	`jnl`	Constructing Ramanujan Graphs Using Shift Lifts. CoRR Karthekeyan Chandrasekaran, Ameya Velingker
2015	—	`conf`	Deciding Orthogonality in Construction-A Lattices. FSTTCS Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
2015	J	`jnl`	Deciding Orthogonality in Construction-A Lattices. CoRR Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu
2015	J	`jnl`	Finding small stabilizers for unstable graphs. Math. Program. Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
2014	A	`conf`	Faster private release of marginals on small databases. ITCS Karthekeyan Chandrasekaran, Justin Thaler, Jonathan R. Ullman, Andrew Wan
2014	B	`conf`	Finding Small Stabilizers for Unstable Graphs. IPCO Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
2014	A*	`conf`	Finding a most biased coin with fewest flips. COLT Karthekeyan Chandrasekaran, Richard M. Karp
2014	A	`conf`	Integer feasibility of random polytopes: random integer programs. ITCS Karthekeyan Chandrasekaran, Santosh S. Vempala
2013	J	`jnl`	Deterministic Algorithms for the Lovász Local Lemma. SIAM J. Comput. Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
2013	J	`jnl`	Faster Private Release of Marginals on Small Databases CoRR Karthekeyan Chandrasekaran, Justin Thaler, Jonathan R. Ullman, Andrew Wan
2012	J	`jnl`	Finding the most biased coin with fewest flips CoRR Karthekeyan Chandrasekaran, Richard M. Karp
2012	—	`—`	New approaches to integer programming. Karthekeyan Chandrasekaran
2012	A*	`conf`	The Cutting Plane Method Is Polynomial for Perfect Matchings. FOCS Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
2012	J	`jnl`	The Cutting Plane Method is Polynomial for Perfect Matchings CoRR Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
2011	J	`jnl`	A Discrepancy based Approach to Integer Programming CoRR Karthekeyan Chandrasekaran, Santosh S. Vempala
2011	J	`jnl`	Algorithms for Implicit Hitting Set Problems CoRR Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno, Santosh S. Vempala
2011	A*	`conf`	Algorithms for Implicit Hitting Set Problems. SODA Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno, Santosh S. Vempala
2010	A*	`conf`	Deterministic Algorithms for the Lovász Local Lemma. SODA Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
2010	J	`jnl`	Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections CoRR Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
2010	A*	`conf`	Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. SODA Karthekeyan Chandrasekaran, Daniel Dadush, Santosh S. Vempala
2009	J	`jnl`	Deterministic Algorithms for the Lovasz Local Lemma CoRR Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
2009	—	`conf`	Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry. APPROX-RANDOM Karthekeyan Chandrasekaran, Amit Deshpande, Santosh S. Vempala
2009	J	`jnl`	The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions CoRR Karthekeyan Chandrasekaran, Amit Deshpande, Santosh S. Vempala
2009	J	`jnl`	Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families CoRR Karthekeyan Chandrasekaran, Daniel Dadush, Santosh S. Vempala