1: Computing Minimal Polynomials of Matrices
2: Optimal Cache-Oblivious Mesh Layouts
3: Recognizing Partial Cubes in Quadratic Time
4: An Approximation Algorithm for Shortest Descending Paths
5: A note on module-composed graphs
6: A Tighter Analysis of Setcover Greedy Algorithm for Test Set
7: Scheduling Dags under Uncertainty