1: Parameterized complexity results for 1-safe Petri nets
2: A Library for Implementing the Multiple Hypothesis Tracking Algorithm
3: Unconstrained and Constrained Fault-Tolerant Resource Allocation
4: A simple algorithm for the evaluation of the hypergeometric series using quasi-linear time and linear space
5: On vertex covers and matching number of trapezoid graphs
6: Relative Lempel-Ziv Factorization for Efficient Storage and Retrieval of Web Collections
7: SparseAssembler: de novo Assembly with the Sparse de Bruijn Graph
8: Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle
9: Geometric Simultaneous RAC Drawings of Graphs
10: Complexity of multivariate polynomial evaluation