1: Heuristic algorithms for the min-max edge 2-coloring problem
2: Improved algorithms for the Shortest Vector Problem and the Closest Vector Problem in the infinity norm
3: Efficient and Effective Quantum Compiling for Entanglement-based Machine Learning on IBM Q Devices
4: How To Make the Gradients Small Stochastically: Even Faster Convex and Nonconvex SGD
5: Stable Marriage with Multi-Modal Preferences
6: Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling
7: Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem
8: Adaptive Boolean Monotonicity Testing in Total Influence Time
9: Risk-Averse Matchings over Uncertain Graph Databases
10: FPT algorithms for embedding into low complexity graphic metrics
11: A Polynomial Algorithm for Balanced Clustering via Graph Partitioning
12: Online Maximum Matching with Recourse
13: Parameterized (Approximate) Defective Coloring
14: One-Pass Trajectory Simplification Using the Synchronous Euclidean Distance
15: The Asymptotic Capacity of Private Search
16: Computing permanents of complex diagonally dominant matrices and tensors
17: Tight Bounds for $\ell_p$ Oblivious Subspace Embeddings
18: Longest Common Prefixes with $k$-Errors and Applications
19: Toward Metric Indexes for Incremental Insertion and Querying
20: Near-optimal approximation algorithm for simultaneous Max-Cut
21: Fast Methods for Solving the Cluster Containment Problem for Phylogenetic Networks