1: Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
2: A Simple Approximation Algorithm for Optimal Decision Tree
3: Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
4: Breaking Barriers for Distributed MIS by Faster Degree Reduction
5: Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
6: An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT
7: Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
8: On the Complexity of Finding Approximate LCS of Multiple Strings
9: Multi-Unit Combinatorial Prophet Inequalities
10: Three Algorithms for Merging Hierarchical Navigable Small World Graphs
11: On the Two Paths Theorem and the Two Disjoint Paths Problem
12: Streaming Diameter of High-Dimensional Points
13: Contextual Learning for Stochastic Optimization
14: Quasi-optimal hierarchically semi-separable matrix approximation
15: The Quasi-Polynomial Low-Degree Conjecture is False
16: Improved and Oracle-Efficient Online $\ell_1$-Multicalibration
17: HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
18: Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems
19: Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
20: Simple parallel estimation of the partition ratio for Gibbs distributions
21: Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)
22: Notes on the Linear Algebraic View of Regularity Lemmas
23: Improved Regret and Contextual Linear Extension for Pandora’s Box and Prophet Inequality
24: DNF Learning via Locally Mixing Random Walks
25: Efficient Online Random Sampling via Randomness Recycling
26: Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
27: On Distributed Colouring of Hyperbolic Random Graphs
28: Grassroots Consensus
29: Learning-Augmented Online Bipartite Fractional Matching
30: Demand Selection for VRP with Emission Quota
31: A Formal Analysis of Algorithms for Matroids and Greedoids
32: Pathographs and some (un)decidability results
33: Bounding Width on Graph Classes of Constant Diameter
34: The Power of Iterative Filtering for Supervised Learning with (Heavy) Contamination
35: Private Geometric Median in Nearly-Linear Time
36: Probabilistic Kernel Function for Fast Angle Testing
37: Strong Low Degree Hardness for the Number Partitioning Problem
38: Colouring Probe $H$-Free Graphs
39: Complexity landscape for local certification
40: Course Allocation with Credits via Stable Matching
41: Scheduling with Uncertain Holding Costs and its Application to Content Moderation
42: Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
43: High-Dimensional Calibration from Swap Regret
44: Algorithms and SQ Lower Bounds for Robustly Learning Real-valued Multi-index Models
45: Efficient Diffusion Models for Symmetric Manifolds
46: Adaptive Frontier Exploration on Graphs with Applications to Network-Based Disease Testing
47: Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering
48: (Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
49: Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial
50: Finding $d$-Cuts in Probe $H$-Free Graphs
51: Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
52: Faster Convolutions: Yates and Strassen Revisited