1: A Versatile Algorithm to Generate Various Combinatorial Structures
2: The Sorting Buffer Problem is NP-hard
3: Testing Simultaneous Planarity when the Common Graph is 2-Connected
4: A PTAS for Scheduling with Tree Assignment Restrictions
5: Improving PPSZ for 3-SAT using Critical Variables
6: Dynamic scheduling of virtual machines running hpc workloads in scientific grids
7: An Efficient Implementation of the Robust Tabu Search Heuristic for Sparse Quadratic Assignment Problems
8: Kolmogorov complexity, Lovasz local lemma and critical exponents
9: FAST: Kernelization based on Graph Modular Decomposition
10: Efficient Clustering with Limited Distance Information
11: The Straight-Line RAC Drawing Problem is NP-Hard
12: Testing Closeness of Discrete Distributions
13: Determining All Maximum Uniquely Restricted Matching in Bipartite Graphs
14: Priority Queues with Multiple Time Fingers