1: Faster range minimum queries
2: Active Betweenness Cardinality: Algorithms and Applications
3: Online Knapsack Problem under Expected Capacity Constraint
4: Cost-Effective Seed Selection in Online Social Networks
5: On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint
6: Local Access to Huge Random Objects through Partial Sampling
7: The Complexity of Maximum $k$-Order Bounded Component Set Problem
8: Near-optimal irrevocable sample selection for periodic data streams with applications to marine robotics
9: A Cooperative Proof of Work Scheme for Distributed Consensus Protocols
10: Submodular Maximization through the Lens of Linear Programming
11: A limit field for orthogonal range searches in two-dimensional random point search trees
12: Two-sided Facility Location