1: Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters
2: Expanderizing Higher Order Random Walks
3: A QPTAS for Facility Location on Unit Disk graphs
4: Pointwise Lipschitz Continuous Graph Algorithms via Proximal Gradient Analysis
5: Symmetric-Difference (Degeneracy) and Signed Tree Models
6: Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
7: A Primal-Dual Framework for Symmetric Cone Programming
8: Interval Selection in Sliding Windows
9: Counting overlapping pairs of strings
10: Improved classical shadows from local symmetries in the Schur basis
11: Online bipartite matching with imperfect advice
12: Risk-Sensitive Online Algorithms
13: Dynamic online matching with budget refills
14: Distributed Delta-Coloring under Bandwidth Limitations
15: Near Uniform Triangle Sampling Over Adjacency List Graph Streams
16: Rounding Large Independent Sets on Expanders
17: Adaptive Quotient Filters
18: A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
19: Lock-Free Augmented Trees
20: Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs
21: On Minimal Transversals of Maximal Cliques in Graphs
22: Real-World Graph Analysis: Techniques for Static, Dynamic, and Temporal Communities
23: Learning low-degree quantum objects
24: Comparisons Are All You Need for Optimizing Smooth Functions
25: String 2-Covers with No Length Restrictions
26: Fair Set Cover
27: BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
28: Decentralized Privacy Preservation for Critical Connections in Graphs
29: Equilibria in multiagent online problems with predictions
30: Lipschitz Continuous Allocations for Optimization Games
31: Scheduling Jobs with Work-Inefficient Parallel Solutions
32: Count-Min Sketch with Conservative Updates: Worst-Case Analysis
33: Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
34: A Nearly Quadratic Improvement for Memory Reallocation
35: Exact Random Graph Matching with Multiple Graphs
36: Algorithms for Generating Small Random Samples
37: Local search for valued constraint satisfaction parameterized by treedepth
38: No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting
39: RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
40: Sorting in One and Two Rounds using $t$-Comparators
41: Faster Linear-Size And-Or Path and Adder Circuits
42: Maximizing Weighted Dominance in the Plane