1: The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
2: The Network Improvement Problem for Equilibrium Routing
3: A simple approximation algorithm for the internal Steiner minimum tree
4: Bicriteria data compression
5: Idempotent permutations
6: Approximating Minimum Cost Connectivity Orientation and Augmentation
7: A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
8: Complexity and Approximation of the Continuous Network Design Problem
9: Polynomial time approximation schemes for the traveling repairman and other minimum latency problems
10: A polynomial projection-type algorithm for linear programming
11: Computing Similarity Distances Between Rankings
12: Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs
13: Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints
14: On the Complexity of a Matching Problem with Asymmetric Weights
15: Approximating the minimum cycle mean
16: Ranking with Diverse Intents and Correlated Contents
17: Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
18: Complete Solutions for a Combinatorial Puzzle in Linear Time
19: Linear-Time FPT Algorithms via Network Flow
20: Polynomiality for Bin Packing with a Constant Number of Item Types
21: Optimally Approximating the Coverage Lifetime of Wireless Sensor Networks
22: Jamming-Resistant Learning in Wireless Networks
23: First-Come-First-Served for Online Slot Allocation and Huffman Coding
24: Polymatroid Prophet Inequalities
25: Optimal Recombination in Genetic Algorithms