Search the dblp DataBase
Ding-Zhu Du :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Ding-Zhu Du , My T. Thai , Yingshu Li , Dan Liu , Shiwei Zhu Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links. [Citation Graph (0, 0)][DBLP ] APWeb, 2006, pp:13-24 [Conf ] Ker-I Ko , Timothy J. Long , Ding-Zhu Du A Note on One- Way Functions and Polynomial Time Isomorphisms. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1986, pp:196-196 [Conf ] Ding-Zhu Du , Lusheng Wang , Baogang Xu The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:509-518 [Conf ] Liying Kang , Hong Qiao , Erfang Shan , Ding-Zhu Du Lower Bounds on the Minus Domination and k-Subdomination Numbers. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:375-383 [Conf ] Dongsoo S. Kim , Ding-Zhu Du Multirate Multicast Switching Networks. [Citation Graph (0, 0)][DBLP ] COCOON, 1998, pp:219-228 [Conf ] Guoliang Xue , Ding-Zhu Du O(n log n)-Average-Time Algorithm for Shortest Network under a Given Topology. [Citation Graph (0, 0)][DBLP ] COCOON, 1996, pp:11-20 [Conf ] Biao Gao , Ding-Zhu Du , Ronald L. Graham The Tight Lower Bound for the Steiner Ratio in Minkowski Planes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1994, pp:183-191 [Conf ] Ding-Zhu Du , Frank K. Hwang An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio [Citation Graph (0, 0)][DBLP ] FOCS, 1990, pp:76-85 [Conf ] Ding-Zhu Du , Yanjun Zhang , Qing Feng On Better Heuristic for Euclidean Steiner Minimum Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:431-439 [Conf ] Haizhou Chen , Bing Lu , Ding-Zhu Du Static Timing Analysis with False Paths. [Citation Graph (0, 0)][DBLP ] ICCD, 2000, pp:541-544 [Conf ] Xiaohua Jia , Deying Li , Xiao-Dong Hu , Ding-Zhu Du Placement of Read-Write Web Proxies in the Internet. [Citation Graph (0, 0)][DBLP ] ICDCS, 2001, pp:687-690 [Conf ] Ding-Zhu Du , Frank K. Hwang , Andrew M. Odlyzko , Yanjun Zhang Minimal-Distance Routing for Kykios II. [Citation Graph (0, 0)][DBLP ] ICPP, 1987, pp:546-549 [Conf ] Scott C.-H. Huang , Ding-Zhu Du New constructions on broadcast encryption key pre-distribution schemes. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2005, pp:515-523 [Conf ] Xiaohua Jia , Ding-Zhu Du , Xiao-Dong Hu , Hejiao Huang , Deying Li Placement of Wavelength Converters for Minimal Wavelength Usage in WDM Networks. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2002, pp:- [Conf ] Xiaohua Jia , Deying Li , Ding-Zhu Du QoS Topology Control in Ad Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2004, pp:- [Conf ] Guoliang Xue , Guo-Hui Lin , Ding-Zhu Du Grade of service Euclidean Steiner minimum trees. [Citation Graph (0, 0)][DBLP ] ISCAS (6), 1999, pp:182-185 [Conf ] Hung Quang Ngo , Ding-Zhu Du , Ronald L. Graham New Bounds on a Hypercube Coloring Problem and Linear Codes. [Citation Graph (0, 0)][DBLP ] ITCC, 2001, pp:542-546 [Conf ] Mihaela Cardei , Maggie Xiaoyan Cheng , Xiuzhen Cheng , Ding-Zhu Du Connected Domination in Multihop Ad Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP ] JCIS, 2002, pp:251-255 [Conf ] Feng Cao , Ding-Zhu Du , Shang-Hua Teng Fault-tolerant Properties of Pyramid Network. [Citation Graph (0, 0)][DBLP ] PDPTA, 1997, pp:1690-1693 [Conf ] Jiandong Huang , Ding-Zhu Du Resource Management for Continuous Multimedia Database Applications. [Citation Graph (0, 0)][DBLP ] IEEE Real-Time Systems Symposium, 1994, pp:46-54 [Conf ] Feng Cao , Ding-Zhu Du Fault-Tolerant Routing and Multicasting in Butterfly Networks. [Citation Graph (0, 0)][DBLP ] SAC, 1999, pp:455-460 [Conf ] Ker-I Ko , Timothy J. Long , Ding-Zhu Du A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1986, pp:295-303 [Conf ] Al Borchers , Ding-Zhu Du The k-Steiner ratio in graphs. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:641-649 [Conf ] Ding-Zhu Du , Yuh-Dauh Lyuu , D. Frank Hsu Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing. [Citation Graph (0, 0)][DBLP ] WG, 1991, pp:169-179 [Conf ] Xiaohua Jia , Deying Li , Xiao-Dong Hu , Hejiao Huang , Ding-Zhu Du Optimal Placement of Proxies of Replicated Web Servers in the Internet. [Citation Graph (0, 0)][DBLP ] WISE, 2000, pp:55-61 [Conf ] Ding-Zhu Du On Greedy Heuristics for Steiner Minimum Trees. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1995, v:13, n:4, pp:381-386 [Journal ] Ding-Zhu Du , Frank K. Hwang A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1992, v:7, n:2&3, pp:121-135 [Journal ] Ding-Zhu Du , Yanjun Zhang On Heuristics for Minimum Length Rectilinear Partitions. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1990, v:5, n:1, pp:111-128 [Journal ] Zi-Cheng Liu , Ding-Zhu Du On Steiner Minimal Trees with L_p Distance. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1992, v:7, n:2&3, pp:179-191 [Journal ] Lusheng Wang , Ding-Zhu Du Approximations for a Bottleneck Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2002, v:32, n:4, pp:554-561 [Journal ] Guoliang Xue , Ding-Zhu Du An O (n log n ) Average Time Algorithm for Computing the Shortest Network under a Given Topology. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1999, v:23, n:4, pp:354-362 [Journal ] Guoliang Xue , Guo-Hui Lin , Ding-Zhu Du Grade of Service Steiner Minimum Trees in the Euclidean Plane. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2001, v:31, n:4, pp:479-500 [Journal ] Xiaohua Jia , Deying Li , Xiao-Dong Hu , Ding-Zhu Du Optimal Placement of Web Proxies for Replicated Web Servers in the Internet. [Citation Graph (0, 0)][DBLP ] Comput. J., 2001, v:44, n:5, pp:329-339 [Journal ] Xiaohua Jia , Deying Li , Xiao-Dong Hu , Weili Wu , Ding-Zhu Du Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet. [Citation Graph (0, 0)][DBLP ] Comput. J., 2003, v:46, n:4, pp:378-390 [Journal ] Scott C.-H. Huang , Maggie Xiaoyan Cheng , Ding-Zhu Du GeoSENS: geo-based sensor network secure communication protocol. [Citation Graph (0, 0)][DBLP ] Computer Communications, 2006, v:29, n:4, pp:456-461 [Journal ] Xiaohua Jia , Ding-Zhu Du , Xiao-Dong Hu , Hejiao Huang , Deying Li On the optimal placement of wavelength converters in WDM networks. [Citation Graph (0, 0)][DBLP ] Computer Communications, 2003, v:26, n:9, pp:986-995 [Journal ] Ding-Zhu Du on Component-size Bounded Steiner Trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:131-140 [Journal ] Ding-Zhu Du , Frank K. Hwang Competitive Group Testing. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:45, n:3, pp:221-232 [Journal ] Ding-Zhu Du , Biao Gao , Weili Wu A Special Case for Subset Interconnection Designs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:51-60 [Journal ] Ding-Zhu Du , D. Frank Hsu , G. W. Peck Connectivity of Consecutive-d Digraphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1992, v:37, n:, pp:169-177 [Journal ] Peter C. Fishburn , Frank K. Hwang , Ding-Zhu Du , Biao Gao On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:75-87 [Journal ] Dongsoo S. Kim , Ding-Zhu Du , Panos M. Pardalos A coloring problem on the n-cube. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:307-311 [Journal ] Ding-Zhu Du , Daniel J. Kleitman Diameter and Radius in the Manhattan Metric. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1990, v:5, n:, pp:351-356 [Journal ] Ding-Zhu Du , Biao Gao , Ronald L. Graham , Zi-Cheng Liu , Peng-Jun Wan Minimum Steiner Trees in Normed Planes. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1993, v:9, n:, pp:351-370 [Journal ] Ding-Zhu Du , Frank K. Hwang , G. D. Song , G. Y. Ting Steiner Minimal Trees on Sets of Four Points. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1987, v:2, n:, pp:401-414 [Journal ] Ding-Zhu Du , Frank K. Hwang , J. F. Weng Steiner Minimal Trees for Regular Polygons. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1987, v:2, n:, pp:65-84 [Journal ] Frank K. Hwang , G. D. Song , G. Y. Ting , Ding-Zhu Du A Decomposition Theorem on Euclidean Steiner Minimal Trees. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1988, v:3, n:, pp:367-382 [Journal ] Ding-Zhu Du , D. Frank Hsu , Hung Quang Ngo , G. W. Peck On connectivity of consecutive-d digraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:257, n:2-3, pp:371-384 [Journal ] Sui-Xiang Gao , Ding-Zhu Du , Xiao-Dong Hu , Xiaohua Jia Rivest-Vuillemin conjecture is true for monotone boolean functions with twelve variables. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:253, n:1-3, pp:19-34 [Journal ] Hung Q. Ngo , Ding-Zhu Du New constructions of non-adaptive and error-tolerance pooling designs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:243, n:1-3, pp:161-170 [Journal ] Tao Jiang , Ming Li , Ding-Zhu Du A Note on Shortest Superstrings with Flipping. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:44, n:4, pp:195-199 [Journal ] Hung Q. Ngo , Ding-Zhu Du , Ronald L. Graham New bounds on a hypercube coloring problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:84, n:5, pp:265-269 [Journal ] Ronald V. Book , Ding-Zhu Du The existence and density of generalized complexity cores. [Citation Graph (0, 0)][DBLP ] J. ACM, 1987, v:34, n:3, pp:718-730 [Journal ] Al Borchers , Ding-Zhu Du , Biao Gao , Peng-Jun Wan The k -Steiner Ratio in the Rectilinear Plane. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:29, n:1, pp:1-17 [Journal ] Ding-Zhu Du , Ker-I Ko A note on best fractions of a computable real number. [Citation Graph (0, 0)][DBLP ] J. Complexity, 1992, v:8, n:3, pp:216-229 [Journal ] Sui-Xiang Gao , Weili Wu , Ding-Zhu Du , Xiao-Dong Hu The Rivest-Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables. [Citation Graph (0, 0)][DBLP ] J. Complexity, 1999, v:15, n:4, pp:526-536 [Journal ] Ding-Zhu Du Editorial. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2000, v:4, n:1, pp:5-5 [Journal ] Ding-Zhu Du Book Review: Discrete Analysis and Operation Research. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 1997, v:1, n:1, pp:105- [Journal ] Ding-Zhu Du , Frank K. Hwang A Multiplication Theorem for Balanced Howell Rotations. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1984, v:37, n:2, pp:121-126 [Journal ] Ding-Zhu Du , Warren D. Smith Disproofs of Generalized Gilbert - Pollak Conjecture on the Steiner Ratio in Three or More Dimensions. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1996, v:74, n:1, pp:115-130 [Journal ] Ding-Zhu Du , D. Frank Hsu , Frank K. Hwang , X. M. Zhang The Hamiltonian property of generalized de Bruijn digraphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:1-8 [Journal ] Ding-Zhu Du , Frank K. Hwang , E. Y. Yao The Steiner Ratio Conjecture Is True for Five Points. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1985, v:38, n:2, pp:230-240 [Journal ] Ding-Zhu Du , E. Y. Yao , Frank K. Hwang A Short Proof of a Result of Pollak on Steiner Minimal Trees. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1982, v:32, n:3, pp:396-400 [Journal ] Mihaela Cardei , David Maccallum , Maggie Xiaoyan Cheng , Manki Min , Xiaohua Jia , Deying Li , Ding-Zhu Du Wireless Sensor Networks with Energy Efficient Organization. [Citation Graph (0, 0)][DBLP ] Journal of Interconnection Networks, 2002, v:3, n:3-4, pp:213-229 [Journal ] Sourav Bhattacharya , Gary Elsesser , Wei-Tek Tsai , Ding-Zhu Du Multicasting in Generalized Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1994, v:22, n:1, pp:80-95 [Journal ] Xiao-Dong Hu , Xiaohua Jia , Ding-Zhu Du , Frank K. Hwang Monotone Routing in Multirate Rearrangeable Clos Networks. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2001, v:61, n:9, pp:1382-1388 [Journal ] Xiao-Dong Hu , Xiaohua Jia , Ding-Zhu Du , Deying Li , Hejiao Huang Placement of Data Replicas for Optimal Data Availability in Ring Networks. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2001, v:61, n:10, pp:1412-1424 [Journal ] Ding-Zhu Du , Yanjun Zhang On better heuristics for Steiner minimum trees. [Citation Graph (0, 0)][DBLP ] Math. Program., 1992, v:57, n:, pp:193-202 [Journal ] Xiuzhen Cheng , Xiao Huang , Deying Li , Weili Wu , Ding-Zhu Du A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. [Citation Graph (0, 0)][DBLP ] Networks, 2003, v:42, n:4, pp:202-208 [Journal ] Jiandong Huang , Peng-Jun Wan , Ding-Zhu Du Criticality- and QoS-Based Multiresource Negotiation and Adaptation. [Citation Graph (0, 0)][DBLP ] Real-Time Systems, 1998, v:15, n:3, pp:249-273 [Journal ] Ding-Zhu Du , Frank K. Hwang Reducing the Steiner Problem in a Normed Space. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1992, v:21, n:6, pp:1001-1007 [Journal ] Ding-Zhu Du , Haesun Park On Competitive Group Testing. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:5, pp:1019-1025 [Journal ] Al Borchers , Ding-Zhu Du The k-Steiner Ratio in Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:857-869 [Journal ] Ding-Zhu Du , Biao Gao , Frank K. Hwang , J. H. Kim On Multirate Rearrangeable Clos Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:2, pp:463-470 [Journal ] Ding-Zhu Du , Guoliang Xue , S.-Z. Sun , Siu-Wing Cheng Modifications of Competitive Group Testing. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:1, pp:82-96 [Journal ] Guo-Hui Lin , Ding-Zhu Du , Xiao-Dong Hu , Guoliang Xue On Rearrangeability of Multirate Clos Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:28, n:4, pp:1225-1231 [Journal ] Ding-Zhu Du , Frank K. Hwang Optimal Assembly of an s -Stage k -OUT-OF-n System. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1990, v:3, n:3, pp:349-354 [Journal ] Ding-Zhu Du , Zevi Miller Matroids and Subset Interconnection Design. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1988, v:1, n:4, pp:416-424 [Journal ] Ding-Zhu Du , Frank K. Hwang , Xiaohua Jia , Hung Q. Ngo Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2002, v:15, n:3, pp:305-316 [Journal ] Ding-Zhu Du , Frank K. Hwang , Guoliang Xue Interconnecting Highways. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:2, pp:252-261 [Journal ] Feng Cao , Ding-Zhu Du , D. Frank Hsu , Shang-Hua Teng Fault Tolerance Properties of Pyramid Networks. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1999, v:48, n:1, pp:88-93 [Journal ] Maggie Xiaoyan Cheng , Mihaela Cardei , Jianhua Sun , Xiaochun Cheng , Lusheng Wang , Yinfeng Xu , Ding-Zhu Du Topology Control of Ad Hoc Wireless Networks for Energy Efficiency. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 2004, v:53, n:12, pp:1629-1635 [Journal ] Ding-Zhu Du , D. Frank Hsu , Frank K. Hwang Doubly Linked Ring Networks. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1985, v:34, n:9, pp:853-855 [Journal ] Ding-Zhu Du , Yuh-Dauh Lyuu , D. Frank Hsu Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1993, v:42, n:5, pp:612-616 [Journal ] Jun Gu , Qian-Ping Gu , Ding-Zhu Du Convergence Properties of Optimization Algorithms for the SAT Problem. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1996, v:45, n:2, pp:209-219 [Journal ] Lu Ruan , Ding-Zhu Du , Xiao-Dong Hu , Xiaohua Jia , Deying Li , Zheng Sun Converter Placement Supporting Broadcast in WDM Optical Networks. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 2001, v:50, n:7, pp:750-758 [Journal ] Ronald V. Book , Ding-Zhu Du The Structure of Generalized Complexity Cores. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1988, v:61, n:, pp:103-119 [Journal ] Donghui Chen , Ding-Zhu Du , Xiao-Dong Hu , Guo-Hui Lin , Lusheng Wang , Guoliang Xue Approximations for Steiner trees with minimum number of Steiner points. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:262, n:1, pp:83-99 [Journal ] Ding-Zhu Du , Ronald V. Book On Inefficient Special Cases of NP-Complete Problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1989, v:63, n:3, pp:239-252 [Journal ] Ding-Zhu Du , Ker-I Ko In Memoriam Ronald V. Book. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:207, n:1, pp:1-3 [Journal ] Ding-Zhu Du , Ming Li Foreword (COCOON'95). [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:181, n:2, pp:227- [Journal ] Ding-Zhu Du , Peter Eades , Xuemin Lin Foreword. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:289, n:2, pp:877- [Journal ] Liying Kang , Hong Qiao , Erfang Shan , Ding-Zhu Du Lower bounds on the minus domination and k-subdomination numbers. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:296, n:1, pp:89-98 [Journal ] Dongsoo S. Kim , Ding-Zhu Du Multirate multicast switching networks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:261, n:2, pp:241-251 [Journal ] Ker-I Ko , Timothy J. Long , Ding-Zhu Du On One-Way Functions and Polynomial-Time Isomorphisms. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1986, v:47, n:3, pp:263-276 [Journal ] Yingshu Li , My T. Thai , Feng Wang 0002 , Ding-Zhu Du On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Mob. Comput., 2006, v:5, n:10, pp:1460-1470 [Journal ] Dongsoo S. Kim , Ding-Zhu Du Performance of split routing algorithm for three-stage multicast networks. [Citation Graph (0, 0)][DBLP ] IEEE/ACM Trans. Netw., 2000, v:8, n:4, pp:526-534 [Journal ] Maggie Xiaoyan Cheng , David H.-C. Du , Ding-Zhu Du Location management in mobile ad hoc wireless networks using quorums and clusters. [Citation Graph (0, 0)][DBLP ] , 2005, v:, n:, pp:793-803 [Journal ] Yingshu Li , My T. Thai , Feng Wang 0002 , Chih-Wei Yi , Peng-Jun Wan , Ding-Zhu Du On greedy construction of connected dominating sets in wireless networks. [Citation Graph (0, 0)][DBLP ] , 2005, v:, n:, pp:927-932 [Journal ] Guoliang Xue , Ding-Zhu Du , Feng Cao Recent advances in wireless ad hoc networks. [Citation Graph (0, 0)][DBLP ] , 2006, v:, n:, pp:147-149 [Journal ] Mihaela Cardei , Ding-Zhu Du Improving Wireless Sensor Network Lifetime through Power Aware Organization. [Citation Graph (0, 0)][DBLP ] Wireless Networks, 2005, v:11, n:3, pp:333-340 [Journal ] My T. Thai , Yingshu Li , Ding-Zhu Du , Chunyu Ai On the construction of energy-efficient broadcast tree with Hitch-hiking in wireless networks. [Citation Graph (0, 0)][DBLP ] IPCCC, 2005, pp:135-139 [Conf ] Frank K. Hwang , Jia Feng Weng , Ding-Zhu Du A class of full Steiner minimal trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:45, n:1, pp:107-112 [Journal ] Feng Cao , Ding-Zhu Du , D. Frank Hsu , Lihui Hwang , Weili Wu Super line-connectivity of consecutive-d digraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:183, n:1-3, pp:27-38 [Journal ] Peng-Jun Wan , Ding-Zhu Du , Ronald L. Graham The Steiner ratio for the dual normed plane. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:171, n:1-3, pp:261-275 [Journal ] Peng-Jun Wan , Ding-Zhu Du A (log2 3+1/2) competitive algorithm for the counterfeit coin problem. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:163, n:1-3, pp:173-200 [Journal ] Ding-Zhu Du , D. Frank Hsu Partitionable starters for twin prime power type. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:87, n:1, pp:23-28 [Journal ] Biao Gao , Ding-Zhu Du , Ronald L. Graham A tight lower bound for the Steiner ratio in Minkowski planes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1995, v:142, n:1-3, pp:49-63 [Journal ] Ding-Zhu Du , D. Frank Hsu , Yuh-Dauh Lyuu On the diameter vulnerability of Kautz digraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:151, n:1-3, pp:81-85 [Journal ] H. B. Chen , Ding-Zhu Du , Frank K. Hwang An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2007, v:14, n:2-3, pp:121-129 [Journal ] Zhi-Zhong Chen , Xiaotie Deng , Ding-Zhu Du Preface. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:378, n:3, pp:209-210 [Journal ] My T. Thai , Feng Wang 0002 , Dan Liu , Shiwei Zhu , Ding-Zhu Du Connected Dominating Sets in Wireless Networks with Different Transmission Ranges. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Mob. Comput., 2007, v:6, n:7, pp:721-730 [Journal ] Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. [Citation Graph (, )][DBLP ] Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks. [Citation Graph (, )][DBLP ] Performance Limits of Fair-Access in Underwater Sensor Networks. [Citation Graph (, )][DBLP ] Cooperative Bridges: Topology Control in Cooperative Wireless Ad Hoc Networks. [Citation Graph (, )][DBLP ] Analysis of greedy approximations with nonsubmodular potential functions. [Citation Graph (, )][DBLP ] PTAS for Minimum Connected Dominating Set in Unit Ball Graph. [Citation Graph (, )][DBLP ] Fault-Tolerant Dual Power Management in Wireless Sensor Networks. [Citation Graph (, )][DBLP ] Preface. [Citation Graph (, )][DBLP ] The complexity of determinacy problem on group testing. [Citation Graph (, )][DBLP ] Search in 0.011secs, Finished in 0.016secs