1: Optimal Euclidean spanners: really short, thin and lanky
2: Tight Cell-Probe Bounds for Online Hamming Distance Computation
3: Stackelberg Shortest Path Tree Game, Revisited
4: SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits
5: I/O-Efficient Dynamic Planar Range Skyline Queries
6: Compression of next-generation sequencing reads aided by highly efficient de novo assembly
7: Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
8: Hitting Sets Online and Unique-Max Coloring
9: On Optimal Top-K String Retrieval
10: A Complete Anytime Algorithm for Treewidth
11: On finding minimal w-cutset
12: PAC-learning bounded tree-width Graphical Models
13: Search Algorithms for Conceptual Graph Databases
14: Positioning Accuracy Improvement via Distributed Location Estimate in Cooperative Vehicular Networks
15: A Time and Space Efficient Algorithm for Contextual Linear Bandits
16: Non-Local Euclidean Medians
17: Reference Point Methods and Approximation in Multicriteria Optimization