1 Introduction  
1.1 Backgrounds  
1.2 Further terminology and notation  

2 Directed Steiner tree packing problem  
2.1 General digraphs  
2.2 Symmetric digraphs and Eulerian digraphs  
2.3 Related topics  

3 Directed Steiner path packing problem  
3.1 Results for IDSPP  
3.2 Results for ADSPP  
3.3 Related topic: directed path connectivity  

4 Strong subgraph packing problem  
4.1 General digraphs  
4.2 Semi-complete digraphs, symmetric digraphs and Eulerian digraphs  
4.3 Inapproximability results on ISSP and ASSP  
4.4 Related topics  

5 Strong arc decomposition problem  
5.1 Semi-complete digraphs and locally semi-complete digraphs  
5.2 Digraph compositions  
5.3 Digraph products  
5.4 Related topics  

6 Directed Steiner cycle packing problem  
6.1 Results for IDSCP  
6.2 Results for ADSCP