1: Informative Path Planning with Limited Adaptivity
2: Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
3: Fast Deterministic Rendezvous in Labeled Lines
4: Learning-Augmented Dynamic Submodular Maximization
5: Beyond Catoni: Sharper Rates for Heavy-Tailed and Robust Mean Estimation
6: Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
7: Orientable Burning Number of Graphs
8: Testing Closeness of Multivariate Distributions via Ramsey Theory
9: Solution discovery via reconfiguration for problems in P
10: Triangle-free $2$-matchings
11: On the Size Overhead of Pairwise Spanners
12: Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence
13: Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping
14: Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
15: Algorithm-agnostic low-rank approximation of operator monotone matrix functions
16: Identification for Tree-shaped Structural Causal Models in Polynomial Time
17: Geometric Covering using Random Fields
18: Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model
19: Maximum Cardinality $f$-Matching in Time $O(n^{2/3}m)$
20: Distribution Testing with a Confused Collector
21: Four-set Hypergraphlets for Characterization of Directed Hypergraphs
22: Revisiting Quantum Algorithms for Linear Regressions: Quadratic Speedups without Data-Dependent Parameters
23: Lightweight Public Key Encryption in Post-Quantum Computing Era
24: Recursive lattice reduction – A framework for finding short lattice vectors
25: Testable Learning with Distribution Shift
26: A Primal-Dual Extension of the Goemans–Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
27: Grafite: Taming Adversarial Queries with Optimal Range Filters
28: Enumeration and Succinct Encoding of AVL Trees
29: Quantum Langevin Dynamics for Optimization
30: On Approximating Cutwidth and Pathwidth
31: Size-constrained Weighted Ancestors with Applications
32: Simple Lattice Basis Computation – The Generalization of the Euclidean Algorithm
33: Low-Degree Hardness of Detection for Correlated Erd\H{o}s-R'enyi Graphs
34: The Power of Adaptivity in Quantum Query Algorithms
35: An Exploration of Left-Corner Transformations
36: Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis
37: On the quantum time complexity of divide and conquer
38: A Combinatorial Approach to Robust PCA
39: Property Testing with Online Adversaries
40: l2Match: Optimization Techniques on Subgraph Matching Algorithm using Label Pair, Neighboring Label Index, and Jump-Redo method
41: $k$-times bin packing and its application to fair electricity distribution