1: Improved Approximation for Broadcasting in k-cycle Graphs
2: Signal-Aware Workload Shifting Algorithms with Uncertainty-Quantified Predictors
3: Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint
4: Dynamic Necklace Splitting
5: Privacy-Preserving Learning-Augmented Data Structures
6: Query-Optimal Estimation of Unitary Channels via Pauli Dimensionality
7: SPAM Tolerance for Pauli Error Estimation
8: Privately Estimating Black-Box Statistics
9: One-Sided Local Crossing Minimization
10: Differentially Private Learning of Exponential Distributions: Adaptive Algorithms and Tight Bounds
11: Boundaried Kernelization via Representative Sets
12: Degree-bounded Online Bipartite Matching: OCS vs. Ranking
13: Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
14: Random Matrices, Intrinsic Freeness, and Sharp Non-Asymptotic Inequalities
15: Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
16: The Steiner Path Aggregation Problem
17: Foremost, Fastest, Shortest: Temporal Graph Realization under Various Path Metrics
18: Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
19: Short circuit walks in fixed dimension
20: Bifurcation: How to Explore a Tree
21: Adaptive randomized pivoting and volume sampling
22: Even Faster Kernel Matrix Linear Algebra via Density Estimation
23: Near-Optimal Fault-Tolerant Strong Connectivity Preservers
24: Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
25: On the Enumeration of all Unique Paths of Recombining Trinomial Trees
26: Pareto-optimal Non-uniform Language Generation
27: Online Learning in the Random Order Model
28: A Hardware Accelerator for the Goemans-Williamson Algorithm
29: Low Recourse Arborescence Forests Under Uniformly Random Arcs
30: Oracle-based Uniform Sampling from Convex Bodies
31: Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices
32: The Computational Complexity of Almost Stable Clustering with Penalties
33: Taming Imperfect Process Verifiers: A Sampling Perspective on Backtracking
34: Optimized Degree Realization: Minimum Dominating Set & Maximum Matching
35: Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
36: A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
37: Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
38: Transductive and Learning-Augmented Online Regression
39: A Dynamic Programming Approach to Evader Pathfinding in Static Pursuit Scenarios
40: Exact Causal Attention with 10% Fewer Operations
41: Robust Optimality of Bundling Goods Beyond Finite Variance
42: Streaming Max-Cut in General Metrics
43: Perspectives on Stochastic Localization
44: Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs $\star$
45: Online Multiple Resource Allocation Problems with Departures via the Primal-Dual Approach
46: A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
47: Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding
48: Fair Rent Division: New Budget and Rent Constraints
49: Time To Replace Your Filter: How Maplets Simplify System Design
50: Efficient learning of bosonic Gaussian unitaries
51: A New Quantum Linear System Algorithm Beyond the Condition Number and Its Application to Solving Multivariate Polynomial Systems
52: Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
53: Computational Complexity in Property Testing
54: Improved Streaming Algorithm for Fair $k$-Center Clustering
55: Efficient Heuristics and Exact Methods for Pairwise Interaction Sampling
56: Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search