17 citations · 18 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Exact recovery algorithm for Planted Bipartite Graph in Semi-random Graphs
Akash Kumar, Anand Louis, Rameesh Paul
The problem of finding the largest induced balanced bipartite subgraph in a given graph is NP-hard. This problem is closely related to the problem of finding the smallest Odd Cycle…
cs.DS2020
Deletion to Induced Matching
Akash Kumar, Mithilesh Kumar
In the DELETION TO INDUCED MATCHING problem, we are given a graph on vertices, edges and a non-negative integer and asks whether there exists a set of vertices $S \…