1: D$^2$-Tree: A New Overlay with Deterministic Bounds
2: Computing sparse multiples of polynomials
3: Simultaneous Interval Graphs
4: Center-based Clustering under Perturbation Stability
5: One, Two, Three and N Dimensional String Search Algorithms
6: A memory-efficient data structure representing exact-match overlap graphs with application for next generation DNA assembly
7: The Lazy Flipper: MAP Inference in Higher-Order Graphical Models by Depth-limited Exhaustive Search