1: Online Combinatorial Optimization with Graphical Dependencies
2: A Best Possible General Form of the Master Theorem for Divide-and-Conquer Recurrences
3: Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs
4: An Exact Solver for Maximizing a Submodular Function Subject to a Knapsack Constraint
5: Best-of-Both-Worlds Guarantees with Fairer Endings
6: Toward a Lightweight and Robust Design for Caching
7: Longest Unbordered Factors on Run-Length Encoded Strings
8: The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for $\ell_2$ Norm Estimation
9: An unconditional lower bound for the active-set method in convex quadratic maximization
10: Optimal Pure Differentially Private Sparse Histograms in Near-Linear Deterministic Time
11: Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Low-Rank Matrices? Yes, $MAM^(star)$!
12: Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
13: Advancing Quantum State Preparation Using Decision Diagram with Local Invertible Maps
14: Triadic First-Order Logic Queries in Temporal Networks
15: RLZ-r and LZ-End-r: Enhancing Move-r
16: Residual Prophet Inequalities
17: Stable Iterative Solvers for Ill-conditioned Linear Systems
18: Smoothed Analysis of Online Metric Problems
19: Better Bounds for Semi-Streaming Single-Source Shortest Paths
20: Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
21: Dual Charging for Half-Integral TSP
22: Zeroth-order log-concave sampling
23: On recognizing graphs representing Persistent Perfect Phylogenies
24: Learned LSM-trees: Two Approaches Using Learned Bloom Filters
25: A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
26: Downward self-reducibility in the total function polynomial hierarchy
27: String Consensus Problems with Swaps and Substitutions
28: Budget and Profit Approximations for Spanning Tree Interdiction
29: Query Efficient Structured Matrix Learning
30: Edge-weighted Matching in the Dark
31: Cycle-factors of regular graphs via entropy
32: Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs
33: Online Rounding Schemes for $ k $-Rental Problems
34: CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
35: Improved 2-Approximate Shortest Paths for close vertex pairs
36: Generating Satisfiable Benchmark Instances for Stable Roommates Problems with Optimization
37: An Algorithm-to-Contract Framework without Demand Queries
38: MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
39: Parallel Hierarchical Agglomerative Clustering in Low Dimensions
40: Online Learning with Probing for Sequential User-Centric Selection
41: Adaptive BSTs for Single-Source and All-to-All Requests: Algorithms and Lower Bounds
42: The Min Max Average Cycle Weight Problem
43: Faster exact learning of k-term DNFs with membership and equivalence queries
44: Deterministic Almost-Linear-Time Gomory-Hu Trees
45: TIMEST: Temporal Information Motif Estimator Using Sampling Trees