1: PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching
2: Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints
3: SAT-Encodings for Treecut Width and Treedepth
4: SOSD: A Benchmark for Learned Indexes
5: Minimization of Weighted Completion Times in Path-based Coflow Scheduling
6: Shortest Path Centrality and the APSP problem via VC-dimension and Rademacher Averages
7: Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
8: Adversarially Robust Low Dimensional Representations
9: Algorithms for flows over time with scheduling costs
10: Improved Approximation Algorithms for Inventory Problems
11: Inapproximability of Additive Weak Contraction under SSEH and Strong UGC