1: $O(\mbox{depth})$-Competitive Algorithm for Online Multi-level Aggregation
2: A fast algorithm for maximal propensity score matching
3: Dichotomy for Digraph Homomorphism Problems
4: An efficient exact model for the cell formation problem with a variable number of production cells
5: Greed is Good: Optimistic Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures
6: Uncovering the Spatiotemporal Patterns of Collective Social Activity
7: Column subset selection is NP-complete
8: Computing Abelian regularities on RLE strings
9: Selecting optimal minimum spanning trees that share a topological correspondence with phylogenetic trees
10: On finding highly connected spanning subgraphs
11: A General Approximation Method for Bicriteria Minimization Problems
12: Parallel mining of time-faded heavy hitters
13: Linear Search with Terrain-Dependent Speeds
14: A practical efficient and effective method for the Hamiltonian cycle problem that runs on a standard computer
15: An EPTAS for Scheduling on Unrelated Machines of Few Different Types
16: Sampling and Reconstruction Using Bloom Filters
17: Comparing MapReduce and Pipeline Implementations for Counting Triangles
18: Subgaussian Tail Bounds via Stability Arguments
19: Multivariate Analysis for Computing Maxima in High Dimensions
20: Simplified and Space-Optimal Semi-Streaming for $(2+\epsilon)$-Approximate Matching
21: Streaming k-Means Clustering with Fast Queries
22: The flip Markov chain for connected regular graphs
23: On double-resolution imaging and discrete tomography