2 papers
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.DS2021
Independent Sets in Semi-random Hypergraphs
Yash Khanna, Anand Louis, Rameesh Paul
A set of vertices in a hypergraph is called an independent set if no hyperedge is completely contained inside the set. Given a hypergraph, computing its largest size independent se…