189
click to vote
STOC
16 years 18 days 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...
STOC
16 years 18 days ago
2010 ACM 148
click to vote
STOC
15 years 8 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...
112
Voted
STOC
16 years 18 days ago
2010 ACM 126
click to vote
STOC
16 years 18 days 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