206 citations · 303 across the 29 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 12 cited
Improved Bounds for Online Preemptive Matching
Leah Epstein, Asaf Levin, Danny Segev +1
When designing a preemptive online algorithm for the maximum matching problem, we wish to maintain a valid matching M while edges of the underlying graph are presented one after th…
cs.DS2012★ 1 cited
On Approximating String Selection Problems with Outliers
Christina Boucher, Gad M. Landau, Avivit Levy +2
Many problems in bioinformatics are about finding strings that approximately represent a collection of given strings. We look at more general problems where some input strings can…