1: Long Directed Detours: Reduction to $2$-Disjoint Paths
2: Mobility Data in Operations: The Facility Location Problem
3: Neighborhood-based Hypergraph Core Decomposition
4: A Distributed Palette Sparsification Theorem
5: PROPAGATE: a seed propagation framework to compute Distance-based metrics on Very Large Graphs
6: Faster Sinkhorn’s Algorithm with Small Treewidth
7: Ranking with submodular functions on the fly
8: Faster Algorithms for Evacuation Problems in Networks with the Single Sink of Small Degree
9: Algorithms for Acyclic Weighted Finite-State Automata with Failure Arcs
10: Engineering Fully Dynamic $\Delta$-Orientation Algorithms
11: All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method
12: A Fast Algorithm for Adaptive Private Mean Estimation
13: Subset Sum in Time $2^{n/2} / poly(n)$
14: A New Construction of the Vietoris-Rips Complex
15: Two New Upper Bounds for the Maximum k-plex Problem
16: An Improved Approximation for Maximum Weighted $k$-Set Packing
17: Improved Tradeoffs for Leader Election
18: Hypercore Decomposition for Non-Fragile Hyperedges: Concepts, Algorithms, Observations, and Applications
19: Coresets for Constrained Clustering: General Assignment Constraints and Improved Size Bounds
20: Superpolynomial Lower Bounds for Learning Monotone Classes
21: Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
22: Fast likelihood-based change point detection
23: Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game