1: On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications
2: Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise
3: Private Covariance Approximation and Eigenvalue-Gap Bounds for Complex Gaussian Perturbations
4: Scheduling on parallel machines with a common server in charge of loading and unloading operations
5: Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs
6: Computing all-vs-all MEMs in grammar-compressed text
7: An improved kernelization algorithm for Trivially Perfect Editing
8: Online Coalition Formation under Random Arrival or Coalition Dissolution
9: 5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size
10: Axis-Parallel Right Angle Crossing Graphs
11: Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs
12: Efficient Parallel Output-Sensitive Edit Distance
13: Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius