1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2025
Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
Laxman Dhulipala, Monika Henzinger, George Z. Li +3
Many differentially private and classical non-private graph algorithms rely crucially on determining whether some property of each vertex meets a threshold. For example, for the $k…
cs.DS2024★ 1 cited
Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
Monika Henzinger, A. R. Sricharan, Leqi Zhu
Computing the core decomposition of a graph is a fundamental problem that has recently been studied in the differentially private setting, motivated by practical applications in da…