1: On the Locality of Some NP-Complete Problems
2: A Singly-Exponential Time Algorithm for Computing Nonnegative Rank
3: Everywhere-Sparse Spanners via Dense Subgraphs
4: Approximating Sparse Covering Integer Programs Online
5: Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform
6: TH(star):Scalable Distributed Trie Hashing
7: Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
8: Order-preserving Renaming in Synchronous Message Passing Systems with Byzantine Faults
9: Scalable Mechanisms for Rational Secret Sharing
10: Breaking the n^(log n) Barrier for Solvable-Group Isomorphism
11: Parallel clustering with CFinder
12: Scheduling Unrelated Machines of Few Different Types
13: A Durable Flash Memory Search Tree
14: An Overview on Clustering Methods
15: On the Complexity of Trial and Error
16: Sequential-Access FM-Indexes
17: Combinatorial coloring of 3-colorable graphs
18: A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
19: Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable
20: LP-rounding Algorithms for the Fault-Tolerant Facility Placement Problem
21: Converting online algorithms to local computation algorithms
22: Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
23: Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation