Ding-Zhu Du

Q: What Schools Are Affiliated With Ding-Zhu Du

Ding-Zhu Du is affiliated with the following schools: University of California, Santa Barbara, University of Minnesota, Princeton University, University of Texas at Dallas, Fudan University

Ding-Zhu Du's AcademicInfluence.com Rankings

Ding-Zhu Du

Computer Science

#4023

World Rank

#4230

Historical Rank

computer-science Degrees

Ding-Zhu Du

Mathematics

#5451

World Rank

#7668

Historical Rank

Combinatorics

#71

World Rank

#78

Historical Rank

Graph Theory

#71

World Rank

#78

Historical Rank

Measure Theory

#888

World Rank

#1163

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Ding-Zhu Du's Degrees

Bachelors Mathematics Fudan University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Ding-Zhu Du Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ding-Zhu Du is a Professor in the Department of Computer Science at The University of Texas at Dallas. He has received public recognition when he solved two long-standing open problems on the Euclidean minimum Steiner trees, the proof of Gilbert–Pollack conjecture on the Steiner ratio of the Euclidean plane, and the existence of a polynomial-time heuristic with a performance ratio bigger than the Steiner ratio. The proof of Gilbert-Pollak's conjecture on Steiner ratios was later found to have gaps, thus leaving the problem unsolved.

(See a Problem?)

