1: On group feedback vertex set parameterized by the size of the cutset
2: (1+epsilon)-Distance Oracle for Planar Labeled Graph
3: Computing Cartograms with Optimal Complexity
4: On Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions
5: Faster Subset Selection for Matrices and Applications
6: A Lower Bound for Estimating High Moments of a Data Stream