1: Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection
2: Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems
3: Playing Mastermind With Constant-Size Memory
4: On the Power of Adaptivity in Sparse Recovery
5: The General Traveling Salesman Problem, Version 5
6: The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth
7: Traffic-Redundancy Aware Network Design
8: Min-Max Graph Partitioning and Small Set Expansion
9: Taking Roots over High Extensions of Finite Fields
10: (1+eps)-approximate Sparse Recovery
11: Improved Upper Bounds for Pairing Heaps
12: Effective Stiffness: Generalizing Effective Resistance Sampling to Finite Element Matrices
13: Hierarchical information clustering by means of topologically embedded graphs
14: Improved Grammar-Based Compressed Indexes
15: Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full)
16: On the homotopy test on surfaces
17: Improving Christofides’ Algorithm for the s-t Path TSP
18: Efficient Synchronization Primitives for GPUs
19: Finding small separators in linear time via treewidth reduction