6 citations · 8 across the 13 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
Abhishek Dhawan, Nhi U. Dinh, Eren C. Kızıldağ +2
We study the algorithmic tractability of finding large independent sets in dense random hypergraphs. In the sparse regime, much of the natural algorithms can be formulated within e…
cs.DS2025
Sharp Online Hardness for Large Balanced Independent Sets
Abhishek Dhawan, Eren C. Kızıldağ, Neeladri Maitra
We study the algorithmic problem of finding large -balanced independent sets in dense random bipartite graphs; an independent set is -balanced if a proportion of its vert…