1: Networks become navigable as nodes move and forget
2: Stream sampling for variance-optimal estimation of subset sums
3: Fast unfolding of communities in large networks
4: Spanning directed trees with many leaves
5: A quadratic algorithm for road coloring
6: Complexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using Syndromes
7: Incremental Topological Ordering and Strong Component Maintenance
8: Knapsack cryptosystems built on NP-hard instance
9: Graph Sparsification by Effective Resistances
10: Selective association rule generation
11: Faster Approximate Lossy Generalized Flow via Interior Point Algorithms