Karthekeyan Chandrasekaran

University of Illinois Urbana-Champaign — United States

Computer Science · Physical Sciences

9h-index306citations95works0.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(63), Advanced Graph Theory Research(55), Optimization and Search Problems(16), Computational Geometry and Mesh Generation(14), Cryptography and Data Security(12)

Publications95 total

Splitting-off in hypergraphs
Journal of Combinatorial Theory Series B·2025Open Access
Approximating Submodular Matroid-Constrained Partitioning
arXiv (Cornell University)·2025Open Access
Polyhedral aspects of feedback vertex set and pseudoforest deletion set
Mathematical Programming·2025· 1 cited
On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
ArXiv.org·2025Open Access
Monotone Submodular Multiway Partition
Lecture notes in computer science·2025
Approximating Submodular Matroid-Constrained Partitioning
SSRN Electronic Journal·2025Open Access
Online Disjoint Spanning Trees and Polymatroid Bases
arXiv (Cornell University)·2025Open Access
Approximating Submodular \({k}\)-Partition via Principal Partition Sequence
SIAM Journal on Discrete Mathematics·2024· 1 cited
Scarf's Algorithm on Arborescence Hypergraphs
arXiv (Cornell University)·2024Open Access
Monotone Submodular Multiway Partition
arXiv (Cornell University)·2024Open Access
Hypergraph Connectivity Augmentation in Strongly Polynomial Time
arXiv (Cornell University)·2024Open Access
Counting and Enumerating Optimum Cut Sets for Hypergraph <i>k</i>-Partitioning Problems for Fixed <i>k</i>
Mathematics of Operations Research·2023· 1 cited
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
Mathematical Programming·2023
Splitting-Off in Hypergraphs
arXiv (Cornell University)·2023Open Access
Min–Max Partitioning of Hypergraphs and Symmetric Submodular Functions
COMBINATORICA·2023· 1 cited
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
arXiv (Cornell University)·2023Open Access
Approximate minimum cuts and their enumeration
Society for Industrial and Applied Mathematics eBooks·2023
Approximating Submodular k-Partition via Principal Partition Sequence
arXiv (Cornell University)·2023Open Access
Approximate minimum cuts and their enumeration
arXiv (Cornell University)·2022Open Access
Analyzing Residual Random Greedy for monotone submodular maximization
Information Processing Letters·2022
page 1 of 5Next →

Frequent Co-authors

Santosh Vempala(10), Chao Xu(5), Chandra Chekuri(5), Calvin Beideman(4), Navin Goyal(3), Bernhard Haeupler(3), Jochen Könemann(3), Britta Peis(3), László A. Végh(3), Daniel Dadush(3), Charles Carlson(3), Ameya Velingker(3), Elena Grigorescu(3), Kristóf Bérczi(3), Tamás Király(3), Euiwoong Lee(3), Weihang Wang(3), Justin Thaler(2), Jonathan Ullman(2), Andrew Wan(2)