| 2009 |
|---|
| 138 | EE | Ding-Zhu Du,
Panos M. Pardalos,
Weili Wu:
History of Optimization.
Encyclopedia of Optimization 2009: 1538-1542 |
| 137 | EE | Ding-Zhu Du,
Panos M. Pardalos,
Weili Wu:
Rosen's Method, Global Convergence, and Powell's Conjecture.
Encyclopedia of Optimization 2009: 3345-3354 |
| 136 | EE | Ding-Zhu Du,
Bing Lu,
Huang Ngo,
Panos M. Pardalos:
Steiner Tree Problems.
Encyclopedia of Optimization 2009: 3723-3736 |
| 135 | EE | Donghyun Kim,
Yiwei Wu,
Yingshu Li,
Feng Zou,
Ding-Zhu Du:
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks.
IEEE Trans. Parallel Distrib. Syst. 20(2): 147-157 (2009) |
| 2008 |
|---|
| 134 | | Manindra Agrawal,
Ding-Zhu Du,
Zhenhua Duan,
Angsheng Li:
Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings
Springer 2008 |
| 133 | | Boting Yang,
Ding-Zhu Du,
Cao An Wang:
Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings
Springer 2008 |
| 132 | | Yingshu Li,
Dung T. Huynh,
Sajal K. Das,
Ding-Zhu Du:
Wireless Algorithms, Systems, and Applications, Third International Conference, WASA 2008, Dallas, TX, USA, October 26-28, 2008. Proceedings
Springer 2008 |
| 131 | EE | Ding-Zhu Du:
Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs.
AAIM 2008: 1 |
| 130 | EE | Chen Wang,
Myung Ah Park,
James Willson,
Andras Farago,
Ding-Zhu Du:
Fault-Tolerant Dual Power Management in Wireless Sensor Networks.
GLOBECOM 2008: 436-441 |
| 129 | EE | 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 |
| 128 | EE | Zhao Zhang,
Xiaofeng Gao,
Weili Wu,
Ding-Zhu Du:
PTAS for Minimum Connected Dominating Set in Unit Ball Graph.
WASA 2008: 154-161 |
| 127 | EE | Xiuzhen Cheng,
Feng Wang,
Ding-Zhu Du:
Connected Dominating Set.
Encyclopedia of Algorithms 2008 |
| 126 | EE | Xiaotie Deng,
Ding-Zhu Du:
Preface.
Algorithmica 51(3): 237-238 (2008) |
| 125 | EE | Feng Wang,
My T. Thai,
Yingshu Li,
Xiuzhen Cheng,
Ding-Zhu Du:
Fault-Tolerant Topology Control for All-to-One and One-to-All Communication in Wireles Networks.
IEEE Trans. Mob. Comput. 7(3): 322-331 (2008) |
| 124 | EE | Liran Ma,
Amin Y. Teymorian,
Kai Xing,
Ding-Zhu Du:
An one-way function based framework for pairwise key establishment in sensor networks.
IJSN 3(4): 217-225 (2008) |
| 123 | EE | Yongxi Cheng,
Ding-Zhu Du:
New Constructions of One- and Two-Stage Pooling Designs.
Journal of Computational Biology 15(2): 195-205 (2008) |
| 122 | EE | Xiuzhen Cheng,
Ding-Zhu Du,
Lusheng Wang,
Baogang Xu:
Relay sensor placement in wireless sensor networks.
Wireless Networks 14(3): 347-355 (2008) |
| 2007 |
|---|
| 121 | EE | My T. Thai,
Feng Wang,
Dan Liu,
Shiwei Zhu,
Ding-Zhu Du:
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges.
IEEE Trans. Mob. Comput. 6(7): 721-730 (2007) |
| 120 | EE | Feng Wang,
Kuai Xu,
My T. Thai,
Ding-Zhu Du:
Fault tolerant topology control for one-to-all communications in symmetric wireless networks.
IJSNet 2(3/4): 163-168 (2007) |
| 119 | EE | 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.
J. Comb. Optim. 14(2-3): 121-129 (2007) |
| 118 | EE | Yongxi Cheng,
Ding-Zhu Du:
Efficient Constructions of Disjunct Matrices with Applications to DNA Library Screening.
Journal of Computational Biology 14(9): 1208-1216 (2007) |
| 117 | EE | Zhi-Zhong Chen,
Xiaotie Deng,
Ding-Zhu Du:
Preface.
Theor. Comput. Sci. 378(3): 209-210 (2007) |
| 2006 |
|---|
| 116 | EE | Ding-Zhu Du,
My T. Thai,
Yingshu Li,
Dan Liu,
Shiwei Zhu:
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links.
APWeb 2006: 13-24 |
| 115 | EE | Scott C.-H. Huang,
Maggie Xiaoyan Cheng,
Ding-Zhu Du:
GeoSENS: geo-based sensor network secure communication protocol.
Computer Communications 29(4): 456-461 (2006) |
| 114 | EE | Yingshu Li,
My T. Thai,
Feng Wang,
Ding-Zhu Du:
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay.
IEEE Trans. Mob. Comput. 5(10): 1460-1470 (2006) |
| 113 | EE | Ding-Zhu Du,
Frank K. Hwang,
Weili Wu,
Taieb Znati:
New Construction for Transversal Design.
Journal of Computational Biology 13(4): 990-995 (2006) |
| 112 | EE | Guoliang Xue,
Ding-Zhu Du,
Feng Cao:
Recent advances in wireless ad hoc networks.
Wireless Communications and Mobile Computing 6: 147-149 (2006) |
| 2005 |
|---|
| 111 | | Xiaotie Deng,
Ding-Zhu Du:
Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings
Springer 2005 |
| 110 | EE | Scott C.-H. Huang,
Ding-Zhu Du:
New constructions on broadcast encryption key pre-distribution schemes.
INFOCOM 2005: 515-523 |
| 109 | EE | My T. Thai,
Yingshu Li,
Ding-Zhu Du,
Chunyu Ai:
On the construction of energy-efficient broadcast tree with Hitch-hiking in wireless networks.
IPCCC 2005: 135-139 |
| 108 | EE | Ding-Zhu Du,
Frank K. Hwang:
Identifying d positive clones in the presence of inhibitors.
IJBRA 1(2): 162-168 (2005) |
| 107 | EE | Maggie Xiaoyan Cheng,
David Hung-Chang Du,
Ding-Zhu Du:
Location management in mobile ad hoc wireless networks using quorums and clusters.
Wireless Communications and Mobile Computing 5: 793-803 (2005) |
| 106 | EE | Yingshu Li,
My T. Thai,
Feng Wang,
Chih-Wei Yi,
Peng-Jun Wan,
Ding-Zhu Du:
On greedy construction of connected dominating sets in wireless networks.
Wireless Communications and Mobile Computing 5: 927-932 (2005) |
| 105 | EE | Mihaela Cardei,
Ding-Zhu Du:
Improving Wireless Sensor Network Lifetime through Power Aware Organization.
Wireless Networks 11(3): 333-340 (2005) |
| 2004 |
|---|
| 104 | EE | Xiaohua Jia,
Deying Li,
Ding-Zhu Du:
QoS Topology Control in Ad Hoc Wireless Networks.
INFOCOM 2004 |
| 103 | EE | 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.
IEEE Trans. Computers 53(12): 1629-1635 (2004) |
| 2003 |
|---|
| 102 | EE | 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.
Comput. J. 46(4): 378-390 (2003) |
| 101 | EE | Xiaohua Jia,
Ding-Zhu Du,
Xiao-Dong Hu,
Hejiao Huang,
Deying Li:
On the optimal placement of wavelength converters in WDM networks.
Computer Communications 26(9): 986-995 (2003) |
| 100 | EE | 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.
Networks 42(4): 202-208 (2003) |
| 99 | EE | Liying Kang,
Hong Qiao,
Erfang Shan,
Ding-Zhu Du:
Lower bounds on the minus domination and k-subdomination numbers.
Theor. Comput. Sci. 296(1): 89-98 (2003) |
| 2002 |
|---|
| 98 | EE | Xiaohua Jia,
Ding-Zhu Du,
Xiao-Dong Hu,
Hejiao Huang,
Deying Li:
Placement of Wavelength Converters for Minimal Wavelength Usage in WDM Networks.
INFOCOM 2002 |
| 97 | | Mihaela Cardei,
Maggie Xiaoyan Cheng,
Xiuzhen Cheng,
Ding-Zhu Du:
Connected Domination in Multihop Ad Hoc Wireless Networks.
JCIS 2002: 251-255 |
| 96 | EE | Lusheng Wang,
Ding-Zhu Du:
Approximations for a Bottleneck Steiner Tree Problem.
Algorithmica 32(4): 554-561 (2002) |
| 95 | EE | Hung Q. Ngo,
Ding-Zhu Du:
New constructions of non-adaptive and error-tolerance pooling designs.
Discrete Mathematics 243(1-3): 161-170 (2002) |
| 94 | EE | Sui-Xiang Gao,
Ding-Zhu Du,
Xiao-Dong Hu,
Xiaohua Jia:
Rivest-Vuillemin conjecture is true for monotone boolean functions with twelve variables.
Discrete Mathematics 253(1-3): 19-34 (2002) |
| 93 | EE | Ding-Zhu Du,
D. Frank Hsu,
Hung Quang Ngo,
G. W. Peck:
On connectivity of consecutive-d digraphs.
Discrete Mathematics 257(2-3): 371-384 (2002) |
| 92 | EE | Hung Q. Ngo,
Ding-Zhu Du,
Ronald L. Graham:
New bounds on a hypercube coloring problem.
Inf. Process. Lett. 84(5): 265-269 (2002) |
| 91 | EE | Mihaela Cardei,
David MacCallum,
Maggie Xiaoyan Cheng,
Manki Min,
Xiaohua Jia,
Deying Li,
Ding-Zhu Du:
Wireless Sensor Networks with Energy Efficient Organization.
Journal of Interconnection Networks 3(3-4): 213-229 (2002) |
| 90 | EE | Ding-Zhu Du,
Frank K. Hwang,
Xiaohua Jia,
Hung Q. Ngo:
Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1.
SIAM J. Discrete Math. 15(3): 305-316 (2002) |
| 89 | | Ding-Zhu Du,
Peter Eades,
Xuemin Lin:
Foreword.
Theor. Comput. Sci. 289(2): 877 (2002) |
| 2001 |
|---|
| 88 | EE | Liying Kang,
Hong Qiao,
Erfang Shan,
Ding-Zhu Du:
Lower Bounds on the Minus Domination and k-Subdomination Numbers.
COCOON 2001: 375-383 |
| 87 | EE | Ding-Zhu Du,
Lusheng Wang,
Baogang Xu:
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points.
COCOON 2001: 509-518 |
| 86 | EE | Xiaohua Jia,
Deying Li,
Xiao-Dong Hu,
Ding-Zhu Du:
Placement of Read-Write Web Proxies in the Internet.
ICDCS 2001: 687-690 |
| 85 | EE | Hung Quang Ngo,
Ding-Zhu Du,
Ronald L. Graham:
New Bounds on a Hypercube Coloring Problem and Linear Codes.
ITCC 2001: 542-546 |
| 84 | EE | Guoliang Xue,
Guo-Hui Lin,
Ding-Zhu Du:
Grade of Service Steiner Minimum Trees in the Euclidean Plane.
Algorithmica 31(4): 479-500 (2001) |
| 83 | EE | Xiaohua Jia,
Deying Li,
Xiao-Dong Hu,
Ding-Zhu Du:
Optimal Placement of Web Proxies for Replicated Web Servers in the Internet.
Comput. J. 44(5): 329-339 (2001) |
| 82 | EE | Lu Ruan,
Ding-Zhu Du,
Xiao-Dong Hu,
Xiaohua Jia,
Deying Li,
Zheng Sun:
Converter Placement Supporting Broadcast in WDM Optical Networks.
IEEE Trans. Computers 50(7): 750-758 (2001) |
| 81 | EE | Xiao-Dong Hu,
Xiaohua Jia,
Ding-Zhu Du,
Deying Li,
Hejiao Huang:
Placement of Data Replicas for Optimal Data Availability in Ring Networks.
J. Parallel Distrib. Comput. 61(10): 1412-1424 (2001) |
| 80 | EE | Xiao-Dong Hu,
Xiaohua Jia,
Ding-Zhu Du,
Frank K. Hwang:
Monotone Routing in Multirate Rearrangeable Clos Networks.
J. Parallel Distrib. Comput. 61(9): 1382-1388 (2001) |
| 79 | EE | Dongsoo S. Kim,
Ding-Zhu Du:
Multirate multicast switching networks.
Theor. Comput. Sci. 261(2): 241-251 (2001) |
| 78 | EE | 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.
Theor. Comput. Sci. 262(1): 83-99 (2001) |
| 2000 |
|---|
| 77 | | Ding-Zhu Du,
Peter Eades,
Vladimir Estivill-Castro,
Xuemin Lin,
Arun Sharma:
Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings
Springer 2000 |
| 76 | EE | Haizhou Chen,
Bing Lu,
Ding-Zhu Du:
Static Timing Analysis with False Paths.
ICCD 2000: 541-544 |
| 75 | | Xiaohua Jia,
Deying Li,
Xiao-Dong Hu,
Hejiao Huang,
Ding-Zhu Du:
Optimal Placement of Proxies of Replicated Web Servers in the Internet.
WISE 2000: 55-61 |
| 74 | | Dongsoo S. Kim,
Ding-Zhu Du,
Panos M. Pardalos:
A coloring problem on the n-cube.
Discrete Applied Mathematics 103(1-3): 307-311 (2000) |
| 73 | EE | Dongsoo S. Kim,
Ding-Zhu Du:
Performance of split routing algorithm for three-stage multicast networks.
IEEE/ACM Trans. Netw. 8(4): 526-534 (2000) |
| 72 | | Ding-Zhu Du:
Editorial.
J. Comb. Optim. 4(1): 5-5 (2000) |
| 1999 |
|---|
| 71 | EE | Guoliang Xue,
Guo-Hui Lin,
Ding-Zhu Du:
Grade of service Euclidean Steiner minimum trees.
ISCAS (6) 1999: 182-185 |
| 70 | EE | Feng Cao,
Ding-Zhu Du:
Fault-Tolerant Routing and Multicasting in Butterfly Networks.
SAC 1999: 455-460 |
| 69 | EE | Guoliang Xue,
Ding-Zhu Du:
An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology.
Algorithmica 23(4): 354-362 (1999) |
| 68 | EE | Feng Cao,
Ding-Zhu Du,
D. Frank Hsu,
Shang-Hua Teng:
Fault Tolerance Properties of Pyramid Networks.
IEEE Trans. Computers 48(1): 88-93 (1999) |
| 67 | EE | Sui-Xiang Gao,
Weili Wu,
Ding-Zhu Du,
Xiao-Dong Hu:
The Rivest-Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables.
J. Complexity 15(4): 526-536 (1999) |
| 66 | | Guo-Hui Lin,
Ding-Zhu Du,
Xiao-Dong Hu,
Guoliang Xue:
On Rearrangeability of Multirate Clos Networks.
SIAM J. Comput. 28(4): 1225-1231 (1999) |
| 65 | EE | Ding-Zhu Du,
Frank K. Hwang,
Guoliang Xue:
Interconnecting Highways.
SIAM J. Discrete Math. 12(2): 252-261 (1999) |
| 1998 |
|---|
| 64 | EE | Dongsoo S. Kim,
Ding-Zhu Du:
Multirate Multicast Switching Networks.
COCOON 1998: 219-228 |
| 63 | EE | Feng Cao,
Ding-Zhu Du,
D. Frank Hsu,
Lihui Hwang,
Weili Wu:
Super line-connectivity of consecutive-d digraphs.
Discrete Mathematics 183(1-3): 27-38 (1998) |
| 62 | | Al Borchers,
Ding-Zhu Du,
Biao Gao,
Peng-Jun Wan:
The k-Steiner Ratio in the Rectilinear Plane.
J. Algorithms 29(1): 1-17 (1998) |
| 61 | | Jiandong Huang,
Peng-Jun Wan,
Ding-Zhu Du:
Criticality- and QoS-Based Multiresource Negotiation and Adaptation.
Real-Time Systems 15(3): 249-273 (1998) |
| 60 | | Ding-Zhu Du,
Biao Gao,
Frank K. Hwang,
J. H. Kim:
On Multirate Rearrangeable Clos Networks.
SIAM J. Comput. 28(2): 463-470 (1998) |
| 59 | | Ding-Zhu Du,
Ker-I Ko:
In Memoriam Ronald V. Book.
Theor. Comput. Sci. 207(1): 1-3 (1998) |
| 1997 |
|---|
| 58 | | Feng Cao,
Ding-Zhu Du,
Shang-Hua Teng:
Fault-tolerant Properties of Pyramid Network.
PDPTA 1997: 1690-1693 |
| 57 | EE | Ding-Zhu Du,
Biao Gao,
Weili Wu:
A Special Case for Subset Interconnection Designs.
Discrete Applied Mathematics 78(1-3): 51-60 (1997) |
| 56 | EE | Peter C. Fishburn,
Frank K. Hwang,
Ding-Zhu Du,
Biao Gao:
On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks.
Discrete Applied Mathematics 78(1-3): 75-87 (1997) |
| 55 | EE | Peng-Jun Wan,
Ding-Zhu Du:
A (log23+1/2) competitive algorithm for the counterfeit coin problem.
Discrete Mathematics 163(1-3): 173-200 (1997) |
| 54 | EE | Peng-Jun Wan,
Ding-Zhu Du,
Ronald L. Graham:
The Steiner ratio for the dual normed plane.
Discrete Mathematics 171(1-3): 261-275 (1997) |
| 53 | | Ding-Zhu Du:
Book Review: Discrete Analysis and Operation Research.
J. Comb. Optim. 1(1): 105 (1997) |
| 52 | | Al Borchers,
Ding-Zhu Du:
The k-Steiner Ratio in Graphs.
SIAM J. Comput. 26(3): 857-869 (1997) |
| 51 | EE | Ding-Zhu Du,
Ming Li:
Foreword (COCOON'95).
Theor. Comput. Sci. 181(2): 227 (1997) |
| 1996 |
|---|
| 50 | | Guoliang Xue,
Ding-Zhu Du:
O(n log n)-Average-Time Algorithm for Shortest Network under a Given Topology.
COCOON 1996: 11-20 |
| 49 | EE | Ding-Zhu Du,
D. Frank Hsu,
Yuh-Dauh Lyuu:
On the diameter vulnerability of Kautz digraphs.
Discrete Mathematics 151(1-3): 81-85 (1996) |
| 48 | | Jun Gu,
Qian-Ping Gu,
Ding-Zhu Du:
Convergence Properties of Optimization Algorithms for the SAT Problem.
IEEE Trans. Computers 45(2): 209-219 (1996) |
| 47 | EE | Ding-Zhu Du,
Warren D. Smith:
Disproofs of Generalized Gilbert - Pollak Conjecture on the Steiner Ratio in Three or More Dimensions.
J. Comb. Theory, Ser. A 74(1): 115-130 (1996) |
| 1995 |
|---|
| 46 | | Ding-Zhu Du,
Ming Li:
Computing and Combinatorics, First Annual International Conference, COCOON '95, Xi'an, China, August 24-26, 1995, Proceedings
Springer 1995 |
| 45 | EE | Al Borchers,
Ding-Zhu Du:
The k-Steiner ratio in graphs.
STOC 1995: 641-649 |
| 44 | | Ding-Zhu Du:
On Greedy Heuristics for Steiner Minimum Trees.
Algorithmica 13(4): 381-386 (1995) |
| 43 | EE | Ding-Zhu Du:
on Component-size Bounded Steiner Trees.
Discrete Applied Mathematics 60(1-3): 131-140 (1995) |
| 42 | EE | Biao Gao,
Ding-Zhu Du,
Ronald L. Graham:
A tight lower bound for the Steiner ratio in Minkowski planes.
Discrete Mathematics 142(1-3): 49-63 (1995) |
| 1994 |
|---|
| 41 | | Ding-Zhu Du,
Xiang-Sun Zhang:
Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings
Springer 1994 |
| 40 | | Jiandong Huang,
Ding-Zhu Du:
Resource Management for Continuous Multimedia Database Applications.
IEEE Real-Time Systems Symposium 1994: 46-54 |
| 39 | EE | Biao Gao,
Ding-Zhu Du,
Ronald L. Graham:
The Tight Lower Bound for the Steiner Ratio in Minkowski Planes.
Symposium on Computational Geometry 1994: 183-191 |
| 38 | | Sourav Bhattacharya,
Gary Elsesser,
Wei-Tek Tsai,
Ding-Zhu Du:
Multicasting in Generalized Multistage Interconnection Networks.
J. Parallel Distrib. Comput. 22(1): 80-95 (1994) |
| 37 | | Ding-Zhu Du,
Guoliang Xue,
S.-Z. Sun,
Siu-Wing Cheng:
Modifications of Competitive Group Testing.
SIAM J. Comput. 23(1): 82-96 (1994) |
| 36 | | Ding-Zhu Du,
Haesun Park:
On Competitive Group Testing.
SIAM J. Comput. 23(5): 1019-1025 (1994) |
| 1993 |
|---|
| 35 | | Ding-Zhu Du,
Biao Gao,
Ronald L. Graham,
Zi-Cheng Liu,
Peng-Jun Wan:
Minimum Steiner Trees in Normed Planes.
Discrete & Computational Geometry 9: 351-370 (1993) |
| 34 | EE | Ding-Zhu Du,
Frank K. Hwang:
Competitive Group Testing.
Discrete Applied Mathematics 45(3): 221-232 (1993) |
| 33 | | Ding-Zhu Du,
Yuh-Dauh Lyuu,
D. Frank Hsu:
Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs.
IEEE Trans. Computers 42(5): 612-616 (1993) |
| 1992 |
|---|
| 32 | | Ding-Zhu Du,
Frank K. Hwang:
A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio.
Algorithmica 7(2&3): 121-135 (1992) |
| 31 | | Zi-Cheng Liu,
Ding-Zhu Du:
On Steiner Minimal Trees with L_p Distance.
Algorithmica 7(2&3): 179-191 (1992) |
| 30 | EE | Ding-Zhu Du,
D. Frank Hsu,
G. W. Peck:
Connectivity of Consecutive-d Digraphs.
Discrete Applied Mathematics 37/38: 169-177 (1992) |
| 29 | | Tao Jiang,
Ming Li,
Ding-Zhu Du:
A Note on Shortest Superstrings with Flipping.
Inf. Process. Lett. 44(4): 195-199 (1992) |
| 28 | EE | Ding-Zhu Du,
Ker-I Ko:
A note on best fractions of a computable real number.
J. Complexity 8(3): 216-229 (1992) |
| 27 | | Ding-Zhu Du,
Yanjun Zhang:
On better heuristics for Steiner minimum trees.
Math. Program. 57: 193-202 (1992) |
| 26 | | Ding-Zhu Du,
Frank K. Hwang:
Reducing the Steiner Problem in a Normed Space.
SIAM J. Comput. 21(6): 1001-1007 (1992) |
| 1991 |
|---|
| 25 | | Ding-Zhu Du,
Yanjun Zhang,
Qing Feng:
On Better Heuristic for Euclidean Steiner Minimum Trees (Extended Abstract)
FOCS 1991: 431-439 |
| 24 | | Ding-Zhu Du,
Yuh-Dauh Lyuu,
D. Frank Hsu:
Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing.
WG 1991: 169-179 |
| 23 | EE | Ding-Zhu Du,
D. Frank Hsu:
Partitionable starters for twin prime power type.
Discrete Mathematics 87(1): 23-28 (1991) |
| 22 | EE | Ding-Zhu Du,
D. Frank Hsu,
Frank K. Hwang,
X. M. Zhang:
The Hamiltonian property of generalized de Bruijn digraphs.
J. Comb. Theory, Ser. B 52(1): 1-8 (1991) |
| 1990 |
|---|
| 21 | | Ding-Zhu Du,
Frank K. Hwang:
An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio
FOCS 1990: 76-85 |
| 20 | | Ding-Zhu Du,
Yanjun Zhang:
On Heuristics for Minimum Length Rectilinear Partitions.
Algorithmica 5(1): 111-128 (1990) |
| 19 | | Ding-Zhu Du,
Daniel J. Kleitman:
Diameter and Radius in the Manhattan Metric.
Discrete & Computational Geometry 5: 351-356 (1990) |
| 18 | EE | Feng Yang,
Ding-Zhu Du:
The complexity of determinacy problem on group testing.
Discrete Applied Mathematics 28(1): 71-81 (1990) |
| 17 | | Ding-Zhu Du,
Frank K. Hwang:
Optimal Assembly of an s-Stage k-OUT-OF-n System.
SIAM J. Discrete Math. 3(3): 349-354 (1990) |
| 1989 |
|---|
| 16 | | Ding-Zhu Du,
Ronald V. Book:
On Inefficient Special Cases of NP-Complete Problems.
Theor. Comput. Sci. 63(3): 239-252 (1989) |
| 1988 |
|---|
| 15 | | Frank K. Hwang,
G. D. Song,
G. Y. Ting,
Ding-Zhu Du:
A Decomposition Theorem on Euclidean Steiner Minimal Trees.
Discrete & Computational Geometry 3: 367-382 (1988) |
| 14 | | Ding-Zhu Du,
Zevi Miller:
Matroids and Subset Interconnection Design.
SIAM J. Discrete Math. 1(4): 416-424 (1988) |
| 13 | | Ronald V. Book,
Ding-Zhu Du:
The Structure of Generalized Complexity Cores.
Theor. Comput. Sci. 61: 103-119 (1988) |
| 1987 |
|---|
| 12 | | Ding-Zhu Du,
Frank K. Hwang,
Andrew M. Odlyzko,
Yanjun Zhang:
Minimal-Distance Routing for Kykios II.
ICPP 1987: 546-549 |
| 11 | | Ding-Zhu Du,
Frank K. Hwang,
G. D. Song,
G. Y. Ting:
Steiner Minimal Trees on Sets of Four Points.
Discrete & Computational Geometry 2: 401-414 (1987) |
| 10 | | Ding-Zhu Du,
Frank K. Hwang,
J. F. Weng:
Steiner Minimal Trees for Regular Polygons.
Discrete & Computational Geometry 2: 65-84 (1987) |
| 9 | EE | Ronald V. Book,
Ding-Zhu Du:
The existence and density of generalized complexity cores.
J. ACM 34(3): 718-730 (1987) |
| 1986 |
|---|
| 8 | | Ker-I Ko,
Timothy J. Long,
Ding-Zhu Du:
A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract)
STOC 1986: 295-303 |
| 7 | | Ker-I Ko,
Timothy J. Long,
Ding-Zhu Du:
A Note on One- Way Functions and Polynomial Time Isomorphisms.
Structure in Complexity Theory Conference 1986: 196-196 |
| 6 | | Ker-I Ko,
Timothy J. Long,
Ding-Zhu Du:
On One-Way Functions and Polynomial-Time Isomorphisms.
Theor. Comput. Sci. 47(3): 263-276 (1986) |
| 1985 |
|---|
| 5 | | Ding-Zhu Du,
D. Frank Hsu,
Frank K. Hwang:
Doubly Linked Ring Networks.
IEEE Trans. Computers 34(9): 853-855 (1985) |
| 4 | | Ding-Zhu Du,
Frank K. Hwang,
E. Y. Yao:
The Steiner Ratio Conjecture Is True for Five Points.
J. Comb. Theory, Ser. A 38(2): 230-240 (1985) |
| 1984 |
|---|
| 3 | | Ding-Zhu Du,
Frank K. Hwang:
A Multiplication Theorem for Balanced Howell Rotations.
J. Comb. Theory, Ser. A 37(2): 121-126 (1984) |
| 1983 |
|---|
| 2 | EE | Frank K. Hwang,
Jia Feng Weng,
Ding-Zhu Du:
A class of full Steiner minimal trees.
Discrete Mathematics 45(1): 107-112 (1983) |
| 1982 |
|---|
| 1 | | Ding-Zhu Du,
E. Y. Yao,
Frank K. Hwang:
A Short Proof of a Result of Pollak on Steiner Minimal Trees.
J. Comb. Theory, Ser. A 32(3): 396-400 (1982) |
