1: A new distance for high level RNA secondary structure comparison
2: Locally computable approximations for spectral clustering and absorption times of random walks
3: Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems
4: Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves
5: A constructive proof of the Lovasz Local Lemma
6: Exponential-Time Approximation of Hard Problems
7: FPT Algorithms and Kernels for the Directed $k$-Leaf Problem