1: Approximation Algorithms for the Highway Problem under the Coupon Model
2: Algorithms for Generating Convex Sets in Acyclic Digraphs
3: An Approximation Ratio for Biclustering
4: Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
5: On the approximability of the vertex cover and related problems
6: A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
7: Compressed Text Indexes:From Theory to Practice!
8: A Partition-Based Relaxation For Steiner Trees