Papers
On the complexity of Compact Set r-Packing. (to appear) WALCOM’ 23.
Clustering with Fair-Center Representation: Parameterized Approximation Algorithms and Heuristics. KDD’22.
with Suhas Thejaswi, Bruno Ordozgoiti, and Michal Osadnik.
Improved learning of k-parities. (invited)TCS’20, COCOON’18.
with Arnab Bhattacharyya, and Ninad Rajgopal.
On the hardness of learning sparse parities. ESA’16.
with Arnab Bhattacharyya, Suprovat Ghoshal, and, Rishi Saket.