H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Mathematics H-index 48 Citations 11,086 238 World Ranking 625 National Ranking 319
Computer Science H-index 60 Citations 15,708 317 World Ranking 1547 National Ranking 864

Overview

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.

Top Publications

Handbook of Combinatorial Optimization

Ding-Zhu Du;Panos M. Pardalos.
(1998)

1229 Citations

Combinatorial Group Testing and Its Applications

Ding-Zhu Du;Frank Kwang Hwang.
(1993)

1223 Citations

Improving wireless sensor network lifetime through power aware organization

Mihaela Cardei;Ding-Zhu Du.
Wireless Networks (2005)

1192 Citations

Relay sensor placement in wireless sensor networks

Xiuzhen Cheng;Ding-Zhu Du;Lusheng Wang;Baogang Xu.
Wireless Networks (2008)

577 Citations

Theory of computational complexity

Dingzhu Du;Ker-I Ko.
(2000)

441 Citations

A Polynomial-Time Approximation Scheme for the Minimum-Connected Dominating Set in Ad Hoc Wireless Networks

Xiuzhen Cheng;Xiao Huang;Deying Li;Weili Wu.
Networks (2003)

348 Citations

Network Security

Scott Huang;David MacCallum;Ding-Zhu Du.
(2008)

335 Citations

Wireless Sensor Networks with Energy Efficient Organization

Mihaela Cardei;David MacCallum;Maggie Xiaoyan Cheng;Manki Min.
Journal of Interconnection Networks (2002)

317 Citations

A proof of the Gilbert-Pollak conjecture on the Steiner ratio

Ding-Zhu Du;Ding-Zhu Du;Ding-Zhu Du;Frank K. Hwang.
Algorithmica (1992)

298 Citations

Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing

Ding-Zhu Du;Frank K Hwang.
(2006)

286 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Ding-Zhu Du

Weili Wu

Weili Wu

The University of Texas at Dallas

Publications: 110

Panos M. Pardalos

Panos M. Pardalos

University of Florida

Publications: 65

Xiaohua Jia

Xiaohua Jia

City University of Hong Kong

Publications: 49

Frank K. Hwang

Frank K. Hwang

National Yang Ming Chiao Tung University

Publications: 44

Mohamed Younis

Mohamed Younis

University of Maryland, Baltimore County

Publications: 37

Yingshu Li

Yingshu Li

Georgia State University

Publications: 36

Ugo Vaccaro

Ugo Vaccaro

University of Salerno

Publications: 32

My T. Thai

My T. Thai

University of Florida

Publications: 30

Song Guo

Song Guo

Hong Kong Polytechnic University

Publications: 29

Guoliang Xue

Guoliang Xue

Arizona State University

Publications: 29

Xiuzhen Cheng

Xiuzhen Cheng

Shandong University

Publications: 28

Jie Wu

Jie Wu

Temple University

Publications: 24

Victor C. M. Leung

Victor C. M. Leung

University of British Columbia

Publications: 23

Peng-Jun Wan

Peng-Jun Wan

Illinois Institute of Technology

Publications: 23

Jiguo Yu

Jiguo Yu

Qilu University of Technology

Publications: 22

Something went wrong. Please try again later.