D-Index & Metrics Best Publications

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Mathematics D-index 48 Citations 8,285 311 World Ranking 894 National Ranking 436
Computer Science D-index 50 Citations 8,965 359 World Ranking 3715 National Ranking 1893

Research.com Recognitions

Awards & Achievements

2014 - ACM Distinguished Member

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Computer network
  • Artificial intelligence

His primary areas of investigation include Combinatorics, Discrete mathematics, Vertex cover, Parameterized complexity and Algorithm. His work in Combinatorics addresses issues such as Upper and lower bounds, which are connected to fields such as Amortized analysis. His Discrete mathematics research incorporates elements of Optimization problem, Exact algorithm and Set packing.

His Vertex cover research integrates issues from Edge cover and Vertex. His Parameterized complexity research incorporates themes from Computational complexity theory, Complexity class and Minimum cut. His Algorithm research is multidisciplinary, incorporating elements of Interaction network, Cluster analysis and Identification.

His most cited work include:

  • Improved upper bounds for vertex cover (274 citations)
  • Vertex Cover (256 citations)
  • A fixed-parameter algorithm for the directed feedback vertex set problem (240 citations)

What are the main themes of his work throughout his whole career to date?

Jianer Chen mainly investigates Combinatorics, Discrete mathematics, Algorithm, Parameterized complexity and Vertex cover. His Combinatorics research focuses on Feedback vertex set, Approximation algorithm, Parameterized algorithms, Time complexity and Graph. His work carried out in the field of Discrete mathematics brings together such families of science as Computational complexity theory, Upper and lower bounds and Bounded function.

The concepts of his Algorithm study are interwoven with issues in Set and Degree. His Parameterized complexity research incorporates elements of Randomized algorithm, Theoretical computer science and Packing problems. His study focuses on the intersection of Vertex cover and fields such as Independent set with connections in the field of Dominating set.

He most often published in these fields:

  • Combinatorics (45.39%)
  • Discrete mathematics (39.65%)
  • Algorithm (26.68%)

What were the highlights of his more recent work (between 2013-2021)?

  • Combinatorics (45.39%)
  • Discrete mathematics (39.65%)
  • Algorithm (26.68%)

In recent papers he was focusing on the following fields of study:

His main research concerns Combinatorics, Discrete mathematics, Algorithm, Parameterized complexity and Approximation algorithm. His research integrates issues of Binary number and Phylogenetic tree in his study of Combinatorics. Discrete mathematics is closely attributed to Matching in his research.

Jianer Chen combines subjects such as Degree and Resolution with his study of Algorithm. His Parameterized complexity study combines topics in areas such as Open problem, Set, Bounded function, Theory of computation and Tree rearrangement. The various areas that Jianer Chen examines in his Vertex cover study include Feedback vertex set and Neighbourhood.

