1: Distributed Freeze Tag: a Sustainable Solution to Discover and Wake-up a Robot Swarm
2: Randomized $\tilde{O}(m\sqrt{n})$ Bellman-Ford from Fineman and the Boilermakers
3: Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs
4: Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
5: Wagner’s Algorithm Provably Runs in Subexponential Time for SIS$^\infty$
6: Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost
7: Generalized Capacity Planning for the Hospital-Residents Problem
8: FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
9: Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
10: Network Unreliability in Almost-Linear Time
11: Space of Data through the Lens of Multilevel Graph
12: Word Break on SLP-Compressed Texts