1: Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps
2: Bottom-Left Placement Theorem for Rectangle Packing
3: Counting Perfect Matchings as Fast as Ryser
4: An Algorithm to Generate Square-Free Numbers and to Compute the Moebius Function
5: Constant-time filtering using shiftable kernels
6: Computing the obstacle number of a plane graph
7: Approximation Algorithms for Digraph Width Parameters
8: Counting Square-Free Numbers
9: Approximating minimum-power edge-multicovers
10: Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
11: Matroidal Degree-Bounded Minimum Spanning Trees
12: Multi Layer Analysis
13: Edge-coloring series-parallel multigraphs
14: Bidirectional Pipelining for Scalable IP Lookup and Packet Classification
15: The solution space geometry of random linear equations