Between 2013 and 2021, his most popular works were:

  • Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks (134 citations)
  • On Feedback Vertex Set: New Measure and New Structures (44 citations)
  • Quality-Guaranteed Event-Sensitive Data Collection and Monitoring in Vibration Sensor Networks (28 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Computer network
  • Artificial intelligence

Jianer Chen mainly investigates Combinatorics, Discrete mathematics, Algorithm, Parameterized complexity and Parameterized algorithms. His biological study spans a wide range of topics, including k-minimum spanning tree, Bounded function and Theory of computation. His Algorithm research is multidisciplinary, relying on both Graph and Graph algorithms.

His research in Parameterized complexity intersects with topics in Wireless sensor network and Computational geometry. His Parameterized algorithms study combines topics from a wide range of disciplines, such as Perspective, Binary number and Phylogenetic tree. His Spanning tree research includes themes of Mathematical optimization and Approximation algorithm.

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.

Best Publications

Privacy-preserving data mining

Wei Zhao;Jianer Chen;Nan Zhang.
(2006)

2291 Citations

Vertex Cover

Jianer Chen;Iyad A. Kanj;Weijia Jia.
Journal of Algorithms (2001)

413 Citations

Vertex Cover

Jianer Chen;Iyad A. Kanj;Weijia Jia.
Journal of Algorithms (2001)

413 Citations

Improved upper bounds for vertex cover

Jianer Chen;Iyad A. Kanj;Ge Xia.
Theoretical Computer Science (2010)

366 Citations

Improved upper bounds for vertex cover

Jianer Chen;Iyad A. Kanj;Ge Xia.
Theoretical Computer Science (2010)

366 Citations

A fixed-parameter algorithm for the directed feedback vertex set problem

Jianer Chen;Yang Liu;Songjian Lu;Barry O'Sullivan.
symposium on the theory of computing (2008)

335 Citations

A fixed-parameter algorithm for the directed feedback vertex set problem

Jianer Chen;Yang Liu;Songjian Lu;Barry O'sullivan.
Journal of the ACM (2008)

276 Citations

A fixed-parameter algorithm for the directed feedback vertex set problem

Jianer Chen;Yang Liu;Songjian Lu;Barry O'sullivan.
Journal of the ACM (2008)

276 Citations

Strong computational lower bounds via parameterized complexity

Jianer Chen;Xiuzhen Huang;Iyad A. Kanj;Ge Xia.
Journal of Computer and System Sciences (2006)

271 Citations

Strong computational lower bounds via parameterized complexity

Jianer Chen;Xiuzhen Huang;Iyad A. Kanj;Ge Xia.
Journal of Computer and System Sciences (2006)

271 Citations

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

Contact us

Best Scientists Citing Jianer Chen

Saket Saurabh

Saket Saurabh

Institute of Mathematical Sciences

Publications: 155

Jianxin Wang

Jianxin Wang

Central South University

Publications: 124

Daniel Lokshtanov

Daniel Lokshtanov

University of California, Santa Barbara

Publications: 120

Rolf Niedermeier

Rolf Niedermeier

Technical University of Berlin

Publications: 98

Fedor V. Fomin

Fedor V. Fomin

University of Bergen

Publications: 89

Michael R. Fellows

Michael R. Fellows

University of Bergen

Publications: 81

Dániel Marx

Dániel Marx

Saarland University

Publications: 79

Min Li

Min Li

Central South University

Publications: 51

Venkatesh Raman

Venkatesh Raman

Institute of Mathematical Sciences

Publications: 49

Stefan Szeider

Stefan Szeider

TU Wien

Publications: 47

Fang-Xiang Wu

Fang-Xiang Wu

University of Saskatchewan

Publications: 47

Jiong Guo

Jiong Guo

Shandong University

Publications: 46

Dimitrios M. Thilikos

Dimitrios M. Thilikos

National and Kapodistrian University of Athens

Publications: 38

Hans L. Bodlaender

Hans L. Bodlaender

Utrecht University

Publications: 34

Rodney G. Downey

Rodney G. Downey

Victoria University of Wellington

Publications: 34

MohammadTaghi Hajiaghayi

MohammadTaghi Hajiaghayi

University of Maryland, College Park

Publications: 27

Trending Scientists

Greg Mori

Greg Mori

Simon Fraser University

Daniel E. Rivera

Daniel E. Rivera

Arizona State University

Paul J. Werbos

Paul J. Werbos

University of Memphis

Weihua Tang

Weihua Tang

Beijing University of Posts and Telecommunications

Maria Varela

Maria Varela

Complutense University of Madrid

Adriano S. Melo

Adriano S. Melo

Federal University of Rio Grande do Sul

Lisa M. Ellerby

Lisa M. Ellerby

Buck Institute for Research on Aging

Witoon Prinyawiwatkul

Witoon Prinyawiwatkul

Louisiana State University Agricultural Center

Matthias Hahn

Matthias Hahn

Technical University of Kaiserslautern

Rene J. Herrera

Rene J. Herrera

Colorado College

Ellen L. Neidle

Ellen L. Neidle

University of Georgia

Gary D. Clow

Gary D. Clow

Institute of Arctic and Alpine Research

Jaime F. Olavarria

Jaime F. Olavarria

University of Washington

Rodrigo Grassi-Oliveira

Rodrigo Grassi-Oliveira

Pontifical Catholic University of Rio Grande do Sul

Kevin Fiscella

Kevin Fiscella

University of Rochester Medical Center

Russell Tytler

Russell Tytler

Deakin University

Something went wrong. Please try again later.