3 citations · 4 across the 11 of their papers we have counts for
3 papers · 1 filter
Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
Vladimir Braverman, Prathamesh Dharangutte, Shreyas Pai +2
We study the dynamic correlation clustering problem with edge label flips. In correlation clustering, we are given a -vertex complete graph whose edges are l…
Learning-augmented Maximum Independent Set
Vladimir Braverman, Prathamesh Dharangutte, Vihan Shah +1
We study the Maximum Independent Set (MIS) problem on general graphs within the framework of learning-augmented algorithms. The MIS problem is known to be NP-hard and is also NP-ha…
Differentially Private Range Queries with Correlated Input Perturbation
Prathamesh Dharangutte, Jie Gao, Ruobin Gong +1
This work proposes a class of differentially private mechanisms for linear queries, in particular range queries, that leverages correlated input perturbation to simultaneously achi…