1: Tandem halving problems by DCJ 2: Practical Groebner Basis Computation 3: Optimal Dynamic Sequence Representations 4: Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs 5: Routing Regardless of Network Stability