1: Adaptive Shivers Sort: An Alternative Sorting Algorithm
2: A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments
3: Legal Assignments and fast EADAM with consent via classical theory of stable matchings
4: Collapsing Superstring Conjecture
5: Almost optimal algorithms for diameter-optimally augmenting trees
6: Locally Private Learning without Interaction Requires Separation
7: Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming and Linear Algebra
8: Subexponential algorithms for variants of homomorphism problem in string graphs
9: Correlation Clustering Generalized
10: Finding Sparse Solutions for Packing and Covering Semidefinite Programs
11: An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time
12: Being Corrupt Requires Being Clever, But Detecting Corruption Doesn’t
13: Scheduling on (Un-)Related Machines with Setup Times
14: Probabilistic Analysis of Edge Elimination for Euclidean TSP
15: Distance and routing labeling schemes for cube-free median graphs
16: Reoptimization of Parameterized Problems
17: Industrial and Tramp Ship Routing Problems: Closing the Gap for Real-Scale Instances