Search Results for author:
Found 2 papers, 0 papers with code
Gerrymandering Planar Graphs
This motivates the study of approximation algorithms for gerrymandering planar graphs.
Differential Privacy for Clustering Under Continual Observation
We consider the problem of clustering privately a dataset in $\mathbb{R}^d$ that undergoes both insertion and deletion of points.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
