1: Optimal Transport for Stationary Markov Chains via Policy Iteration
2: Wasserstein barycenters can be computed in polynomial time in fixed dimension
3: Hypergraph Clustering Based on PageRank
4: Nearly Linear Row Sampling Algorithm for Quantile Regression
5: Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time
6: Improved Algorithm for Permutation Testing
7: Algorithmic Aspects of Temporal Betweenness
8: Computing Igusa’s local zeta function of univariates in deterministic polynomial-time
9: Utility-Based Graph Summarization: New and Improved
10: MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining
11: Algorithms with Predictions
12: Heterogeneous Parallelization and Acceleration of Molecular Dynamics Simulations in GROMACS
13: Testing systems of real quadratic equations for approximate solutions
14: Submodular Maximization in Clean Linear Time
15: A One-Pass Private Sketch for Most Machine Learning Tasks
16: Online Algorithms for Weighted Paging with Predictions
17: Caching with Time Windows and Delays
18: Efficient Statistics for Sparse Graphical Models from Truncated Samples
19: Scheduling a Proportionate Flow Shop of Batching Machines
20: Twin-width II: small classes
21: PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth
22: Smoothed Analysis of Online and Differentially Private Learning
23: Fair Hierarchical Clustering
24: A Fast Binary Splitting Approach to Non-Adaptive Group Testing
25: Cyclic space-filling curves and their clustering property
26: Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier
27: A 3/2–approximation for big two-bar charts packing
28: On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
29: Palette Sparsification Beyond $(\Delta+1)$ Vertex Coloring
30: Free Energy Wells and Overlap Gap Property in Sparse PCA
31: Online Dynamic B-Matching With Applications to Reconfigurable Datacenter Networks
32: Resource Pools and the CAP Theorem
33: List-Decodable Mean Estimation via Iterative Multi-Filtering
34: Karp’s patching algorithm on dense digraphs
35: New Bounds for the Vertices of the Integer Hull
36: Probabilistic Fair Clustering
37: Fair clustering via equitable group representations
38: An Online Matching Model for Self-Adjusting ToR-to-ToR Networks
39: Full complexity classification of the list homomorphism problem for bounded-treewidth graphs
40: $\lambda$-Regularized A-Optimal Design and its Approximation by $\lambda$-Regularized Proportional Volume Sampling
41: Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
42: Multicritera Cuts and Size-Constrained $k$-cuts in Hypergraphs
43: Knapsack Secretary with Bursty Adversary
44: Training (Overparametrized) Neural Networks in Near-Linear Time
45: PFP Data Structures
46: Continuous Submodular Maximization: Beyond DR-Submodularity