1: Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
2: Anonymous Card Shuffling and its Applications to Parallel Mixnets
3: Testing Coverage Functions
4: Rainbow Colouring of Split and Threshold Graphs
5: Submodular Inference of Diffusion Networks from Multiple Trees
6: Influence Maximization in Continuous Time Diffusion Networks
7: Matching with Commitments
8: Faster Algorithms for Privately Releasing Marginals
9: Strong Conflict-Free Coloring of Intervals
10: Distributed Algorithms for Scheduling on Line and Tree Networks
11: A Note on the PageRank of Undirected Graphs
12: Data Dissemination And Collection Algorithms For Collaborative Sensor Networks Using Dynamic Cluster Heads
13: Approximation Algorithms for Semi-random Graph Partitioning Problems
14: Complex-Demand Knapsack Problems and Incentives in AC Power Systems
15: Exact Structure Discovery in Bayesian Networks with Less Space
16: Improving Compressed Counting
17: MAP Estimation of Semi-Metric MRFs via Hierarchical Graph Cuts
18: MAP Estimation, Message Passing, and Perfect Graphs
19: Optimal Listing of Cycles and st-Paths in Undirected Graphs
20: A Comparative Study on the Performance of Permutation Algorithms
21: Faster arithmetic for number-theoretic transforms