1: 1.85 Approximation for Min-Power Strong Connectivity
2: Efficient Parallel Computation of Nearest Neighbor Interchange Distances
3: Lower Bounds for Adaptive Sparse Recovery
4: On Min-Power Steiner Tree
5: Parameterized Domination in Circle Graphs
6: Detours in Scope-Based Route Planning
7: Hypercontractivity, Sum-of-Squares Proofs, and their Applications
8: No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover
9: Adaptive fast multipole methods on the GPU