1: Universal sketches for the frequency negative moments and other decreasing streaming sums
2: Uniform Sampling for Matrix Approximation
3: Tackling the Minimal Superpermutation Problem
4: Faster construction of asymptotically good unit-cost error correcting codes in the RAM model
5: IPED2: Inheritance Path based Pedigree Reconstruction Algorithm for Complicated Pedigrees
6: Remarks on Quantum Modular Exponentiation and Some Experimental Demonstrations of Shor’s Algorithm
7: Planar Octilinear Drawings with One Bend Per Edge
8: Planar Induced Subgraphs of Sparse Graphs
9: An $O(n^2)$ Algorithm for Computing Optimal Continuous Voltage Schedules
10: Approximating Upper Degree-Constrained Partial Orientations
11: Wavelet Trees Meet Suffix Trees
12: Exact Algorithms for Dominating Induced Matching Based on Graph Partition
13: Sketch-based Influence Maximization and Computation: Scaling up with Guarantees
14: Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
15: Push is Fast on Sparse Random Graphs
16: A Linear Kernel for Planar Red-Blue Dominating Set
17: Finding Maximum k-Cliques Faster using Lazy Global Domination