default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDing-Zhu Du
- > Home > Persons > Ding-Zhu Du
Publications
- 2018
[j182]Chenchen Wu, Yishui Wang, Zaixin Lu, Panos M. Pardalos, Dachuan Xu
, Zhao Zhang, Ding-Zhu Du:
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming. Math. Program. 169(1): 255-275 (2018)- 2017
- [j175]Guangmo Tong, Weili Wu, Panos M. Pardalos, Ding-Zhu Du:
On positive-influence target-domination. Optim. Lett. 11(2): 419-427 (2017) - 2014
- [j158]Zaixin Lu, Lidong Wu, Panos M. Pardalos, Eugene Maslov, Wonjun Lee, Ding-Zhu Du:
Routing-efficient CDS construction in Disk-Containment Graphs. Optim. Lett. 8(2): 425-434 (2014) - 2011
- [j142]Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos:
Preface. Theor. Comput. Sci. 412(3): 191 (2011) - 2010
- [j138]Peng-Jun Wan, Ding-Zhu Du, Panos M. Pardalos, Weili Wu:
Greedy approximations for minimum submodular cover with submodular cost. Comput. Optim. Appl. 45(2): 463-474 (2010) - [j133]Weili Wu, Xiaofeng Gao, Panos M. Pardalos, Ding-Zhu Du:
Wireless networking, dominating and packing. Optim. Lett. 4(3): 347-358 (2010) - 2009
- [e18]Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos:
Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings. Lecture Notes in Computer Science 5573, Springer 2009, ISBN 978-3-642-02025-4 [contents] - [r6]Ding-Zhu Du, Panos M. Pardalos, Weili Wu:
History of Optimization. Encyclopedia of Optimization 2009: 1538-1542 - [r5]Ding-Zhu Du, Panos M. Pardalos, Weili Wu:
Rosen's Method, Global Convergence, and Powell's Conjecture. Encyclopedia of Optimization 2009: 3345-3354 - [r4]Ding-Zhu Du, Bing Lu, Hung Q. Ngo, Panos M. Pardalos:
Steiner Tree Problems. Encyclopedia of Optimization 2009: 3723-3736 - 2008
- [c39]Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, Peng-Jun Wan, Weili Wu, Wenbo Zhao:
Analysis of greedy approximations with nonsubmodular potential functions. SODA 2008: 167-175 - 2004
- [c32]Manki Min, Feng Wang, Ding-Zhu Du, Panos M. Pardalos:
A reliable virtual backbone scheme in mobile ad-hoc networks. MASS 2004: 60-69 - 2000
- [j74]Dongsoo S. Kim, Ding-Zhu Du, Panos M. Pardalos:
A coloring problem on the n-cube. Discret. Appl. Math. 103(1-3): 307-311 (2000) - [e9]Ding-Zhu Du, Panos M. Pardalos, Jie Wang:
Discrete Mathematical Problems with Medical Applications, Proceedings of a DIMACS Workshop, December 8-10, 1999. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 55, DIMACS/AMS 2000, ISBN 978-0-8218-2096-4 [contents] - 1999
- [e8]Ding-Zhu Du, Panos M. Pardalos:
Handbook of Combinatorial Optimization. Springer 1999, ISBN 978-1-4419-4813-7 [contents] - [e7]Peng-Jun Wan, Ding-Zhu Du, Panos M. Pardalos:
Multichannel Optical Networks: Theory and Practice, Proceedings of a DIMACS Workshop, March 16-19, 1998. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 46, DIMACS/AMS 1999, ISBN 978-0-8218-1004-0 [contents] - 1998
- [c17]Dongsoo S. Kim, Ding-Zhu Du, Panos M. Pardalos:
On conflict-free channel set assignments for optical cluster-based hypercube networks. Multichannel Optical Networks: Theory and Practice 1998: 109-116 - [e6]Panos M. Pardalos, Ding-Zhu Du:
Network Design: Connectivity and Facilities Location, Proceedings of a DIMACS Workshop, Princetin, New Jersey, USA, April 28-30, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 40, DIMACS/AMS 1998, ISBN 978-0-8218-0834-4 [contents] - 1997
- [e3]Ding-Zhu Du, Jun Gu, Panos M. Pardalos:
Satisfiability Problem: Theory and Applications, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 11-13, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 35, DIMACS/AMS 1997, ISBN 978-0-8218-0479-7 [contents] - 1994
- [j45]Ding-Zhu Du, Panos M. Pardalos:
A continuous version of a result of Du and Hwang. J. Glob. Optim. 5(2): 127-129 (1994) - 1993
- [j35]B. N. Khoury, Panos M. Pardalos, Ding-Zhu Du:
A test problem generator for the Steiner problem in graphs. ACM Trans. Math. Softw. 19(4): 509-522 (1993)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
