1: An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
2: NP-Hardness and ETH-Based Inapproximability of Communication Complexity via Relaxed Interlacing
3: Debiasing Polynomial and Fourier Regression
4: A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
5: Sandwich Monotonicity and the Recognition of Weighted Graph Classes
6: Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
7: The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations
8: A Simple PTAS for Weighted $k$-means and Sensor Coverage
9: On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
10: Does block size matter in randomized block Krylov low-rank approximation?
11: The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
12: A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition
13: Approximating High-Dimensional Earth Mover’s Distance as Fast as Closest Pair
14: Controlling tail risk in two-slope ski rental
15: A Joint Sparse Self-Representation Learning Method for Multiview Clustering
16: Performance of the Extended Ising Machine for the Quadratic Knapsack Problem
17: A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fr'echet distance
18: Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
19: Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
20: Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search
21: Simple Algorithms for Fully Dynamic Edge Connectivity
22: Nearly Optimal Bounds for Stochastic Online Sorting
23: Sparsifying Cayley Graphs on Every Group
24: Sparsifying Sums of Positive Semidefinite Matrices
25: Competitive Online Transportation Simplified
26: Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification
27: Graph-based method for constructing consensus trees
28: Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
29: Robust Scheduling on Uniform Machines – New Results Using a Relaxed Approximation Guarantee
30: An improved local search based algorithm for $k^-$-star partition
31: A Classical Quadratic Speedup for Planted $k$XOR
32: Online Prediction with Limited Selectivity
33: Retroactive Monotonic Priority Queues via Range Searching
34: Output-Sparse Matrix Multiplication Using Compressed Sensing
35: Welfare-Centric Clustering
36: Lower Bounds on Tree Covers
37: On Fixed-Parameter Tractability of Weighted 0-1 Timed Matching Problem on Temporal Graphs