default search action
Karthekeyan Chandrasekaran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j22]Calvin Beideman, Karthekeyan Chandrasekaran
, Weihang Wang:
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. Math. Program. 207(1): 329-367 (2024) - [c36]Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel R. Torres, Weihao Zhu:
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. APPROX/RANDOM 2024: 9:1-9:21 - [c35]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. ESA 2024: 22:1-22:19 - [c34]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Splitting-Off in Hypergraphs. ICALP 2024: 23:1-23:20 - [i34]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. CoRR abs/2402.10861 (2024) - 2023
- [j21]Karthekeyan Chandrasekaran, Chandra Chekuri:
Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions. Comb. 43(3): 455-477 (2023) - [j20]Kristóf Bérczi, Karthekeyan Chandrasekaran
Analyzing Residual Random Greedy for monotone submodular maximization. Inf. Process. Lett. 180: 106340 (2023) - [j19]Calvin Beideman
Multicriteria cuts and size-constrained k-cuts in hypergraphs. Math. Program. 197(1): 27-69 (2023) - [j18]Karthekeyan Chandrasekaran, Weihang Wang
Fixed parameter approximation scheme for min-max k-cut. Math. Program. 197(2): 1093-1144 (2023) - [c33]Karthekeyan Chandrasekaran, Weihang Wang:
Approximating Submodular k-Partition via Principal Partition Sequence. APPROX/RANDOM 2023: 3:1-3:16 - [c32]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Approximate minimum cuts and their enumeration. SOSA 2023: 36-41 - [i33]Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge:
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set. CoRR abs/2303.12850 (2023) - [i32]Karthekeyan Chandrasekaran, Weihang Wang:
Approximating submodular k-partition via principal partition sequence. CoRR abs/2305.01069 (2023) - [i31]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 abs/2307.08555 (2023) - 2022
- [j17]Karthekeyan Chandrasekaran, Weihang Wang
ℓ p-Norm Multiway Cut. Algorithmica 84(9): 2667-2701 (2022) - [j16]Karthekeyan Chandrasekaran
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time. Math. Oper. Res. 47(4): 3380-3399 (2022) - [c31]Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu:
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS 2022: 6:1-6:18 - [c30]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. ICALP 2022: 16:1-16:18 - [c29]Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay
Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. IPCO 2022: 70-83 - [c28]Calvin Beideman
Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k. SODA 2022: 2208-2228 - [i30]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k. CoRR abs/2204.09178 (2022) - [i29]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Approximate minimum cuts and their enumeration. CoRR abs/2211.16747 (2022) - 2021
- [j15]Karthekeyan Chandrasekaran
The Maximum Binary Tree Problem. Algorithmica 83(8): 2427-2468 (2021) - [j14]Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu
Hypergraph k-cut in randomized polynomial time. Math. Program. 186(1): 85-113 (2021) - [j13]Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran:
Improving the Smoothed Complexity of FLIP for Max Cut Problems. ACM Trans. Algorithms 17(3): 19:1-19:38 (2021) - [c27]Karthekeyan Chandrasekaran, Weihang Wang:
ℓp-Norm Multiway Cut. ESA 2021: 29:1-29:15 - [c26]Karthekeyan Chandrasekaran, Weihang Wang:
Fixed Parameter Approximation Scheme for Min-Max k-Cut. IPCO 2021: 354-367 - [c25]Karthekeyan Chandrasekaran, Chandra Chekuri:
Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. SODA 2021: 1026-1038 - [i28]Karthekeyan Chandrasekaran, Weihang Wang:
𝓁p-norm Multiway Cut. CoRR abs/2106.14840 (2021) - [i27]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 abs/2110.00495 (2021) - [i26]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. CoRR abs/2110.14815 (2021) - 2020
- [j12]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla:
Spectral aspects of symmetric matrix signings. Discret. Optim. 37: 100582 (2020) - [j11]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the integrality gap for multiway cut. Math. Program. 183(1): 171-193 (2020) - [j10]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): 411-443 (2020) - [j9]Karthekeyan Chandrasekaran, Matthias Mnich
Odd Multiway Cut in Directed Acyclic Graphs. SIAM J. Discret. Math. 34(2): 1385-1408 (2020) - [c24]Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu:
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. APPROX-RANDOM 2020: 17:1-17:21 - [c23]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. ESA 2020: 30:1-30:22 - [c22]Karthekeyan Chandrasekaran, Chandra Chekuri:
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. FOCS 2020: 810-821 - [c21]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: 7:1-7:16 - [i25]Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu:
Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs. CoRR abs/2006.11589 (2020) - [i24]Karthekeyan Chandrasekaran, Chandra Chekuri:
Hypergraph k-cut for fixed k in deterministic polynomial time. CoRR abs/2009.12442 (2020) - [i23]Karthekeyan Chandrasekaran, Weihang Wang:
Fixed Parameter Approximation Scheme for Min-max k-cut. CoRR abs/2011.03454 (2020) - [i22]Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai:
Faster connectivity in low-rank hypergraphs via expander decomposition. CoRR abs/2011.08097 (2020)
2010 – 2019
- 2019
- [j8]Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann
Additive stabilizers for unstable graphs. Discret. Optim. 31: 56-78 (2019) - [j7]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee
Beating the 2-approximation factor for global bicut. Math. Program. 177(1-2): 291-320 (2019) - [j6]Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan:
On the Expansion of Group-Based Lifts. SIAM J. Discret. Math. 33(3): 1338-1373 (2019) - [c20]Kristóf Bérczi
Improving the Integrality Gap for Multiway Cut. IPCO 2019: 115-127 - [c19]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla:
Spectral Aspects of Symmetric Matrix Signings. MFCS 2019: 81:1-81:13 - [c18]Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran:
Improving the smoothed complexity of FLIP for max cut problems. SODA 2019: 897-916 - [i21]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. CoRR abs/1909.07915 (2019) - 2018
- [j5]Karthekeyan Chandrasekaran, Mahdi Cheraghchi
Local Testing of Lattices. SIAM J. Discret. Math. 32(2): 1265-1295 (2018) - [c17]Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota
Lattice-based Locality Sensitive Hashing is Optimal. ITCS 2018: 42:1-42:18 - [c16]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
A tight -approximation for Linear 3-Cut. SODA 2018: 1393-1406 - [c15]Karthekeyan Chandrasekaran, Chao Xu
Hypergraph k-Cut in Randomized Polynomial Time. SODA 2018: 1426-1438 - [i20]Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran:
Improving the smoothed complexity of FLIP for max cut problems. CoRR abs/1807.05665 (2018) - [i19]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the Integrality Gap for Multiway Cut. CoRR abs/1807.09735 (2018) - 2017
- [j4]Karthekeyan Chandrasekaran, Venkata Gandikota
Deciding Orthogonality in Construction-A Lattices. SIAM J. Discret. Math. 31(2): 1244-1262 (2017) - [c14]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM 2017: 2:1-2:20 - [c13]Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan:
On the Expansion of Group-Based Lifts. APPROX-RANDOM 2017: 24:1-24:13 - [c12]Karthekeyan Chandrasekaran, Sahand Mozaffari:
Odd Multiway Cut in Directed Acyclic Graphs. IPEC 2017: 12:1-12:12 - [i18]Karthekeyan Chandrasekaran, Matthias Mnich
Odd Multiway Cut in Directed Acyclic Graphs. CoRR abs/1708.02323 (2017) - [i17]Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu:
Lattice-based Locality Sensitive Hashing is Optimal. CoRR abs/1712.08558 (2017) - 2016
- [j3]Karthekeyan Chandrasekaran, László A. Végh
The Cutting Plane Method is Polynomial for Perfect Matchings. Math. Oper. Res. 41(1): 23-48 (2016) - [c11]Karthekeyan Chandrasekaran, Mahdi Cheraghchi
Local Testing for Membership in Lattices. FSTTCS 2016: 46:1-46:14 - [i16]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. CoRR abs/1608.00180 (2016) - [i15]Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz:
Additive Stabilizers for Unstable Graphs. CoRR abs/1608.06797 (2016) - [i14]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Alexandra Kolla:
Largest Eigenvalue and Invertibility of Symmetric Matrix Signings. CoRR abs/1611.03624 (2016) - [i13]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and fixed-terminal cuts in digraphs. CoRR abs/1612.00156 (2016) - [i12]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j2]Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità:
Finding small stabilizers for unstable graphs. Math. Program. 154(1-2): 173-196 (2015) - [c10]Karthekeyan Chandrasekaran, Venkata Gandikota
Deciding Orthogonality in Construction-A Lattices. FSTTCS 2015: 151-162 - [i11]Karthekeyan Chandrasekaran, Ameya Velingker:
Constructing Ramanujan Graphs Using Shift Lifts. CoRR abs/1502.07410 (2015) - [i10]Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu:
Deciding Orthogonality in Construction-A Lattices. CoRR abs/1512.02734 (2015) - 2014
- [c9]Karthekeyan Chandrasekaran, Richard M. Karp:
Finding a most biased coin with fewest flips. COLT 2014: 394-407 - [c8]Karthekeyan Chandrasekaran, Justin Thaler, Jonathan R. Ullman, Andrew Wan:
Faster private release of marginals on small databases. ITCS 2014: 387-402 - [c7]Karthekeyan Chandrasekaran, Santosh S. Vempala:
Integer feasibility of random polytopes: random integer programs. ITCS 2014: 449-458 - [c6]Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità:
Finding Small Stabilizers for Unstable Graphs. IPCO 2014: 150-161 - 2013
- [j1]Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
Deterministic Algorithms for the Lovász Local Lemma. SIAM J. Comput. 42(6): 2132-2155 (2013) - [i9]Karthekeyan Chandrasekaran, Justin Thaler, Jonathan R. Ullman, Andrew Wan:
Faster Private Release of Marginals on Small Databases. CoRR abs/1304.3754 (2013) - 2012
- [b1]Karthekeyan Chandrasekaran:
New approaches to integer programming. Georgia Institute of Technology, Atlanta, GA, USA, 2012 - [c5]Karthekeyan Chandrasekaran, László A. Végh
The Cutting Plane Method Is Polynomial for Perfect Matchings. FOCS 2012: 571-580 - [i8]Karthekeyan Chandrasekaran, Richard M. Karp:
Finding the most biased coin with fewest flips. CoRR abs/1202.3639 (2012) - [i7]Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala:
The Cutting Plane Method is Polynomial for Perfect Matchings. CoRR abs/1207.5813 (2012) - 2011
- [c4]Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno
Algorithms for Implicit Hitting Set Problems. SODA 2011: 614-629 - [i6]Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno, Santosh S. Vempala:
Algorithms for Implicit Hitting Set Problems. CoRR abs/1102.1472 (2011) - [i5]Karthekeyan Chandrasekaran, Santosh S. Vempala:
A Discrepancy based Approach to Integer Programming. CoRR abs/1111.4649 (2011) - 2010
- [c3]Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
Deterministic Algorithms for the Lovász Local Lemma. SODA 2010: 992-1004 - [c2]Karthekeyan Chandrasekaran, Daniel Dadush
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. SODA 2010: 1630-1645 - [i4]Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler:
Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections. CoRR abs/1006.3030 (2010)
2000 – 2009
- 2009
- [c1]Karthekeyan Chandrasekaran, Amit Deshpande, Santosh S. Vempala:
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry. APPROX-RANDOM 2009: 420-433 - [i3]Karthekeyan Chandrasekaran, Daniel Dadush, Santosh S. Vempala:
Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families. CoRR abs/0904.0583 (2009) - [i2]Karthekeyan Chandrasekaran, Amit Deshpande, Santosh S. Vempala:
The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions. CoRR abs/0906.2448 (2009) - [i1]Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler:
Deterministic Algorithms for the Lovasz Local Lemma. CoRR abs/0908.0375 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-05 21:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: