1: Submodular approximation: sampling-based algorithms and lower bounds
2: Online Ad Slotting With Cancellations
3: Randomized Work-Competitive Scheduling for Cooperative Computing on $k$-partite Task Graphs
4: Searching for Frequent Colors in Rectangles
5: Approximation Algorithms for Shortest Descending Paths in Terrains
6: A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval
7: A Simple In-Place Algorithm for In-Shuffle
8: NAPX: A Polynomial Time Approximation Scheme for the Noah’s Ark Problem