1: Succinct Data Structures for Assembling Large Genomes
2: Multigraph Sampling of Online Social Networks
3: Convex optimization for the planted k-disjoint-clique problem
4: Faster Radix Sort via Virtual Memory and Write-Combining
5: Runtime-Flexible Multi-dimensional Arrays and Views for C++98 and C++0x
6: Minimum Entropy Combinatorial Optimization Problems
7: 2-FREE-FLOOD-IT is polynomial
8: Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs
9: Partitions and Coverings of Trees by Bounded-Degree Subtrees
10: Proximity Drawings of High-Degree Trees
11: An approximation algorithm for the total cover problem
12: Celer: an Efficient Program for Genotype Elimination
13: Partially ordered secretaries
14: Maximum Betweenness Centrality: Approximability and Tractable Cases
15: Homogeneous and Non Homogeneous Algorithms
16: Metric uniformization and spectral bounds for graphs