Ding-Zhu Du
Affiliations: | University of Minnesota, Twin Cities, Minneapolis, MN |
Area:
Computer Science, MathematicsGoogle:
"Ding-Zhu Du"Children
Sign in to add traineeShituo Han | grad student | 2001 | UMN |
Yunjae Jung | grad student | 2001 | UMN |
Joonmo Kim | grad student | 2001 | UMN |
Hung Q. Ngo | grad student | 2001 | UMN |
Lu Ruan | grad student | 2001 | UMN |
Quanzhan Zheng | grad student | 2001 | UMN |
Xiuzhen Cheng | grad student | 2002 | UMN |
Ionut E. Cardei | grad student | 2003 | UMN |
Mihaela Cardei | grad student | 2003 | UMN |
Maggie X. Cheng | grad student | 2003 | UMN |
Haizhou Chen | grad student | 2004 | UMN |
Scott C. Huang | grad student | 2004 | UMN |
Manki Min | grad student | 2004 | UMN |
Xiaoyu Wu | grad student | 2004 | UMN |
Yingshu Li | grad student | 2005 | UMN |
My T. Thai | grad student | 2005 | UMN |
David J. MacCallum | grad student | 2007 | UMN |
Shiwei Zhu | grad student | 2009 | UMN |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Yan R, Li D, Wu W, et al. (2020) Minimizing Influence of Rumors by Blockers on Social Networks: Algorithms and Analysis Ieee Transactions On Network Science and Engineering. 7: 1067-1078 |
Tong G, Wu W, Guo L, et al. (2020) An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks Ieee Transactions On Network Science and Engineering. 7: 845-854 |
Fan Y, Liu W, Guo D, et al. (2020) Shuffle Scheduling for MapReduce Jobs Based on Periodic Network Status Ieee Acm Transactions On Networking. 28: 1832-1844 |
Gong S, Nong Q, Sun T, et al. (2020) Maximize a monotone function with a generic submodularity ratio Theoretical Computer Science |
Fang Q, Chen X, Nong Q, et al. (2020) General Rumor Blocking: An efficient random algorithm with martingale approach Theoretical Computer Science. 803: 82-93 |
Fan Y, Wang C, Zhang B, et al. (2020) Data placement in distributed data centers for improved SLA and network cost Journal of Parallel and Distributed Computing. 146: 189-200 |
Zhang Y, Hou L, Hou B, et al. (2020) On the metric dimension of the folded n-cube Optimization Letters. 14: 249-257 |
Chen Z, Zhang Z, Ran Y, et al. (2020) Data mule scheduling on a path with handling time and time span constraints Optimization Letters. 14: 1701-1710 |
Li X, Zhang Z, Yang R, et al. (2020) Approximation algorithms for capacitated partial inverse maximum spanning tree problem Journal of Global Optimization. 77: 319-340 |
Guo L, Li D, Wang Y, et al. (2019) Maximisation of the number of β-view covered targets in visual sensor networks International Journal of Sensor Networks. 29: 226 |