1) Polylogarithmic Inapproximability of Radio Broadcast

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

3) Rare Approximation Ratios

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

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

6) Multicoloring: problems and techniques

7) Complete partitions of graphs

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

9) Robust network design with exponential scenarios

10) Approximating the directed version of the Steiner forest problem

11) Increasing the connectivity of a graph from 1 to 2

12) Approximating some network-design problems with node costs

13) Tight approximation Algorithms for connectivity Augmentation problems.