1: Note on Max Lin-2 above Average
2: Self-Stabilizing Byzantine Asynchronous Unison
3: Max-Leaves Spanning Tree is APX-hard for Cubic Graphs
4: Approximate Sparse Recovery: Optimizing Time and Measurements
5: Optimal lower bounds for locality sensitive hashing (except when q is tiny)
6: Tight Thresholds for Cuckoo Hashing via XORSAT
7: Submodular Functions: Extensions, Distributions, and Algorithms. A Survey
8: Variants of Constrained Longest Common Subsequence
9: A Local Spectral Method for Graphs: with Applications to Improving Graph Partitions and Exploring Data Graphs Locally
10: Uniform sampling of undirected and directed graphs with a fixed degree sequence
11: Fast matrix multiplication techniques based on the Adleman-Lipton model
12: New Algorithmic Approaches for Computing Optimal Network Paths with Several Types of QoS Constraints
13: Practical Algorithmic Techniques for Several String Processing Problems
14: Grammar-Based Compression in a Streaming Model
15: An expected-case sub-cubic solution to the all-pairs shortest path problem in R
16: Thresholded Covering Algorithms for Robust and Max-Min Optimization
17: Abstract Milling with Turn Costs
18: Euclidean Prize-collecting Steiner Forest
19: Extending Karger’s randomized min-cut Algorithm for a Synchronous Distributed setting