Ding-Zhu Du's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Combinatorial Group Testing and Its Applications (1993) (1027)
Improving Wireless Sensor Network Lifetime through Power Aware Organization (2005) (961)
Handbook of Combinatorial Optimization (1998) (809)
Relay sensor placement in wireless sensor networks (2008) (494)
A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks (2003) (330)
Theory of Computational Complexity (2000) (277)
Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing (2006) (261)
Wireless Sensor Networks with Energy Efficient Organization (2002) (256)
Wiley Series in Discrete Mathematics and Optimization (2014) (241)
Computing in Euclidean Geometry (1995) (219)
Minimax and applications (1995) (211)
Approximations for Steiner Trees with Minimum Number of Steiner Points (2000) (210)
Design and Analysis of Approximation Algorithms (2011) (206)
On greedy construction of connected dominating sets in wireless networks (2005) (197)
A survey on combinatorial group testing algorithms with applications to DNA Library Screening (1999) (197)
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks (2009) (195)
Tight Performance Bounds of Multihop Fair Access for MAC Protocols in Wireless Sensor Networks and Underwater Sensor Networks (2012) (175)
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges (2007) (173)
Adaptive Influence Maximization in Dynamic Social Networks (2015) (167)
A Decision Criterion for the Optimal Number of Clusters in Hierarchical Clustering (2003) (166)
Steiner Tree Problems (2009) (160)
On the construction of 2-connected virtual backbone in wireless networks (2009) (139)
Connected Domination in Multihop Ad Hoc Wireless Networks (2002) (130)
Handbook of combinatorial optimization. Supplement (2005) (126)
A proof of the Gilbert-Pollak conjecture on the Steiner ratio (1992) (125)
The k-Steiner ratio in graphs (1995) (125)
Optimization of wavelength assignment for QoS multicast in WDM networks (2001) (119)
Steiner Trees in Industry (2002) (115)
QoS topology control in ad hoc wireless networks (2004) (114)
Generalized de Bruijn digraphs (1988) (112)
Connected Dominating Set: Theory and Applications (2012) (109)
Criterion functions for document clustering (2005) (107)
Satisfiability Problem: Theory and Applications (1997) (106)
Energy-efficient broadcast and multicast routing in ad hoc wireless networks (2003) (106)
On the Construction of Virtual Backbone for Ad Hoc Wireless Network (2003) (105)
Combinatorial Network Theory (1996) (103)
Steiner tree problems in computer communication networks (2008) (100)
Multiwavelength Optical Networks (2002) (96)
Maximizing rumor containment in social networks with constrained time (2014) (88)
Ad Hoc Wireless Networking (2004) (87)
An efficient randomized algorithm for rumor blocking in online social networks (2017) (79)
An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio (1990) (76)
Greedy approximations for minimum submodular cover with submodular cost (2010) (75)
Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks (2011) (75)
Localized Construction of Connected Dominating Set in Wireless Networks (2004) (75)
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks (2010) (74)
Recent Advances in Nonsmooth Optimization (1995) (73)
On better heuristic for Euclidean Steiner minimum trees (1991) (72)
Paired-domination of Trees (2003) (68)
Advances in Steiner trees (2000) (68)
Theory of Computational Complexity: Du/Theory (2000) (67)
Analysis of greedy approximations with nonsubmodular potential functions (2008) (66)
A reliable virtual backbone scheme in mobile ad-hoc networks (2004) (65)
New constructions of non-adaptive and error-tolerance pooling designs (2002) (65)
A note on one-way functions and polynomial-time isomorphisms (1986) (62)
New Constructions of One- and Two-Stage Pooling Designs (2008) (61)
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs (2010) (58)
Steiner minimal trees for regular polygons (1987) (56)
On Construction of Virtual Backbone in Wireless Ad Hoc Networks with Unidirectional Links (2008) (55)
A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks (2009) (55)
Fault Tolerance Properties of Pyramid Networks (1999) (55)
Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks (2011) (55)
Fault-Tolerant Topology Control for All-to-One and One-to-All Communication in Wireles Networks (2008) (55)
Topology control of ad hoc wireless networks for energy efficiency (2004) (53)
Competitive Group Testing (1993) (53)
An optimization model for placement of wavelength converters to minimize blocking probability in WDM networks (2003) (53)
Advances in Algorithms, Languages, and Complexity (1997) (52)
A new bound for the steiner ratio (1983) (50)
The Steiner Ratio Conjecture Is True for Five Points (1985) (49)
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links (2006) (48)
The Hamiltonian property of generalized de Bruijn digraphs (1991) (46)
Reliability-Aware Offloading and Allocation in Multilevel Edge Computing System (2019) (46)
Optimal Consecutive-2-Out-of-n Systems (1986) (45)
Cooperative Bridges: Topology Control in Cooperative Wireless Ad Hoc Networks (2010) (44)
Resource pricing game in geo-distributed clouds (2013) (44)
The Steiner ratio conjecture of Gilbert and Pollak is true. (1990) (42)
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay (2006) (42)
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points (2001) (42)
Resource management in wireless networking (2005) (42)
Reducing reader collision for mobile RFID (2011) (41)
Discrete Mathematical Problems with Medical Applications (2000) (41)
Approximations for a Bottleneck Steiner Tree Problem (2001) (41)
On Misinformation Containment in Online Social Networks (2018) (41)
Network Design: Connectivity and Facilities Location (1998) (40)
Connected dominating sets in disk graphs with bidirectional links (2006) (40)
The Hamiltonian property of consecutive-d digraphs (1993) (40)
A combinatorial problem related to distributed loop networks (1990) (39)
Steiner minimal trees on sets of four points (1987) (39)
Advances in optimization and approximation (1994) (39)
A test problem generator for the Steiner problem in graphs (1993) (38)
Converter Placement Supporting Broadcast in WDM Optical Networks (2001) (38)
Minimum steiner trees in normed planes (1993) (37)
On the diameter vulnerability of Kautz digraphs (1996) (37)
New dominating sets in social networks (2010) (36)
A coloring problem on the n-cube (2000) (36)
Network Optimization Problems: Algorithms, Applications And Complexity (1993) (35)
Doubly Linked Ring Networks (1985) (35)
An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks (2020) (35)
Reducing the Steiner Problem in a Normed Space (1992) (34)
Wireless networking, dominating and packing (2010) (34)
Modifications of Competitive Group Testing (1994) (34)
Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs (2015) (33)
Distributed Rumor Blocking With Multiple Positive Cascades (2017) (33)
The existence and density of generalized complexity cores (1987) (33)
Energy-efficient roadside unit scheduling for maintaining connectivity in vehicle ad-hoc network (2011) (33)
Disproofs of Generalized Gilbert - Pollak Conjecture on the Steiner Ratio in Three or More Dimensions (1996) (32)
Virtual Backbone-Based Routing in Multihop Ad Hoc Wireless Networks (2002) (31)
Minimum Data-Latency-Bound $k$-Sink Placement Problem in Wireless Sensor Networks (2011) (31)
Computing in Euclidean Geometry: (2nd Edition) (1995) (31)
Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet (2003) (31)
Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs (1993) (30)
Steiner minimal trees on zig-zag lines (1983) (30)
Mathematical Theory of Optimization (2001) (30)
Placement of wavelength converters for minimal wavelength usage in WDM networks (2002) (29)
Grade of Service Steiner Minimum Trees in the Euclidean Plane (2001) (29)
Optimal Placement of Web Proxies for Replicated Web Servers in the Internet (2001) (29)
A Short Proof of a Result of Pollak on Steiner Minimal Trees (1982) (28)
On Multirate Rearrangeable Clos Networks (1999) (27)
Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks (2016) (27)
Set Function Optimization (2018) (27)
Minimizing Influence of Rumors by Blockers on Social Networks: Algorithms and Analysis (2020) (27)
Approximation and Inapproximation for the Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model (2011) (27)
New Construction for Transversal Design (2006) (27)
Approximating Maximum Lifetime $k$ -Coverage Through Minimizing Weighted $k$ -Cover in Homogeneous Wireless Sensor Networks (2016) (27)
On the construction of stable virtual backbones in mobile ad-hoc networks (2005) (26)
Matroids and Subset Interconnection Design (1988) (26)
Global convergence of Rosen's gradient projection method (1989) (25)
New bounds on a hypercube coloring problem (2002) (25)
Criticality- and QoS-Based Multiresource Negotiation and Adaptation (1998) (24)
Adaptive Path Planning for Randomly Deployed Wireless Sensor Networks (2011) (24)
Constructing Connected Dominating Sets with Bounded Diameters inWireless Networks (2007) (24)
On polynomial and generalized complexity cores (1988) (24)
Notes on the Complexity of Switching Networks (2001) (23)
New constructions on broadcast encryption key pre-distribution schemes (2005) (23)
A Novel Approximation for Multi-Hop Connected Clustering Problem in Wireless Networks (2017) (23)
An exact algorithm for minimum CDS with shortest path constraint in wireless networks (2011) (23)
Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks (2001) (22)
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (2007) (22)
Placement of read-write Web proxies on the Internet (2001) (21)
A novel approach for detecting multiple rumor sources in networks with partial observations (2017) (21)
Topology Control in Cooperative Wireless Ad-Hoc Networks (2012) (21)
Resource management for continuous multimedia database applications (1994) (21)
On minimum submodular cover with submodular cost (2011) (20)
A direct algorithm for computing reliability of a consecutive-k cycle (1988) (20)
Satisfiability problem : theory and applications : DIMACS workshop, March 11-13, 1996 (1997) (20)
On steiner ratio conjectures (1991) (19)
The tight lower bound for the Steiner ratio in Minkowski planes (1994) (19)
A Note on Shortest Superstrings with Flipping (1992) (19)
Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors (2018) (18)
Steiner minimal tree for points on a circle (1985) (18)
Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network (2017) (17)
On better heuristics for Steiner minimum trees (1992) (17)
On greedy construction of connected dominating sets in wireless networks: Research Articles (2005) (17)
A convergence theorem of Rosen’s gradient projection method (1986) (17)
Efficient Constructions of Disjunct Matrices with Applications to DNA Library Screening (2007) (17)
On the optimal placement of wavelength converters in WDM networks (2003) (17)
On connectivity of consecutive-d digraphs (2002) (16)
Optimal Assembly of an s-Stage k-OUT-OF-n System (1990) (16)
On complexity of subset interconnection designs (1995) (16)
Fault-tolerant coverage with maximum lifetime in wireless sensor networks (2015) (16)
Hypergeometric and Generalized Hypergeometric Group Testing (1981) (16)
The state of the art in Steiner ratio problems (1992) (16)
On the upper bounds of the minimum number of rows of disjunct matrices (2009) (16)
Minimizing a Combinatorial Function (1982) (16)
on Component-size Bounded Steiner Trees (1995) (16)
Effector Detection in Social Networks (2016) (16)
An optimization problem on graphs (1986) (15)
On Rearrangeability of Multirate Clos Networks (1999) (15)
Optimal Coverage in Wireless Sensor Networks (2020) (15)
De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations (1996) (15)
Online makespan minimization in MapReduce-like systems with complex reduce tasks (2017) (15)
Maximize a Monotone Function with a Generic Submodularity Ratio (2019) (14)
Searching Genome-Wide Multi-Locus Associations for Multiple Diseases Based on Bayesian Inference (2017) (14)
Minimax and Its Applications (1995) (14)
Lower bounds on the minus domination and k-subdomination numbers (2001) (14)
Performance of split routing algorithm for three-stage multicast networks (2000) (14)
Molecular Biology and Pooling Design (2007) (14)
Proceedings of the 5th international conference on Theory and applications of models of computation (2006) (14)
Some completeness results on decision trees and group testing (1987) (14)
Placement of Data Replicas for Optimal Data Availability in Ring Networks (2001) (13)
On Hamiltonian consecutive-d digraphs (1989) (13)
FTTP: A Fast Tree Traversal Protocol for Efficient Tag Identification in RFID Networks (2010) (13)
History of Optimization (2009) (13)
Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention (2019) (13)
Computing Minimum k-Connected m-Fold Dominating Set in General Graphs (2018) (12)
Approximation algorithm for the partial set multi-cover problem (2018) (12)
On Inefficient Special Cases of NP-Complete Problems (1989) (12)
Quadratic Integer Programming with Application to the Chaotic Mappings of Complete Multipartite Graphs (2001) (12)
General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach (2018) (12)
A decomposition theorem on Euclidean Steiner minimal trees (1988) (12)
Fault tolerant topology control for one-to-all communications in symmetric wireless networks (2007) (12)
Generalized complexity cores and levelability of intractable sets (1985) (12)
A formal proof of the deadline driven scheduler in PPTL axiomatic system (2014) (12)
Minimizing Misinformation Profit in Social Networks (2019) (12)
Routing-efficient CDS construction in Disk-Containment Graphs (2014) (11)
Viral marketing with positive influence (2017) (11)
On optimizing the satisfiability (SAT) problem (1999) (11)
Optimal consecutive-2 systems of lines and cycles (1985) (11)
Super line-connectivity of consecutive-d digraphs (1998) (11)
Optimal assignments for consecutive-2 graphs (1987) (10)
Steiner Minimal Trees on Chinese Checkerboards (1991) (10)
Approximation algorithms for minimum weight connected 3-path vertex cover (2019) (10)
A tight lower bound for the Steiner ratio in Minkowski planes (1995) (10)
PTAS for Minimum Connected Dominating Set in Unit Ball Graph (2008) (10)
Complexity and approximation of the connected set-cover problem (2012) (10)
Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$lp-norm (2018) (10)
Active Friending in Online Social Networks (2017) (10)
Diameter and radius in the Manhattan metric (1990) (10)
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (2021) (10)
Global Minimax Approaches for Solving Discrete Problems (1997) (10)
Coupon Advertising in Online Social Systems: Algorithms and Sampling Techniques (2018) (10)
Multicasting in Generalized Multistage Interconnection Networks (1994) (10)
DAM: A Bayesian Method for Detecting Genome-wide Associations on Multiple Diseases (2015) (10)
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (2018) (9)
Radar placement along banks of river (2012) (9)
A continuous version of a result of Du and Hwang (1994) (9)
iGreen: green scheduling for peak demand minimization (2017) (9)
Algorithms for the partial inverse matroid problem in which weights can only be increased (2016) (9)
A Zig-Zag Approach for Competitive Group Testing (2014) (9)
Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing (1991) (9)
Reliabilities of Consecutive-2 Graphs (1987) (9)
New ConstructionsOn BroadcastEncryptionand Key Pre-Distribution Schemes (2004) (9)
Steiner minimal trees for bar waves (1987) (8)
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (2016) (8)
Connected Dominating Set (2008) (8)
The Steiner ratio for the dual normed plane (1997) (8)
On Steiner minimal trees withLp distance (1992) (8)
Optimal placement of proxies of replicated Web servers in the Internet (2000) (8)
A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice (2020) (8)
A stackelberg game for cooperative cognitive radio network with active SUs (2013) (8)
A new strongly competitive group testing algorithm with small sequentiality (2015) (8)
On the metric dimension of the folded n-cube (2019) (8)
On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks (1997) (8)
On 3-rate rearrangeability of Clos networks (1997) (8)
Optical Networks - Recent Advances (2011) (8)
Connectivity of Consecutive-d Digraphs (1992) (8)
AN EXTENSION OF DHH-ERD ¨ OS CONJECTURE ON CYCLE-PLUS-TRIANGLE GRAPHS (2002) (8)
Multirate multicast switching networks (1998) (8)
A Tale on Guillotine Cut (2003) (7)
Layout Optimization in VLSI Design (2001) (7)
Monotone Routing in Multirate Rearrangeable Clos Networks (2001) (7)
Proceedings of the 5th International Symposium on Algorithms and Computation (1994) (7)
Issues in ad hoc wireless networks (2002) (7)
Streaming Submodular Maximization Under Noises (2019) (7)
Fault-tolerant routing and multicasting in butterfly networks (1999) (7)
Computing In Euclidean Geometry: Volume 1 (1992) (7)
How Could a Boy Influence a Girl? (2014) (7)
Optimal Consecutive-k-out-of-(2k+1): G Cycle (2001) (7)
An one-way function based framework for pairwise key establishment in sensor networks (2008) (7)
An Approximation Algorithm for Active Friending in Online Social Networks (2018) (7)
A Time‐Optimal Anti‐collision Algorithm for FSA‐Based RFID Systems (2011) (7)
Rumor correction maximization problem in social networks (2021) (7)
Minimum vertex cover in ball graphs through local search (2014) (7)
Maximizing Activity Profit in Social Networks (2019) (7)
LINE DIGRAPH ITERATIONS AND DIAMETER VULNERABILITY (1999) (7)
On bounding node-to-sink latency in wireless sensor networks with multiple sinks (2013) (6)
A Problem of Lines and Intersections With an Application to Switching Networks (1985) (6)
Wireless Network Security (2013) (6)
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (2020) (6)
Optimal Relay Location for Resource-limited Energy-efficient Wireless Communication (2006) (6)
A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (2013) (6)
A combination of wireless multicast advantage and hitch-hiking (2005) (6)
Breaking the rmax Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (2020) (6)
PND: a p-persistent neighbor discovery protocol in wireless networks (2013) (6)
Optimization in design of underwater sensor networks (2009) (6)
On heuristics for minimum length rectilinear partitions (1990) (6)
Bottleneck Steiner Tree Problem (2008) (6)
Design of Logical Topologies (2002) (6)
A class of full Steiner minimal trees (1983) (6)
The k-Steiner Ratio in the Rectilinear Plane (1998) (6)
Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (2018) (6)
ON THE REARRANGEABILITY OF SHUFFLE-EXCHANGE NETWORKS (2000) (5)
A Simple Proof for a Result of Ollerenshaw on Steiner Trees (1994) (5)
Wide-sense Nonblocking for 3-stage Clos Networks (2001) (5)
Minimax Problems in Combinatorial Optimization (1995) (5)
Theory of Computational Complexity: Du/Theory of Computational Complexity (2014) (5)
A blockchain-based data storage framework: A rotating multiple random masters and error-correcting approach (2020) (5)
GeoSENS: geo-based sensor network secure communication protocol (2006) (5)
Optimal placement of wavelength converters in WDM networks for parallel and distributed computing systems (2000) (5)
On the construction of energy-efficient broadcast tree with Hitch-hiking in wireless networks (2005) (5)
Genetic networks: processing data, regulatory network modelling and their analysis (2007) (5)
A Special Case for Subset Interconnection Designs (1997) (5)
On optimal routing trees (1988) (5)
New bounds on a hypercube coloring problem and linear codes (2001) (5)
Minimizing Influence of Rumors by Blockers on Social Networks (2018) (5)
The Structure of Generalized Complexity Cores (1988) (5)
Weighted CDS in Unit Disk Graph (2013) (5)
Fault-Tolerant Dual Power Management in Wireless Sensor Networks (2008) (5)
Remarks on the convergence of Rosen's gradient projection method (1987) (5)
Convergence Properties of Optimization Algorithms for the SAT Problem (1996) (5)
On the Parameterized Complexity of Pooling Design (2009) (5)
Influence Diffusion, Community Detection, and Link Prediction in Social Network Analysis (2013) (5)
Resource Management in Wireless Networking (Network Theory and Applications) (2006) (5)
Static timing analysis with false paths (2000) (5)
Switching Networks: Recent Advances (2001) (5)
Influence Diffusion in Social Networks (2014) (5)
Optimal Placement of Wavelength Converters for Guaranteed Wavelength Assignment in WDM Networks (2002) (5)
Subset Interconnection Designs: Generalizations of Spanning Trees and Steiner Trees (1993) (5)
MinSum Movement of Barrier and Target Coverage using Sink-based Mobile Sensors on the Plane (2021) (4)
Approximation algorithms for capacitated partial inverse maximum spanning tree problem (2020) (4)
Balanced Howell rotations of the twin prime power type (1982) (4)
Dynamic Resource Provision for Cloud Broker with Multiple Reserved Instance Terms (2015) (4)
Online hole healing for sensor coverage (2019) (4)
Interconnecting Highways (1999) (4)
A new wavelength assignment method for minimal wavelength conversions in WDM networks (2000) (4)
Identifying d positive clones in the presence of inhibitors (2005) (4)
Combinatorics, computing and complexity (1989) (4)
Connected dominating set in wireless ad hoc networks (2009) (4)
DTNB: A Blockchain Transaction Framework With Discrete Token Negotiation for the Delay Tolerant Network (2021) (4)
Influence maximization problem: properties and algorithms (2020) (3)
A Novel Approximation for Multi-hop Connected Clustering Problem in Wireless Sensor Networks (2015) (3)
Grade of service Euclidean Steiner minimum trees (1999) (3)
A (log23+1/2) competitive algorithm for the counterfeit coin problem (1997) (3)
Data mule scheduling on a path with handling time and time span constraints (2019) (3)
Approximation Approximation for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks (2016) (3)
An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology (1999) (3)
Group testing with geometry of classical groups over finite fields (2018) (3)
Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1 (2002) (3)
Theoretical Computer Science (2017) (3)
Wireless Network Algorithms, Systems, and Applications (2010) (3)
Distributed Rumor Blocking in Social Networks: A Game Theoretical Analysis (2017) (3)
Advances in Switching Networks (1998) (3)
Symmetric skew balanced starters and complete balanced Howell rotations (1982) (3)
The Rivest-Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables (1999) (3)
A note on best fractions of a computable real number (1992) (3)
Location management in mobile ad hoc wireless networks using quorums and clusters (2005) (3)
Secondary user games with spectrum leasing market in cooperative cognitive radio networks (2013) (3)
Optimal Rectangular Partitions (2004) (3)
Convergence theory of feasible direction methods (1991) (3)
Maximisation of the number of β-view covered targets in visual sensor networks (2019) (3)
Approximations for Steiner Minimum Trees (2018) (3)
Energy-Efficient Wireless Networks (2004) (3)
Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (2016) (3)
On the complexity of an optimal routing tree problem (1989) (3)
Two Special Cases for Rectilinear Steiner Minimum Trees (1997) (3)
A Multiplication Theorem for Balanced Howell Rotations (1984) (3)
Characterization for series-parallel channel graphs (1981) (3)
Electric routing and concurrent flow cutting (2009) (3)
Terminal-set-enhanced community detection in social networks (2016) (3)
Modification of consecutive-d digraphs (1994) (3)
Guest Editorial on Cluster Computing in the Internet (2004) (2)
Ad Hoc Wireless Networking (Network Theory and Applications, V. 14) (2004) (2)
Convergence Properties of Optimization Algorithms for the Satisfiability (SAT) Problem (1996) (2)
Resource efficiency in ad hoc wireless networks: problems and solutions (2003) (2)
A class of asymptotically optimal group screening strategies with limited item participation (2019) (2)
Grade of Service Steiner Tree Problem (2008) (2)
Computing and Combinatorics (2013) (2)
On a conjecture of trietsch and handler on the flow-dependent steiner ratio (1986) (2)
New approximations for Maximum Lifetime Coverage (2014) (2)
Network design : connectivity and facilities location : DIMACS Workshop, April 28-30, 1997 (1998) (2)
Rosen's Method, Global Convergence, and Powell's Conjecture (2009) (2)
Performance Limits of Fair-Access in Underwater Sensor Networks (2009) (2)
Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties (2022) (2)
Population Monotonic Allocation Schemes for Vertex Cover Games (2020) (2)
Multichannel Optical Networks: Theory and Practice (1998) (2)
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing (2008) (2)
Randomized Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem (2017) (2)
Comparisons on blocking probabilities for regular series parallel channel graphs (1982) (2)
Corrigendum to "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs" (1996) (2)
Feasible Direction Method (2011) (2)
Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings (2005) (2)
Remarks on Beneš Conjecture (2001) (2)
Data placement in distributed data centers for improved SLA and network cost (2020) (2)
Minimum Wireless Charger Placement with Individual Energy Requirement (2020) (2)
Variable Metric Methods (2001) (2)
Non-unique Probe Selection with Group Testing (2007) (2)
Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set (2016) (2)
Discrete Mathematical Problems with Medical Applications: DIMACS Workshop Discrete Mathematical Problems with Medical Applications, December 8-10, 1999, DIMACS Center (2000) (2)
A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks (2021) (2)
Wiley‐Interscience Series in Discrete Mathematics and Optimization (2013) (2)
Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings (2008) (2)
Underwater Sensors (2020) (1)
On positive-influence target-domination (2017) (1)
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice (2022) (1)
On optimal randomized group testing with one defective item and a constrained number of positive responses (2021) (1)
Channel occupancy-based user association in IEEE 802.11 wireless LANs (2009) (1)
Slow Replica and Shared Protection: Energy-Efficient and Reliable Task Assignment in Cloud Data Centers (2019) (1)
Nearly tight approximation algorithm for (connected) Roman dominating set (2022) (1)
Nonlinear Combinatorial Optimization (2019) (1)
Minimum Connected Sensor Cover and Maximum-Lifetime Coverage in Wireless Sensor Networks (2013) (1)
A class of asymptotically optimal group testing strategies to identify good items (2019) (1)
Quality of barrier cover with wireless sensors (2019) (1)
The latest researches on dominating problems in wireless sensor network (2010) (1)
Steiner Tree Problem for Minimal Steiner Points (2008) (1)
Non-unique Probe Selection (2006) (1)
Hybrid Community Detection in Social Networks (2014) (1)
Combinatorial Optimization in Communication Networks (Combinatorial Optimization) (2006) (1)
Approximating the Steiner Minimum Tree (1993) (1)
A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem (2018) (1)
Multicast and broadcast routing in wdm optical networks (2001) (1)
A Survey on Combinatorial Group TestingAlgorithms with Applications to DNA (2004) (1)
Partitionable starters for twin prime power type (1991) (1)
HANDBOOK OF OPTIMIZATION IN MEDICINE Managing Editor (2013) (1)
Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set (2015) (1)
Guillotine Cut in Approximation Algorithms (2002) (1)
The Polynomial‐Time Hierarchy and Polynomial Space (2013) (1)
Routing-Cost Constrained CDS (2013) (1)
Wireless Telemedicine and Applications (2008) (1)
Approximation algorithms for capacitated partial inverse maximum spanning tree problem (2019) (1)
O(n log n)-Average-Time Algorithm for Shortest Network under a Given Topology (1996) (1)
Algorithms for Special Cases (1993) (1)
Latency-Aware Data Placements for Operational Cost Minimization of Distributed Data Centers (2020) (1)
Rivest-Vuillemin conjecture is true for monotone boolean functions with twelve variables (2002) (1)
Wireless Algorithms, Systems, and Applications, Third International Conference, WASA 2008, Dallas, TX, USA, October 26-28, 2008. Proceedings (2008) (1)
Primal-Dual Schema and Local Ratio (2012) (1)
Approximation algorithm for minimum partial multi-cover under a geometric setting (2021) (1)
Shuffle Scheduling for MapReduce Jobs Based on Periodic Network Status (2020) (1)
On conflict-free channel set assignments for optical cluster-based hypercube networks (1998) (1)
Multirate broadcast switching networks nonblocking in a wide sense (1997) (1)
Multichannel optical networks : theory and practice : DIMACS Workshop, March 16-19, 1998 (1998) (1)
Recent advances in wireless ad hoc networks (2006) (1)
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (2015) (0)
Workshop on Future Direction in Numerical Algorithms and Optimization (2008) (0)
Combinatorial group testing with error-tolerance property (2004) (0)
Editors’ Note: ISAAC 2009 Special Section (2011) (0)
Minimization of Blocking Probability (2002) (0)
Complexity and Approximation: In Memory of Ker-I Ko (2020) (0)
Preface: Theoretical Computer Science (2011) (0)
Resource efficiency in wireless ad hoc networks (2004) (0)
Sensor Cover (2020) (0)
Composite Community-Aware Diversified Influence Maximization with Efficient Approximation (2022) (0)
Algorithms and computation : 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009 : proceedings (2009) (0)
Context‐Free Languages (2002) (0)
Time-Efficiency-Oriented Missing-Tag Identification Protocols for Large-Scale RFID Systems (2014) (0)
Deterministic Designs from Partial Orders (2006) (0)
On Non-integer Submodular Set Cover Problem (2017) (0)
From Local to Global (2001) (0)
Book review (1994) (0)
Inner Spanning Trees Geometry for Planar Polygons (2013) (0)
Maximizing rumor containment in social networks with constrained time (2014) (0)
Fault-tolerant Properties of Pyramid Network (1997) (0)
Computing and Combinatorics (2000) (0)
Group Testing on Graphs (1993) (0)
Coverage and connectivity: algorithm, analysis and application (2010) (0)
Structure of NP (2013) (0)
Preface (2014) (0)
Radar placement along banks of river (2011) (0)
Camera Sensors (2020) (0)
Foreword (COCOON'95) (1997) (0)
An approximation algorithm for the k-generalized Steiner forest problem (2021) (0)
Random Designs and Error Tolerance (1999) (0)
Algorithmica (New York): Preface (2008) (0)
iGreen: green scheduling for peak demand minimization (2017) (0)
Connected Sensor Cover (2020) (0)
In Memoriam Ronald V. Book (1998) (0)
Randomized Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem (2017) (0)
Fundamental Issues (2020) (0)
Multiaccess Channels and Extensions (1993) (0)
Multi-Document Extractive Summarization as a Non-linear Combinatorial Optimization Problem (2019) (0)
Deterministic Designs and Superimposed Codes (1999) (0)
Notes on polynomial levelability (1988) (0)
Multicast under Multi-Drop Models (2002) (0)
A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (2020) (0)
Steiner k-Tree and k-Path Routing Problems (2008) (0)
Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning (2023) (0)
Computing and Combinatorics (2015) (0)
Basic Theory on Separating Matrices (2006) (0)
Topology Control for Increasing Connectivity in Cooperative Wireless Ad Hoc Networks (2010) (0)
Global Approximation of Local Optimality: Nonsubmodular Optimization (2023) (0)
Heterogeneous Sensors (2020) (0)
CDS in Disk-Intersection Graphs (2013) (0)
A Price-Based Spectrum Management Scheme with Stackelberg Game in Cooperative Cognitive Radio Networks (2012) (0)
Minimal-distance routing for KYKLOS II (1987) (0)
Routing-efficient CDS construction in Disk-Containment Graphs (2012) (0)
Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set (2022) (0)
Some Other Group Testing Models (1993) (0)
Random Pooling Designs and Probabilistic Analysis (2006) (0)
Social Influence-Based Optimization Problems (2018) (0)
General Sequential Algorithms (1999) (0)
Energy management in wireless networks (2005) (0)
Fault TolerantTopologyControl for All-to-One and One-to-All Communicationin WirelessNetworks (2005) (0)
Probabilistic Coverage (2020) (0)
Placement of Wavelength Converters (2002) (0)
Editorial for Computing and Combinatorics Conference (2016) (0)
A New Approximation Algorithm for Minimum-Weight $(1,m)$--Connected Dominating Set (2023) (0)
Combinatorial optimization and applications : 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011 : proceedings (2011) (0)
Advances in switching networks : DIMACS workshop, July 7-9, 1997 (1998) (0)
On Rivest-Vuillemin Conjecture for Fourteen Variables (2017) (0)
Pooling design algorithms based on group testing theory (2007) (0)
Probabilistically Checkable Proofs and NP‐Hard Optimization Problems (2013) (0)
Interactive Proof Systems (2013) (0)
Combinatorial Optimization and Applications (2010) (0)
Associate Editors. (2021) (0)
Computing and combinatorics : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013 : proceedings (2013) (0)
Preface - COCOON'2011 (2012) (0)
Minimum Matching Dominating Sets and Its Applications in Wireless Networks (2016) (0)
DNA LIBRARY SCREENING AND TRANSVERSAL DESIGNS (2011) (0)
Optimal Search in One Variable (1993) (0)
Wireless Algorithms, Systems, and Applications, 4th International Conference, WASA 2009, Boston, MA, USA, August 16-18, 2009. Proceedings (2009) (0)
2008 Proceedings of 17th International Conference on Computer Communications and Networks, ICCCN 2008: Message from the SoCCaN 2008 chairs (2008) (0)
Additive Model and Others (1999) (0)
Editorial: Complexity and Approximation: In Honor of Ker-I Ko (2021) (0)
CDS in Disk-Containment Graphs (2013) (0)
Complexity of Counting (2013) (0)
Blind Man’s Method (2001) (0)
Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs (2008) (0)
An approximation algorithm for the k-generalized Steiner forest problem (2021) (0)
CDS in Unit Ball Graphs and Growth Bounded Graphs (2013) (0)
Algorithmic Aspects in Information and Management: 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings (2020) (0)
k-Steiner Ratios and Better Approximation Algorithms (2008) (0)
Operations research and its applications : First International Symposium : ISORA '95, Beijing, P.R. China, August 19-22, 1995 : proceedings (1995) (0)
Geometric Partitions and Polynomial Time Approximation Schemes (2008) (0)
Construction of minimum edge-fault tolerant connected dominating set in a general graph (2023) (0)
Lower bounds for weak Byzantine agreement (1989) (0)
Distance magic labeling of the halved folded n-cube (2023) (0)
Adaptive Partitions (2008) (0)
Nonblocking 3-stage clos networks (1997) (0)
Book reviews (1993) (0)
O ( log n )-Localized Algorithms on the Coverage Problem in Wireless Sensor Networks (2005) (0)
Design and analysis of approximation algorithms for network optimization problems (2011) (0)
Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (2016) (0)
Lifetime of Coverage (2020) (0)
Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems (2022) (0)
Proceedings of the 16th international conference on Algorithms and Computation (2005) (0)
Mobile Sensors (2020) (0)
CDS in Unit Disk Graph (2013) (0)
AND COMPLETE BALANCED HOWELL ROTATIONS (2016) (0)
Construction of virtual backbone and clusters in wireless networks (2010) (0)
Minimum-Latency Scheduling (2013) (0)
Polynomial‐Time Isomorphism (2013) (0)
Interior Point Methods (2001) (0)
Computing and combinatorics : 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 : proceedings (2000) (0)
Gradient projection methods in linear and nonlinear programming (1988) (0)
Energy-Harvesting Sensors (2020) (0)
Optimal Sensor Coverage (2016) (0)
Introduction to Combinatorial Optimization (2022) (0)
Barrier Coverage (2020) (0)
Dynamic Simulcasting : Design and Optimization (2004) (0)
Sensor Cover and Double Partition (2013) (0)
Complexity and approximation of the connected set-cover problem (2011) (0)
Minimax Approach and Steiner Ratio (2008) (0)
Weighted Sensor Cover (2020) (0)
On greedy heuristics for steiner minimum trees (1995) (0)
On a Minimum Linear Classification Problem (2003) (0)
Steiner Tree Coloring Problem (2008) (0)
Theoretical Computer Science: Foreword (2002) (0)
Data-Dependent Approximation in Social Computing (2019) (0)
Preface (2007) (0)
Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings (2008) (0)
Combinatorial Optimization and Applications (2015) (0)
Sequential Algorithms for Special Cases (1999) (0)
CDS in General Graph (2013) (0)
A novel approach for detecting multiple rumor sources in networks with partial observations (2015) (0)
Nonadaptive Algorithms and Binary Superimposed Codes (1993) (0)
Location management in mobile ad hoc wireless networks using quorums and clusters: Research Articles (2005) (0)
Book Review: Discrete Analysis and operation Research (1997) (0)
Energy efficiency in wireless sensor networks (2005) (0)
QoS aware routing in wireless sensor networks (2010) (0)
Probabilistic Machines and Complexity Classes (2013) (0)
Online makespan minimization in MapReduce-like systems with complex reduce tasks (2015) (0)
Grid-Based Deployment (2020) (0)
Survivable Steiner Network Problem (2008) (0)
Black-Box and Data-Driven Computation (2021) (0)
Multicast on three-stage clos switching networks (1998) (0)
An approximation algorithm for the submodular multicut problem in trees with linear penalties (2020) (0)
Approximation algorithm for minimum partial multi-cover under a geometric setting (2021) (0)
An improved zig zag approach for competitive group testing (2022) (0)
Preface (2011) (0)
Steiner Tree Scheduling Problem (2008) (0)
Foreword (2002) (0)
Routing for Load Balance (2002) (0)
Optimal Assemblies of Consecutive-2 Link Systems (1994) (0)
Computing and Combinatorics : 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings (2011) (0)
QоS Guaranteed Multicast (2002) (0)
Slope and Path Length (2001) (0)
CDS in Planar Graphs (2013) (0)
Geometric Hitting Set and Disk Cover (2013) (0)
Super Connectivity of Iterated Line Digraphs (0)
Algorithmic Aspects in Information and Management: 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings (2019) (0)
Static timing analysis with false paths and combinational loops (2004) (0)
Models of Computation and Complexity Classes (2013) (0)
Inexact Active Constraints (2001) (0)
Optimizations in network design (2001) (0)
Preface (2015) (0)
Energy Efficient Approaches in Wireless Networking (2004) (0)
Formulate Full View Camera Sensor Coverage by Using Group Set Coverage (2022) (0)
The Inhibitor Model (2006) (0)
Data broadcast and data management in wireless communications (2010) (0)
On positive-influence target-domination (2015) (0)
Theoretical Computer Science: Preface (2011) (0)
The complexity of determinacy problem on group testing (1990) (0)
Partial Coverage (2020) (0)
Data retrieval for multi-item requests in the multi-channel wireless broadcasting environments (2013) (0)
Pooling Designs on Complexes (2006) (0)
Set Function Optimization (2018) (0)
Probe Selection (2016) (0)
Preface (2007) (0)
A new strongly competitive group testing algorithm with small sequentiality (2014) (0)
Diameter and Radius in the Manhattan Metric* (2005) (0)
Algorithms for the partial inverse matroid problem in which weights can only be increased (2016) (0)
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (2018) (0)
Minimum vertex cover in ball graphs through local search (2013) (0)
Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008) (0)
Minimization of Wavelength Conversions (2002) (0)
Computing and combinatorics : First Annual International Conference, COCOON '95, Xi'an, China, August 24-26, 1995 : proceedings (1995) (0)

This paper list is powered by the following services:

Other Resources About Ding-Zhu Du

What Schools Are Affiliated With Ding-Zhu Du?

Ding-Zhu Du is affiliated with the following schools:

Ding-Zhu Du's Academic­Influence.com Rankings

Ding-Zhu Du's Degrees

Similar Degrees You Can Earn

Why Is Ding-Zhu Du Influential?

Ding-Zhu Du's Published Works

Published Works

Other Resources About Ding-Zhu Du

What Schools Are Affiliated With Ding-Zhu Du?

Ding-Zhu Du's AcademicInfluence.com Rankings