What is he best known for?
The fields of study he is best known for:
- Computer network
- Algorithm
- Combinatorics
Ding-Zhu Du mainly investigates Combinatorics, Discrete mathematics, Computer network, Steiner tree problem and Network topology.
Ding-Zhu Du works on Combinatorics which deals in particular with Group testing.
As part of his studies on Discrete mathematics, Ding-Zhu Du often connects relevant subjects like Function.
His biological study spans a wide range of topics, including Wireless ad hoc network and Distributed computing.
His research integrates issues of Spanning tree, Approximation algorithm, Minimum spanning tree and Euclidean geometry in his study of Steiner tree problem.
His Network topology study combines topics from a wide range of disciplines, such as Distributed algorithm, Efficient energy use, Scheme and Broadcasting.
His most cited work include:
- Handbook of Combinatorial Optimization (830 citations)
- Improving wireless sensor network lifetime through power aware organization (802 citations)
- Combinatorial Group Testing and Its Applications (683 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Combinatorics, Discrete mathematics, Computer network, Approximation algorithm and Mathematical optimization.
His Combinatorics study which covers Set that intersects with Group testing.
Many of his studies involve connections with topics such as Euclidean geometry and Discrete mathematics.
His studies in Computer network integrate themes in fields like Wireless network, Distributed computing and Wireless ad hoc network.
His study looks at the intersection of Approximation algorithm and topics like Connected dominating set with Unit disk graph.
His work in the fields of Steiner tree problem, such as Steiner point, overlaps with other areas such as k-minimum spanning tree.
He most often published in these fields:
- Combinatorics (44.37%)
- Discrete mathematics (30.62%)
- Computer network (19.79%)
What were the highlights of his more recent work (between 2017-2021)?
- Approximation algorithm (20.00%)
- Combinatorics (44.37%)
- Greedy algorithm (7.08%)
In recent papers he was focusing on the following fields of study:
Ding-Zhu Du spends much of his time researching Approximation algorithm, Combinatorics, Greedy algorithm, Submodular set function and Mathematical optimization.
His Approximation algorithm study incorporates themes from Linear programming, Function, Set and Dominating set.
His study in Minimum weight, Vertex, Vertex cover, Integer and Spanning tree is carried out as part of his Combinatorics studies.
In the field of Mathematical optimization, his study on Optimization problem and Maximization overlaps with subjects such as Rumor.
His work in Optimization problem addresses subjects such as Process, which are connected to disciplines such as Theoretical computer science and Social network.
His study explores the link between The Internet and topics such as Data access that cross with problems in Computer network.
Between 2017 and 2021, his most popular works were:
- An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks (31 citations)
- On Misinformation Containment in Online Social Networks (26 citations)
- Fractal Intelligent Privacy Protection in Online Social Network Using Attribute-Based Encryption Schemes (24 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Algorithm
- The Internet
His scientific interests lie mostly in Approximation algorithm, Greedy algorithm, Combinatorics, Social network and Computer network.
His Approximation algorithm research includes themes of Discrete mathematics, Set, Misinformation, PageRank and Linear programming.
His studies in Spanning tree, Minimum spanning tree, Euclidean minimum spanning tree, Steiner tree problem and Edge cover are all subfields of Discrete mathematics research.
Ding-Zhu Du incorporates a variety of subjects into his writings, including Combinatorics, Feedback arc set and k-minimum spanning tree.
His work focuses on many connections between Social network and other disciplines, such as Theoretical computer science, that overlap with his field of interest in Key, Optimization problem, Cover and Process.
His work on Wireless sensor network as part of his general Computer network study is frequently connected to Schedule, thereby bridging the divide between different branches of science.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
