Yash Khanna

collaborators

2 papers

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…

cs.DS2020

Planted Models for the Densest $k$ -Subgraph Problem

Yash Khanna, Anand Louis

Given an undirected graph $G$ , the Densest $k$ -subgraph problem (DkS) asks to compute a set $S \subset V$ of cardinality $∣ S ∣ \leq k$ such that the weight of…

Independent Sets in Semi-random Hypergraphs

Planted Models for the Densest k-Subgraph Problem

Planted Models for the Densest $k$ -Subgraph Problem