5 citations · 6 across the 7 of their papers we have counts for
8 papers
Scalable K-clique Estimation with Differential Privacy
Dung Nguyen, Ritwick Mishra, Anil Vullikanti
Counts of -cliques are commonly used metrics in subgraph mining. Since graphs often have sensitive data, there also has been a lot of work on -clique counts with differential…
Improving Epidemic Analyses with Privacy-Preserving Integration of Sensitive Data
Zihan Guan, Zhiyuan Zhao, Fengwei Tian +5
Epidemic analyses increasingly rely on heterogeneous datasets, many of which are sensitive and require strong privacy protection. Although differential privacy (DP) has become a st…
Controlling the Spread of Epidemics on Networks with Differential Privacy
Dung Nguyen, Aravind Srinivasan, Renata Valieva +2
Designing effective strategies for controlling epidemic spread by vaccination is an important question in epidemiology, especially in the early stages when vaccines are limited. Th…
Differentially private exact recovery for stochastic block models
Dung Nguyen, Anil Vullikanti
Stochastic block models (SBMs) are a very commonly studied network model for community detection algorithms. In the standard form of an SBM, the vertices (or nodes) of a graph…
Contrastive Explainable Clustering with Differential Privacy
Dung Nguyen, Ariel Vetzler, Sarit Kraus +1
This paper presents a novel approach to Explainable AI (XAI) that combines contrastive explanations with differential privacy for clustering algorithms. Focusing on k-median and k-…
Differentially Private Partial Set Cover with Applications to Facility Location
George Z. Li, Dung Nguyen, Anil Vullikanti
It was observed in \citet{gupta2009differentially} that the Set Cover problem has strong impossibility results under differential privacy. In our work, we observe that these hardne…
Differentially Private Community Detection for Stochastic Block Models
Mohamed Seif, Dung Nguyen, Anil Vullikanti +1
The goal of community detection over graphs is to recover underlying labels/attributes of users (e.g., political affiliation) given the connectivity between users (represented by a…
Differentially Private Densest Subgraph Detection
Dung Nguyen, Anil Vullikanti
Densest subgraph detection is a fundamental graph mining problem, with a large number of applications. There has been a lot of work on efficient algorithms for finding the densest…