1: Unclustered BWTs of any Length over Non-Binary Alphabets
2: Spectral Gaps with Quantum Counting Queries and Oblivious State Preparation
3: Faster Linear Algebra Algorithms with Structured Random Matrices
4: $\Delta$-Motif: Subgraph Isomorphism at Scale via Data-Centric Parallelism
5: Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems
6: Constructive l2-Discrepancy Minimization with Additive Deviations
7: Block Encoding of Sparse Matrices via Coherent Permutation
8: Hilbert Forest in the SISAP 2025 Indexing Challenge
9: GTA – An ATSP Method: Shifting the Bottleneck from Algorithm to RAM
10: LHS in LHS: A new expansion strategy for Latin hypercube sampling in simulation design
11: Analysis of Algorithms for Moser’s Problems on Sums of Consecutive Primes
12: Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
13: How to Compute a Moving Sum
14: Triangle Counting in Hypergraph Streams: A Complete and Practical Approach
15: Large cliques and large independent sets: can they coexist?