1: Tight FPT Approximations for $k$-Median and $k$-Means
2: Efficient Black-Box Identity Testing over Free Group Algebra
3: Compact Fenwick trees for dynamic ranking and selection
4: Improved Dynamic Graph Coloring
5: A Fast Scalable Heuristic for Bin Packing
6: Composing dynamic programming tree-decomposition-based algorithms
7: Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
8: Graph Planarity Testing with Hierarchical Embedding Constraints
9: Accurate MapReduce Algorithms for $k$-median and $k$-means in General Metric Spaces
10: A Quantum-inspired Similarity Measure for the Analysis of Complete Weighted Graphs
11: Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter
12: The I/O complexity of hybrid algorithms for square matrix multiplication
13: Estimating the Frequency of a Clustered Signal
14: Improved bounds for the excluded-minor approximation of treedepth
15: Efficiently Checking Actual Causality with SAT Solving
16: The Guided Team-Partitioning Problem: Definition, Complexity, and Algorithm