1: Binary weights spanning trees and the $k$-red spanning tree problem in linear time
2: Selection Improvements for the Parallel Iterative Algorithm for Stable Matching
3: Rabin Games and Colourful Universal Trees
4: Directed Ear Anonymity
5: Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
6: Centrality of shortest paths: Algorithms and complexity results
7: Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer
8: On the formalization of the notion of an algorithm
9: Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
10: An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree
11: Fast parallel sampling under isoperimetry
12: SARRIGUREN: a polynomial-time complete algorithm for random $k$-SAT with relatively dense clauses
13: From Zero-Freeness to Strong Spatial Mixing via a Christoffel-Darboux Type Identity
14: Foundations of Vector Retrieval
15: Lower Bounds on $0$-Extension with Steiner Nodes
16: Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
17: Generation of weighted trees, block trees and block graphs
18: Techniques for Authenticating Quantile Digests
19: Quickly Determining Who Won an Election
20: Deterministic Simple $(\Delta+\varepsilon\alpha)$-Edge-Coloring in Near-Linear Time
21: Influential Slot and Tag Selection in Billboard Advertisement
22: Network Design on Undirected Series-Parallel Graphs
23: Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints
24: Cactus Representation of Minimum Cuts: Derandomize and Speed up
25: Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
26: Quantum Circuit Simulation with Fast Tensor Decision Diagram