1: Superlinear lower bounds for multipass graph processing
2: Optimal Assembly for High Throughput Shotgun Sequencing
3: 2D Lyndon Words and Applications
4: Tree-based Arithmetic and Compressed Representations of Giant Numbers
5: On Randomized Memoryless Algorithms for the Weighted $k$-server Problem
6: A nonenumerative algorithm to find the k longest (shortest) paths in a DAG
7: Good parts first - a new algorithm for approximate search in lexica and string databases
8: Matroid and Knapsack Center Problems
9: Improved QFT algorithm for power-of-two FFT
10: The Complexity of Scheduling for p-norms of Flow and Stretch
11: Moment-Matching Polynomials
12: An Efficient Algorithm for Clustering of Large-Scale Mass Spectrometry Data
13: Popular Matchings – structure and cheating strategies
14: Fast Multi-Scale Community Detection based on Local Criteria within a Multi-Threaded Algorithm
15: DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs
16: On the Complexity of Connectivity in Cognitive Radio Networks Through Spectrum Assignment