11 citations · 21 across the 13 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
On fully dynamic constant-factor approximation algorithms for clustering problems
Hendrik Fichtenberger, Monika Henzinger, Andreas Wiese
Clustering is an important task with applications in many fields of computer science. We study the fully dynamic setting in which we want to maintain good clusters efficiently when…
cs.DS2021
Differentially Private Algorithms for Graphs Under Continual Observation
Hendrik Fichtenberger, Monika Henzinger, Lara Ost
Differentially private algorithms protect individuals in data analysis scenarios by ensuring that there is only a weak correlation between the existence of the user in the data and…