Karthekeyan Chandrasekaran
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
28
Venues
7
Active years
2010–2026
Best venue rank
A*
Where they publish
Papers
28 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | IPCO | s,t-Separating Principal Partition Sequence of Submodular Functions. | Kristf Brczi, Karthekeyan Chandrasekaran, Tams Kirly, Daniel P. Szabo |
| 2026 | IPCO | Hedgegraph Polymatroids. | Karthekeyan Chandrasekaran, Chandra Chekuri, Weihang Wang, Weihao Zhu |
| 2025 | ICALP | On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions. | Karthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni |
| 2025 | ICALP | Online Disjoint Spanning Trees and Polymatroid Bases. | Karthekeyan Chandrasekaran, Chandra Chekuri, Weihao Zhu |
| 2025 | ICALP | Scarf's Algorithm on Arborescence Hypergraphs. | Karthekeyan Chandrasekaran, Yuri Faenza, Chengyue He, Jay Sethuraman |
| 2025 | ICALP | Minimum Cost Nowhere-Zero Flows and Cut-Balanced Orientations. | Karthekeyan Chandrasekaran, Siyue Liu, R. Ravi |
| 2025 | IPCO | Monotone Submodular Multiway Partition. | Richard Bi, Karthekeyan Chandrasekaran, Soham Joshi |
| 2024 | ESA | Hypergraph Connectivity Augmentation in Strongly Polynomial Time. | Kristf Brczi, Karthekeyan Chandrasekaran, Tams Kirly, Shubhang Kulkarni |
| 2024 | ICALP | Splitting-Off in Hypergraphs. | Kristf Brczi, Karthekeyan Chandrasekaran, Tams Kirly, Shubhang Kulkarni |
| 2022 | ICALP | Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. | Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang |
| 2022 | IPCO | Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. | Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2022 | SODA | Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k. | Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang |
| 2021 | ESA | ℓ | Karthekeyan Chandrasekaran, Weihang Wang |
| 2021 | IPCO | Fixed Parameter Approximation Scheme for Min-Max k-Cut. | Karthekeyan Chandrasekaran, Weihang Wang |
| 2021 | SODA | Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. | Karthekeyan Chandrasekaran, Chandra Chekuri |
| 2020 | ESA | The Maximum Binary Tree Problem. | Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu |
| 2020 | FOCS | Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. | Karthekeyan Chandrasekaran, Chandra Chekuri |
| 2019 | IPCO | Improving the Integrality Gap for Multiway Cut. | Kristf Brczi, Karthekeyan Chandrasekaran, Tams Kirly, Vivek Madan |
| 2019 | MFCS | Spectral Aspects of Symmetric Matrix Signings. | Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla |
| 2019 | SODA | Improving the smoothed complexity of FLIP for max cut problems. | Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran |
| 2018 | SODA | A tight -approximation for Linear 3-Cut. | Kristf Brczi, Karthekeyan Chandrasekaran, Tams Kirly, Vivek Madan |
| 2018 | SODA | Hypergraph | Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu |
| 2014 | COLT | Finding a most biased coin with fewest flips. | Karthekeyan Chandrasekaran, Richard M. Karp |
| 2014 | IPCO | Finding Small Stabilizers for Unstable Graphs. | Adrian Bock, Karthekeyan Chandrasekaran, Jochen Knemann, Britta Peis, Laura Sanit |
| 2012 | FOCS | The Cutting Plane Method Is Polynomial for Perfect Matchings. | Karthekeyan Chandrasekaran, Lszl A. Vgh, Santosh S. Vempala |
| 2011 | SODA | Algorithms for Implicit Hitting Set Problems. | Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno, Santosh S. Vempala |
| 2010 | SODA | Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. | Karthekeyan Chandrasekaran, Daniel Dadush, Santosh S. Vempala |
| 2010 | SODA | Deterministic Algorithms for the Lovsz Local Lemma. | Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler |