1: Generating Connected Random Graphs
2: Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs
3: Learning from graphs with structural variation
4: (k,p)-Planarity: A Relaxation of Hybrid Planarity
5: Representative families for matroid intersections, with applications to location, packing, and covering problems
6: High Dimensional Discrete Integration over the Hypergrid
7: Algorithmic Pirogov-Sinai theory
8: Deciding the Closure of Inconsistent Rooted Triples is NP-Complete
9: Approximate Nearest Neighbors in Limited Space
10: An optimal algorithm for 2-bounded delay buffer management with lookahead