1: Practical Algorithms for Finding Extremal Sets
2: Generalized multiple depot traveling salesmen problem - polyhedral study and exact algorithm
3: Efficient quantum tomography
4: The Mixing Time of the Dikin Walk in a Polytope - A Simple Proof
5: Deterministic Algorithms for Submodular Maximization Problems
6: Two Particle-in-Grid Realisations on Spacetrees
7: Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction
8: Energy Structure of Optimal Positional Strategies in Mean Payoff Games
9: Computing Maximal Layers Of Points in $E^{f(n)}$
10: Relative Suffix Trees
11: A note on convex characters, Fibonacci numbers and exponential-time algorithms
12: Technical Note: Split Algorithm in O(n) for the Capacitated Vehicle Routing Problem
13: Editing to a Planar Graph of Given Degrees
14: Space-efficient detection of unusual words
15: MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm
16: The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem
17: Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time
18: A Randomized Rounding Algorithm for Sparse PCA
19: Codon Context Optimization in Synthetic Gene Design
20: A Lower Bound on the Diameter of the Flip Graph