1: Scaling up Kernel Ridge Regression via Locality Sensitive Hashing
2: The Local Information Cost of Distributed Graph Spanners
3: Fast and memory-optimal dimension reduction using Kac’s walk
4: On the complexity of Broadcast Domination and Multipacking in digraphs
5: Approximate Aggregate Queries Under Additive Inequalities
6: A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering
7: Parameterized Algorithms for Red-Blue Weighted Vertex Cover on Trees
8: Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
9: Deep Weisfeiler Leman
10: Efficient Algorithms for Multidimensional Segmented Regression
11: Stochastic Zeroth-order Riemannian Derivative Estimation and Optimization
12: Polynomial Kernels for Paw-free Edge Modification Problems
13: Fair allocation of indivisible items with conflict graphs
14: Simple Deterministic Approximation for Submodular Multiple Knapsack Problem
15: A Hybrid MPI+Threads Approach to Particle Group Finding Using Union-Find
16: The Exact Query Complexity of Yes-No Permutation Mastermind
17: Further Results on Colored Range Searching
18: On Structural Parameterizations of Node Kayles
19: Robust quantum minimum finding with an application to hypothesis selection
20: Succinct Dynamic Ordered Sets with Random Access
21: Geometric Pattern Matching Reduces to k-SUM
22: A Blind Permutation Similarity Algorithm
23: Advanced Flow-Based Multilevel Hypergraph Partitioning
24: Large independent sets on random $d$-regular graphs with fixed degree $d$
25: Faster Approximation Algorithms for Geometric Set Cover
26: An enhanced pinwheel algorithm for the bamboo garden trimming problem
27: Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons