1: Hardness and Approximation Algorithms for Balanced Districting Problems
2: Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
3: Search Trees on Trees via LP
4: Better and Simpler Reducibility Bounds over the Integers
5: Unifying Scheduling Algorithms for Group Completion Time
6: Decision-Theoretic Approaches in Learning-Augmented Algorithms
7: Improved fixed-parameter bounds for Min-Sum-Radii and Diameters $k$-clustering and their fair variants
8: Matrix Product Sketching via Coordinated Sampling
9: Sequential Testing with Subadditive Costs
10: Facility Location on High-dimensional Euclidean Spaces
11: Graph Exploration with Edge Weight Estimates
12: Digital Quantum Simulations of the Non-Resonant Open Tavis-Cummings Model
13: Blocked Bloom Filters with Choices
14: Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs
15: Constant-Factor Distortion Mechanisms for $k$-Committee Election