1: How to Extract the Geometry and Topology from Very Large 3D Segmentations
2: L1 Projections with Box Constraints
3: Comparative Performance of Tabu Search and Simulated Annealing Heuristics for the Quadratic Assignment Problem
4: Polynomial-time sortable stacks of burnt pancakes
5: Oblivious Buy-at-Bulk in Planar Graphs
6: Oblivious Algorithms for the Maximum Directed Cut Problem
7: Analyzing Network Coding Gossip Made Easy
8: Implementing regularization implicitly via approximate eigenvector computation
9: Methods for Accelerating Conway’s Doomsday Algorithm (part 2)
10: Engineering Time-dependent One-To-All Computation
11: Superselectors: Efficient Constructions and Applications
12: Cut-Matching Games on Directed Graphs
13: Faster Polynomial Multiplication via Discrete Fourier Transforms
14: XML Query Processing and Query Languges: A Survey
15: Searching in Dynamic Tree-Like Partial Orders
16: Hitting forbidden minors: Approximation and Kernelization