1: 3.415-Approximation for Coflow Scheduling via Iterated Rounding
2: The Structural Complexity of Matrix-Vector Multiplication
3: On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
4: An FPT Constant-Factor Approximation Algorithm for Correlation Clustering
5: Interval H-graphs : Recognition and forbidden obstructions
6: Streaming Algorithms for Network Design
7: Learning-Augmented Frequent Directions
8: Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
9: A framework for boosting matching approximation: parallel, distributed, and dynamic
10: The Complexity of Extending Fair Allocations of Indivisible Goods
11: Faster ED-String Matching with $k$ Mismatches
12: Binary $k$-Center with Missing Entries: Structure Leads to Tractability
13: Provably optimal decision trees with arbitrary splitting rules in polynomial time
14: Scanning HTML at Tens of Gigabytes per Second on ARM Processors
15: Noisy-enhanced quantum search on complex networks
16: Optimal Differentially Private Sampling of Unbounded Gaussians
17: Online Fair Division: Towards Ex-Post Constant MMS Guarantees
18: Improved MMS Approximations for Few Agent Types
19: Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
20: On the sensitivity of CDAWG-grammars
21: Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
22: Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method
23: Spike-and-Slab Posterior Sampling in High Dimensions
24: A Theoretical Model for Grit in Pursuing Ambitious Ends
25: Enabling Fast, Accurate, and Efficient Real-Time Genome Analysis via New Algorithms and Techniques
26: Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
27: Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
28: A Graph Width Perspective on Partially Ordered Hamiltonian Paths
29: Novel Complexity Results for Temporal Separators with Deadlines
30: Improved FPT Approximation Algorithms for TSP
31: Improved Robust Estimation for Erd\H{o}s-R'enyi Graphs: The Sparse Regime and Optimal Breakdown Point
32: Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure
33: Image Computation for Quantum Transition Systems
34: Revisiting Ranking for Online Bipartite Matching with Random Arrivals: the Primal-Dual Analysis
35: Faster Distributed $\Delta$-Coloring via Ruling Subgraphs
36: Cost-Distance Steiner Trees for Timing-Constrained Global Routing
37: Source-Oblivious Broadcast
38: Quickly Avoiding a Random Catastrophe
39: Efficient Algorithms for Verifying Kruskal Rank in Sparse Linear Regression and Related Applications
40: Faster Global Minimum Cut with Predictions
41: Dynamic Indexing Through Learned Indices with Worst-case Guarantees
42: Fair Clustering in the Sliding Window Model
43: Fair Center Clustering in Sliding Windows
44: On the Parameterized Complexity of Odd Coloring
45: Strassen’s algorithm via orbit flip graphs