1: Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty
2: Sketch-and-solve approaches to k-means clustering by semidefinite programming
3: Sublinear Time Algorithms and Complexity of Approximate Maximum Matching
4: Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching
5: Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse
6: Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributions
7: Elfs, trees and quantum walks
8: Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs
9: Batching and Optimal Multi-stage Bipartite Allocations
10: Approximating binary longest common subsequence in almost-linear time
11: Approximate minimum cuts and their enumeration
12: Gapped String Indexing in Subquadratic Space and Sublinear Query Time
13: Improved Smoothed Analysis of 2-Opt for the Euclidean TSP
14: Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity