1: Additive Spanner Lower Bounds with Optimal Inner Graph Structure
2: The PRODSAT phase of random quantum satisfiability
3: PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
4: Did Fourier Really Meet M"obius? Fast Subset Convolution via FFT
5: Beating Posits at Their Own Game: Takum Arithmetic
6: Graph Search Trees and the Intermezzo Problem
7: Private graph colouring with limited defectiveness
8: Tensor cumulants for statistical inference on invariant distributions
9: Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
10: Improved bounds for group testing in arbitrary hypergraphs
11: Learning Mixtures of Gaussians Using Diffusion Models
12: Learning general Gaussian mixtures with efficient score matching
13: On classes of bounded tree rank, their interpretations, and efficient sparsification
14: Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
15: $(\Delta + 1)$ Vertex Coloring in $O(n)$ Communication
16: Persistent Homology generalizations for Social Media Network Analysis
17: Efficient Algorithms for Earliest and Fastest Paths in Public Transport Networks
18: A logarithmic approximation of linearly-ordered colourings