1: Significance of Episodes Based on Minimal Windows
2: The Long and the Short of It: Summarising Event Sequences with Serial Episodes
3: Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles
4: Space-efficient merging of succinct de Bruijn graphs
5: Are your Items in Order?
6: Using Background Knowledge to Rank Itemsets
7: Probably the Best Itemsets
8: Faster Repetition-Aware Compressed Suffix Trees based on Block Trees
9: Fast Sequence Segmentation using Log-Linear Models
10: Fast Approximation Schemes for Bin Packing
11: Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing
12: Scalable Fair Clustering
13: Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent
14: Set Cover in Sub-linear Time
15: Approximating $k$-connected $m$-dominating sets
16: On modeling hard combinatorial optimization problems as linear programs: Refutations of the “unconditional impossibility” claims
17: On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching
18: Balancing Straight-Line Programs
19: Computing Extremely Accurate Quantiles Using t-Digests
20: Geometric Multicut
21: On the Convergence of Network Systems
22: A Theory of Selective Prediction
23: Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem
24: The Complexity of Max-Min $k$-Partitioning
25: Compressed Range Minimum Queries
26: The Cost of Privacy: Optimal Rates of Convergence for Parameter Estimation with Differential Privacy
27: Crowdsourced PAC Learning under Classification Noise
28: Learning Ising Models with Independent Failures
29: Mesh: Compacting Memory Management for C/C++ Applications
30: CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
31: Learning to Screen
32: Constructing Antidictionaries in Output-Sensitive Space
33: Task-based Augmented Contour Trees with Fibonacci Heaps
34: New Results on Directed Edge Dominating Set
35: Search and Rescue in the Face of Uncertain Threats
36: Reconstructing Trees from Traces
37: Efficient Continuous Multi-Query Processing over Graph Streams
38: Space-Efficient Data Structures for Lattices
39: Conversion from RLBWT to LZ77