1: Arbitrary Overlap Constraints in Graph Packing Problems
2: Dual-tree $k$-means with bounded iteration runtime
3: Rank-width: Algorithmic and structural results
4: Mining frequent items in the time fading model
5: On an application of multidimensional arrays
6: Concurrent Hash Tables: Fast and General?(!)
7: Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
8: Determining Tournament Payout Structures for Daily Fantasy Sports
9: Partial-Match Queries with Random Wildcards: In Tries and Distributed Hash Tables
10: Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation
11: On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams
12: Reducing local minima in fitness landscapes of parameter estimation by using piecewise evaluation and state estimation
13: Spectral Theory of Unsigned and Signed Graphs. Applications to Graph Clustering: a Survey
14: Streaming Similarity Self-Join
15: Nonbinary tree-based phylogenetic networks
16: Parameterized and approximation complexity of the detection pair problem in graphs
17: Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array
18: Proving Differential Privacy via Probabilistic Couplings
19: Optimal Composition Ordering Problems for Piecewise Linear Functions
20: Single- and Multi-level Network Sparsification by Algebraic Distance
21: A New Approach for Testing Properties of Discrete Distributions