1: Towards an Isomorphism Dichotomy for Hereditary Graph Classes
2: Partitioning Well-Clustered Graphs: Spectral Clustering Works!
3: Online Square Detection
4: Analysis of Branch Misses in Quicksort
5: Two maximum entropy based algorithms for running quantile estimation in non-stationary data streams
6: A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality
7: Independent sets and hitting sets of bicolored rectangular families
8: An explicit sparse recovery scheme in the L1-norm
9: The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
10: Sketching and Embedding are Equivalent for Norms
11: Asynchronous Approximation of a Single Component of the Solution to a Linear System
12: Preserving Statistical Validity in Adaptive Data Analysis
13: Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover
14: Variable-Order de Bruijn Graphs
15: Faster Compressed Quadtrees
16: Improving Robustness of Next-Hop Routing
17: A linear time algorithm for the orbit problem over cyclic groups
18: Manycore processing of repeated range queries over massive moving objects observations
19: Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
20: Asymmetric Minwise Hashing
21: Tight Bounds for Online Vector Scheduling