1: Robust Restaking Networks
2: Finding a Shortest $M$-link Path in a Monge Directed Acyclic Graph
3: Online Computation of String Net Frequency
4: Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling
5: Log Diameter Rounds MST Verification and Sensitivity in MPC
6: Infrequent Resolving Algorithm for Online Linear Programming
7: New Compressed Indices for Multijoins on Graph Databases
8: On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
9: On Constrained and k Shortest Paths
10: Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
11: Complex event recognition meets hierarchical conjunctive queries
12: Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
13: Differentially Private Gomory-Hu Trees
14: First Order Stochastic Optimization with Oblivious Noise
15: Abstraction in Neural Networks
16: Improved Bounds for High-Dimensional Equivalence and Product Testing using Subcube Queries
17: Potential Hessian Ascent: The Sherrington-Kirkpatrick Model
18: Fast Estimation of Percolation Centrality
19: Online Fair Allocation with Best-of-Many-Worlds Guarantees
20: Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
21: Faster and simpler online/sliding rightmost Lempel-Ziv factorizations
22: Rapid mixing of the down-up walk on matchings of a fixed size
23: Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
24: Longest Common Extensions with Wildcards: Trade-off and Applications
25: Deterministic Online Bipartite Edge Coloring
26: Finding longer cycles via shortest colourful cycle