1: Improved resource-tunable near-term quantum algorithms for transition probabilities, with applications in physics and variational quantum linear algebra
2: Hardness and Algorithms for Robust and Sparse Optimization
3: Open Problem: Properly learning decision trees in polynomial time?
4: Linearizing Partial Search Orders
5: There and Back Again: On Applying Data Reduction Rules by Undoing Others
6: LinearAlifold: Linear-Time Consensus Structure Prediction for RNA Alignments
7: Recognizing Map Graphs of Bounded Treewidth
8: RAC Drawings of Graphs with Low Degree
9: Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem
10: On graphs coverable by k shortest paths
11: Slim Tree-Cut Width
12: Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
13: Prefix-free parsing for building large tunnelled Wheeler graphs
14: Computing the Parameterized Burrows–Wheeler Transform Online
15: Approximation Algorithms for Continuous Clustering and Facility Location Problems
16: Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty
17: Cohomology in Constraint Satisfaction and Structure Isomorphism
18: Fast sampling of satisfying assignments from random $k$-SAT