179
click to vote
STOC
15 years 11 months ago
2010 ACM 
We ask the question ? how can websites and data aggregators continually release updated statistics, and meanwhile preserve each individual user's privacy? We propose a differ...
69
Voted
STOC
15 years 11 months ago
2010 ACM 133
click to vote
STOC
15 years 7 months ago
2010 ACM 
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
105
Voted
STOC
15 years 11 months ago
2010 ACM 113
Voted
STOC
15 years 11 months ago
2010 ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
|
Algorithms