1: Near-Optimal Deterministic Algorithms for Volume Computation and Lattice Problems via M-Ellipsoids
2: Implementation of exponential and parametrized algorithms in the AGAPE project
3: A parallel approximation algorithm for mixed packing and covering semidefinite programs
4: Quasiperiodicities in Fibonacci strings
5: A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication
6: k-Probe DH-graphs
7: Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
8: The black-and-white coloring problem on permutation graphs
9: The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)
10: Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract)
11: Advanced Coarsening Schemes for Graph Partitioning