1: Terminal Embeddings
2: Constant Approximation for Capacitated $k$-Median with $(1 + \epsilon)$-Capacity Violation
3: On Self-Reducibility and Reoptimization of Closest Substring Problem
4: A minimum-change version of the Chung-Feller theorem for Dyck paths
5: Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
6: Complexity and Stop Conditions for NP as General Assignment Problems, the Travel Salesman Problem in $\mathbb{R}^2$, Knight Tour Problem and Boolean Satisfiability Problem
7: Scheduling meets n-fold Integer Programming
8: Bipartite Correlation Clustering – Maximizing Agreements
9: Discrete Preference Games in Heterogeneous Social Networks: Subverted Majorities and the Swing Player
10: Ant-Inspired Density Estimation via Random Walks
11: Online Matching: Haste makes Waste!
12: Scenario Submodular Cover
13: Near-Optimal Sample Complexity Bounds for Circulant Binary Embedding
14: A Novel Algorithm for String Matching with Mismatches
15: Most Compact Parsimonious Trees
16: A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors
17: Sorting with Asymmetric Read and Write Costs
18: Near-Isometric Binary Hashing for Large-scale Datasets
19: The Runaway Rectangle Escape Problem