activity
20202026
most citedMetric Clustering and MST with Strong and Weak Distance Oracles

3 citations · 4 across the 11 of their papers we have counts for

collaborators
Showing 2026Show all

2 papers · 1 filter

cs.DS2026

Packing Compact Subgraphs with Applications to Districting

Ho-Lin Chen, Po-Yu Chou, Prathamesh Dharangutte +3

Packing disjoint subgraphs in a given graph is a fundamental problem with many applications. Motivated by political districting, we focus on connected subgraphs that are compact (e…

cs.DS2026

The Price of Privacy For Approximating Max-CSP

Prathamesh Dharangutte, Jingcheng Liu, Pasin Manurangsi +3

We study approximation algorithms for Maximum Constraint Satisfaction Problems (Max-CSPs) under differential privacy (DP) where the constraints are considered sensitive data. Infor…