1: An Extension of the Permutation Group Enumeration Technique (Collapse of the Polynomial Hierarchy: $\mathbf{NP = P}$)
2: Fast phylogeny reconstruction through learning of ancestral sequences
3: A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
4: Two Dimensional Connectivity for Vehicular Ad-Hoc Networks
5: Dynamic Complexity of Formal Languages
6: The convex hull of a regular set of integer vectors is polyhedral and effectively computable
7: Accelerated Data-Flow Analysis
8: Convex Hull of Arithmetic Automata
9: A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two
10: Performance of a greedy algorithm for edge covering by cliques in interval graphs
11: Characterizing Truthful Multi-Armed Bandit Mechanisms
12: Efficient Isomorphism Testing for a Class of Group Extensions
13: Approximating the least hypervolume contributor: NP-hard in general, but fast in practice