1: A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
2: The Entropy and Crossentropy of Generalized Mallows Models
3: An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
4: On the Approximability of Unsplittable Flow on a Path with Time Windows
5: Approximation Schemes for k-Subset Sum Ratio and Multiway Number Partitioning Ratio
6: {\epsilon}-Cost Sharding: Scaling Hypergraph-Based Static Functions and Filters to Trillions of Keys
7: Faster Construction of a Planar Distance Oracle with ~{O}(1) Query Time
8: A Graph-based Approach to Variant Extraction
9: ~Optimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
10: The Power of Recursive Embeddings for $\ell_p$ Metrics
11: $k$-Universality of Regular Languages Revisited
12: When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
13: Graph neural networks extrapolate out-of-distribution for shortest paths
14: Privately Evaluating Untrusted Black-Box Functions
15: Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
16: Improved Approximation Algorithms for Three-Dimensional Knapsack
17: Online Stochastic Matching with Unknown Arrival Order: Beating $0.5$ against the Online Optimum
18: Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
19: Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
20: Multiplication of 0-1 matrices via clustering
21: A Tight Meta-theorem for LOCAL Certification of MSO$_2$ Properties within Bounded Treewidth Graphs
22: Online Disjoint Spanning Trees and Polymatroid Bases
23: Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
24: Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
25: Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations
26: Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy
27: Adaptive Local Clustering over Attributed Graphs
28: Solving the Correlation Cluster LP in Sublinear Time
29: Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
30: History-Independent Concurrent Hash Tables
31: On the Hardness Hierarchy for the $O(n \sqrt{\log n})$ Complexity in the Word RAM
32: A Quantum Constraint Generation Framework for Binary Linear Programs
33: A Theoretical Framework for Distribution-Aware Dataset Search
34: A Tolerant Independent Set Tester
35: Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate $k$-clique counts faster
36: Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ time
37: On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs