1. Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, Lausanne, Switzerland, 9–11 June 2002
2. Ambuehl, C., Erlebach, T., Mihalak, M., Nunkesser M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of the 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, LNCS 4110, pp. 3–14. Springer (2006)
3. Bharghavan, V., Das, B.: Routing in ad hoc networks using minimum connected dominating sets. In: International Conference on Communication, Montreal, Canada, June 1997
4. Butenko, S., Ursulenko, O.: On minimum connected dominating set problem in unit-ball graphs. Preprint
5. Cadei, M., Cheng, M.X., Cheng, X., Du, D.-Z.: Connected domination in ad hoc wireless networks. In: Proceedings of the Sixth International Conference on Computer Science and Informatics (CS&I’2002) (2002)