1: Parameterized Quantum Query Algorithms for Graph Problems
2: Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
3: Reducing Matroid Optimization to Basis Search
4: Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
5: Simple Linear-time Repetition Factorization
6: On some randomized algorithms and their evaluation
7: Approximating $\delta$-Covering
8: Constant-time $\psi$ queries in $O \left( r \log \frac{n}{r} + r \log \sigma \right)$ bits
9: Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
10: SSD Set System, Graph Decomposition and Hamiltonian Cycle
11: Regularized Unconstrained Weakly Submodular Maximization
12: Deterministic approximate counting of colorings with fewer than $2\Delta$ colors via absence of zeros
13: A simple quadratic kernel for Token Jumping on surfaces
14: Locally Private Histograms in All Privacy Regimes
15: On the Number of Non-equivalent Parameterized Squares in a String
16: Two-Edge Connectivity via Pac-Man Gluing
17: Competitive Capacitated Online Recoloring
18: Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan
19: Improved Approximation Guarantees for Joint Replenishment in Continuous Time
20: Convergence Analysis for Deep Sparse Coding via Convolutional Neural Networks
21: Mixing on Generalized Associahedra
22: Memento Filter: A Fast, Dynamic, and Robust Range Filter
23: Separate Generation and Evaluation for Parallel Greedy Best-First Search
24: High Probability Latency Sequential Change Detection over an Unknown Finite Horizon
25: The complexity of strong conflict-free vertex-connection $k$-colorability
26: Spectral Sparsification by Deterministic Discrepancy Walk
27: Fast John Ellipsoid Computation with Differential Privacy Optimization
28: Batched Ranged Random Integer Generation
29: Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares
30: Towards tolerant testing stabilizer states
31: Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
32: Online Vehicle Routing with Pickups and Deliveries under Time-Dependent Travel-Time Constraints
33: Massively Parallel Minimum Spanning Tree in General Metric Spaces
34: Quasi-Monte Carlo Beyond Hardy-Krause
35: Path Partitions of Phylogenetic Networks
36: Faster Lattice Basis Computation – The Generalization of the Euclidean Algorithm
37: Better Gaussian Mechanism using Correlated Noise
38: Engineering Hypergraph $b$-Matching Algorithms
39: Stabilizer bootstrapping: A recipe for efficient agnostic tomography and magic estimation
40: Faster Private Minimum Spanning Trees
41: A $5/4$ Approximation for Two-Edge-Connectivity
42: Count on Your Elders: Laplace vs Gaussian Noise
43: Fast and Accurate Algorithms to Calculate Expected Modularity in Probabilistic Networks