1: Isomorphism of graph classes related to the circular-ones property
2: On a New Method of Storing a Variable Size Array
3: Single pass sparsification in the streaming model with edge deletions
4: Distance Queries from Sampled Data: Accurate and Efficient
5: Work function algorithm can forget history without losing competitiveness
6: A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths
7: Finding Connected Components on Map-reduce in Logarithmic Rounds
8: Optimal Private Halfspace Counting via Discrepancy
9: A note on triangle partitions
10: Memory Hierarchy Sensitive Graph Layout
11: Adaptive Row-grouped CSR Format for Storing of Sparse Matrices on GPU
12: Constructive Discrepancy Minimization by Walking on The Edges
13: Small $\ell$-edge-covers in $k$-connected graphs