1. Connected dominating set in sensor networks and MANETs;Blum,2004
2. D.-Z. Du, Ker-I Ko, X.-D. Hu, Design and analysis of approximation algorithms, manuscript
3. Ding-Zhu Du, R.L. Graham, P.M. Pardalos, P.-J. Wan, W. Wu, W. Zhao, Analysis of greedy approximations with nonsubmodular potential functions, in: Proceedings of the 19th Annual ACM–SIAM Symposium on Dicrete Algorithms, SODA, 2008, pp. 167–175
4. Theory of Computational Complexity;Du,2000
5. Eubank Stephen, Kumar V.S. Anil, Madhav V. Marathe, Srinivasan Aravind, Wang Nan, Structural and algorithmic aspects of massive social networks, in: Proceedings of the 15th Annual ACM–SIAM symposium on Discrete Algorithms, SODA, 2004, pp. 718–727