1. Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and MANETs. In: Handbook of Combinatorial Optimization, vol. B, pp. 329–369. Springer, Heidelberg (2005)
2. Daligault, J., Gutin, G., Kim, E.J., Yeo, A.: FPT algorithms and kernels for the directed k-leaf problem. Journal of Computer and System Sciences 76(2), 144–152 (2010)
3. Lecture Notes in Computer Science;J. Daligault,2009
4. Drescher, M., Vetta, A.: An approximation algorithm for the Maximum Leaf Spanning Arborescence problem. ACM Transactions on Algorithms (in Press, 2008)
5. Fernau, H., Fomin, F.V., Lokshtanov, D., Raible, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: On out-trees with many leaves. In: STACS. Dagstuhl Seminar Proceedings, vol. 09001, pp. 421–432 (2009)