1: Heapable Sequences and Subsequences
2: Schnyder decompositions for regular plane graphs and application to drawing
3: Ranking with Submodular Valuations
4: Sublinear Time Motif Discovery from Multiple Sequences
5: XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme
6: Greedy algorithm for stochastic matching is a 2-approximation
7: Enhanced Random Walk with Choice: An Empirical Study
8: Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs
9: Approximate Nearest Neighbor Search for Low Dimensional Queries
10: Searching in Dynamic Catalogs on a Tree
11: Efficient Submodular Function Maximization under Linear Packing Constraints
12: LP-rounding algorithms for facility-location problems