1: Randomized partition trees for exact nearest neighbor search
2: An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree
3: On the Tradeoff between Stability and Fit
4: The two-edge connectivity survivable-network design problem in planar graphs
5: Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
6: No-Wait Flowshop Scheduling is as Hard as Asymmetric Traveling Salesman Problem
7: Planar Hypohamiltonian Graphs on 40 Vertices
8: Adaptive Metric Dimensionality Reduction
9: Lock-free Concurrent Data Structures
10: Acquaintance Time of a Graph
11: Minimum length path decompositions
12: Randomized online computation with high probability guarantees
13: Structural Diversity for Resisting Community Identification in Published Social Networks
14: Yet another approach to the Maximum Flow
15: A Sufficiently Fast Algorithm for Finding Close to Optimal Junction Trees
16: An Improved Integrality Gap for Asymmetric TSP Paths
17: Alphabet-Dependent String Searching with Wexponential Search Trees
18: The min-max edge q-coloring problem
19: A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor