◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Dung Nguyen

8 papers hereh-index 586 citations12 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author5
  • middle author3

Across the 8 of 8 papers where every author was matched, so the position is known.

fields
  • cs.DS4
  • cs.LG2
  • cs.CR1
  • cs.SI1
same name
  • Dung Nguyen — 8 papers, h 2
  • Dung Nguyen — 7 papers, h 7
  • Dung Nguyen — 4 papers, h 2
  • Dung Nguyen — 3 papers, h 3
  • Dung Nguyen — 2 papers, h 2
  • Dung Nguyen — 2 papers, h 0

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20212026
most citedDifferentially Private Community Detection for Stochastic Block Models

5 citations · 6 across the 7 of their papers we have counts for

collaborators
Showing cs.DSShow all

4 papers · 1 filter

cs.DS2026

Scalable K-clique Estimation with Differential Privacy

Dung Nguyen, Ritwick Mishra, Anil Vullikanti

Counts of k-cliques are commonly used metrics in subgraph mining. Since graphs often have sensitive data, there also has been a lot of work on k-clique counts with differential…

cs.DS2025

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…

cs.DS2022

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…

cs.DS2021

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.