7 citations · 29 across the 31 of their papers we have counts for
4 papers · 1 filter
Splitting-off in Hypergraphs
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király +1
The splitting-off operation in undirected graphs is a fundamental reduction operation that detaches all edges incident to a given vertex and adds new edges between the neighbors of…
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms
Chandra Chekuri, Manuel R. Torres
Dense subgraph discovery is an important problem in graph mining and network analysis with several applications. Two canonical problems here are to find a maxcore (subgraph of maxi…
Approximating submodular -partition via principal partition sequence
Karthekeyan Chandrasekaran, Weihang Wang
In submodular -partition, the input is a non-negative submodular function defined over a finite ground set (given by an evaluation oracle) along with a positive integer…
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini +2
We consider the feedback vertex set problem in undirected graphs (FVS). The input to FVS is an undirected graph with non-negative vertex costs. The goal is to find a mini…