1: Experimental Comparison of PC-Trees and PQ-Trees
2: $\ell_p$-norm Multiway Cut
3: Isomorphism Testing Parameterized by Genus and Beyond
4: Dynamic Connectivity in Disk Graphs
5: Adversarial Robustness of Streaming Algorithms through Importance Sampling
6: Hop-Constrained Metric Embeddings and their Applications
7: Notes on ${a,b,c}$-Modular Matrices
8: Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
9: Optimal Spanners for Unit Ball Graphs in Doubling Metrics
10: Restricted Adaptivity in Stochastic Scheduling
11: Fully Dynamic Four-Vertex Subgraph Counting
12: Distributed Matrix Tiling Using A Hypergraph Labeling Formulation
13: Near-Optimal Explainable $k$-Means for All Dimensions
14: Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
15: Exponential Weights Algorithms for Selective Learning
16: Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles
17: Importance of Diagonal Gates in Tensor Network Simulations
18: Optimally rescheduling jobs with a LIFO buffer
19: Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing
20: Close relatives (of Feedback Vertex Set), revisited