1: A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing—Abridged Version
2: Online Learning with an Almost Perfect Expert
3: Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model
4: Vertex Covers Revisited: Indirect Certificates and FPT Algorithms
5: High-dimensional estimation via sum-of-squares proofs
6: Non-monotone Submodular Maximization in Exponentially Fewer Iterations
7: Parameterized Orientable Deletion
8: On Approximating (Sparse) Covering Integer Programs
9: A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum
10: Composable Core-sets for Determinant Maximization Problems via Spectral Spanners
11: Efficient Computation of Sequence Mappability
12: Inserting an Edge into a Geometric Embedding