1: Splitting $B_2$-VPG graphs into outer-string and co-comparability graphs
2: Vertex-Centric Graph Processing: The Good, the Bad, and the Ugly
3: A hardness result and new algorithm for the longest common palindromic subsequence problem
4: Simultaneous encodings for range and next/previous larger/smaller value queries
5: On Coreset Constructions for the Fuzzy $K$-Means Problem
6: Set Similarity Search Beyond MinHash
7: Spectral algorithms for tensor completion
8: Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms
9: All-Pairs 2-Reachability in $\mathcal{O}(n^{\omega}\log n)$ Time
10: New Results for Adaptive and Approximate Counting of Inversions
11: On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
12: Monte Carlo Sort for unreliable human comparisons
13: Metric 1-median selection with fewer queries
14: Provable learning of Noisy-or Networks
15: The Competition Complexity of Auctions: A Bulow-Klemperer Result for Multi-Dimensional Bidders