1) Polylogarithmic Inapproximability of Radio Broadcast

2) Comparing min-power and min-cost node connectivity problems.

3) Rare Approximation Ratios

4) Tight approximation for connectivity augmentation problems

5) Approximation algorithm for non-uniform multicommodity buy at bulk

6) Shallow-light k-trees and k-trees for buy at bulk

7) Multicoloring: problems and techniques

8) Complete partitions of graphs

9) Finding graphs with maximum number of edges with girth at least g