most citedPolynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs

24 citations · 28 across the 2 of their papers we have counts for

collaborators
Showing 2006Show all

Nothing from them under that filter.

Their other years and fields are still on the left.