1: Approximation Schemes for Multiperiod Binary Knapsack Problems
2: Vertex Connectivity in Poly-logarithmic Max-flows
3: The $k$-Colorable Unit Disk Cover Problem
4: Learning with Neural Tangent Kernels in Near Input Sparsity Time
5: $O(1)$ Steiner Point Removal in Series-Parallel Graphs
6: Scalable Hash Table for NUMA Systems
7: Independent Sets in Semi-random Hypergraphs
8: Information-constrained optimization: can adaptive processing of gradients help?
9: Fast and Accurate Randomized Algorithms for Low-rank Tensor Decompositions
10: Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
11: Branch-and-cut algorithms for the covering salesman problem
12: LAGraph: Linear Algebra, Network Analysis Libraries, and the Study of Graph Algorithms
13: Frequency Estimation Under Multiparty Differential Privacy: One-shot and Streaming
14: Prophet Inequalities for Matching with a Single Sample
15: Exact Algorithms for No-Rainbow Coloring and Phylogenetic Decisiveness
16: Sorted Range Reporting and Range Minima Queries
17: Differentially Private Histograms in the Shuffle Model from Fake Users
18: The Power of Subsampling in Submodular Maximization
19: Parameterized Complexity of Elimination Distance to First-Order Logic Properties
20: Polynomial Circuit Verification using BDDs
21: Two-Stage Robust Optimization Problems with Two-Stage Uncertainty
22: Destroying Multicolored Paths and Cycles in Edge-Colored Graphs