1: Improved Distance Oracles and Spanners for Vertex-Labeled Graphs
2: Angle-Restricted Steiner Arborescences for Flow Map Layout
3: Max-Throughput for (Conservative) k-of-n Testing
4: Packing-Based Approximation Algorithm for the k-Set Cover Problem
5: Approximation Algorithms for Variable-Sized and Generalized Bin Covering
6: Fast approximation of matrix coherence and statistical leverage
7: A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
8: Concave Generalized Flows with Applications to Market Equilibria
9: A linear-time algorithm for the strong chromatic index of Halin graphs
10: A Faster Grammar-Based Self-Index
11: Clustering of Mobile Ad Hoc Networks: An Adaptive Broadcast Period Approach
12: Tying up the loose ends in fully LZW-compressed pattern matching
13: Algorithms for Constructing Overlay Networks For Live Streaming
14: Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution
15: A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query