1: On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty
2: On Practical Accuracy of Edit Distance Approximation Algorithms
3: Quantum entanglement, sum of squares, and the log rank conjecture
4: Optimizing tree decompositions in MSO
5: Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
6: Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D
7: A Quasi-Polynomial Approximation for the Restricted Assignment Problem
8: A Framework of Dynamic Data Structures for String Processing
9: Structural Parameters for Scheduling with Assignment Restrictions
10: A PTAS for the Time-Invariant Incremental Knapsack problem
11: Network Backboning with Noisy Data
12: Implementation of Tetris as a Model Counter
13: On rescheduling due to machine disruption while to minimize the total weighted completion time
14: Fast and Accurate Time Series Classification with WEASEL
15: An FPTAS for the parametric knapsack problem
16: KMC 3: counting and manipulating k-mer statistics
17: On a conjecture of Sokal concerning roots of the independence polynomial
18: Evaluating a sublinear-time algorithm for the Minimum Spanning Tree Weight problem