K. Chandrasekaran

activity

20092026

most citedThe Cutting Plane Method is Polynomial for Perfect Matchings

7 citations · 29 across the 31 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

cs.DS2021★ 1 cited

Deterministic enumeration of all minimum cut-sets and $k$ -cut-sets in hypergraphs for fixed $k$

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We consider the problem of deterministically enumerating all minimum $k$ -cut-sets in a given hypergraph for any fixed $k$ . The input here is a hypergraph $G = (V, E)$ with non-nega…

cs.DS2021

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree

Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate +3

A heapable sequence is a sequence of numbers that can be arranged in a "min-heap data structure". Finding a longest heapable subsequence of a given sequence was proposed by Byers,…

cs.DS2021

$ℓ_{p}$ -norm Multiway Cut

Karthekeyan Chandrasekaran, Weihang Wang

We introduce and study $ℓ_{p}$ -norm-multiway-cut: the input here is an undirected graph with non-negative edge weights along with $k$ terminals and the goal is to find a partition…

Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree

ℓp​-norm Multiway Cut

Deterministic enumeration of all minimum cut-sets and $k$ -cut-sets in hypergraphs for fixed $k$

$ℓ_{p}$ -norm Multiway Cut