D-Index & Metrics Best Publications

D-Index & Metrics

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
Computer Science D-index 39 Citations 5,900 189 World Ranking 4746 National Ranking 127

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Artificial intelligence
  • Algebra

His main research concerns Mathematical optimization, Holocene, Evolutionary algorithm, Climate change and Palynology. In his study, Point and Combinatorics is strongly linked to Algorithm, which falls under the umbrella field of Mathematical optimization. His study focuses on the intersection of Holocene and fields such as Shore with connections in the field of Transect.

Frank Neumann has included themes like Function, Evolutionary computation, Time complexity and Heuristic in his Evolutionary algorithm study. His Climate change study combines topics in areas such as Climatology, Quaternary and Fire regime. The concepts of his Palynology study are interwoven with issues in Mediterranean climate, Sea surface temperature and Vegetation.

His most cited work include:

  • Automatic tracking of individual fluorescence particles: application to the study of chromosome dynamics (358 citations)
  • Predictability of biomass burning in response to climate changes (291 citations)
  • Predictability of biomass burning in response to climate changes (291 citations)

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

His primary areas of study are Mathematical optimization, Evolutionary algorithm, Evolutionary computation, Optimization problem and Multi-objective optimization. His Point research extends to Mathematical optimization, which is thematically connected. His Evolutionary algorithm research is multidisciplinary, incorporating elements of Algorithm, Theoretical computer science, Heuristics and Vertex cover.

The study incorporates disciplines such as Time complexity and Search algorithm in addition to Heuristics. To a larger extent, Frank Neumann studies Artificial intelligence with the aim of understanding Evolutionary computation. His Combinatorial optimization research incorporates themes from Minimum spanning tree and Spanning tree.

He most often published in these fields:

  • Mathematical optimization (44.59%)
  • Evolutionary algorithm (41.61%)
  • Evolutionary computation (15.29%)

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

  • Evolutionary algorithm (41.61%)
  • Mathematical optimization (44.59%)
  • Evolutionary computation (15.29%)

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

Frank Neumann mainly investigates Evolutionary algorithm, Mathematical optimization, Evolutionary computation, Constraint and Knapsack problem. His Evolutionary algorithm study combines topics from a wide range of disciplines, such as Theoretical computer science, Local search, Travelling salesman problem, Heuristics and Graph. Many of his studies on Mathematical optimization involve topics that are commonly interrelated, such as Key.

His studies in Evolutionary computation integrate themes in fields like Discrete optimization and Spanning tree. His Constraint research integrates issues from Function, Upper and lower bounds, Chernoff bound and Theory of computation. The various areas that he examines in his Knapsack problem study include Range, Structure, Crossover and Multi-objective optimization.

Between 2018 and 2021, his most popular works were:

  • Automated Algorithm Selection: Survey and Perspectives (101 citations)
  • Theory of evolutionary computation : recent developments in discrete optimization (27 citations)
  • Robust Fitting in Computer Vision: Easy or Hard? (25 citations)

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

  • Artificial intelligence
  • Algorithm
  • Mathematical optimization

The scientist’s investigation covers issues in Evolutionary algorithm, Mathematical optimization, Constraint, Knapsack problem and Evolutionary computation. His Evolutionary algorithm research incorporates elements of Dynamic problem, Travelling salesman problem, Theoretical computer science and Heuristics. Frank Neumann is studying Optimization problem, which is a component of Mathematical optimization.

His Optimization problem study integrates concerns from other disciplines, such as Point, Theory of computation and Ant colony optimization algorithms. His Constraint study incorporates themes from Function, Submodular set function, Chernoff bound and Greedy algorithm. His Knapsack problem research focuses on Range and how it connects with Polynomial-time approximation scheme, Traveling purchaser problem, Stochastic optimization and Dynamic programming.

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

Automatic tracking of individual fluorescence particles: application to the study of chromosome dynamics

D. Sage;F.R. Neumann;F. Hediger;S.M. Gasser.
IEEE Transactions on Image Processing (2005)

473 Citations

Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity

Frank Neumann;Carsten Witt.
(2010)

389 Citations

Nuclear size control in fission yeast

Frank R. Neumann;Paul Nurse.
Journal of Cell Biology (2007)

379 Citations

Live Imaging of Telomeres: yKu and Sir Proteins Define Redundant Telomere-Anchoring Pathways in Yeast

Florence Hediger;Frank R. Neumann;Griet Van Houwe;Karine Dubrana.
Current Biology (2002)

354 Citations

Separation of silencing from perinuclear anchoring functions in yeast Ku80, Sir4 and Esc1 proteins.

Angela Taddei;Florence Hediger;Frank R Neumann;Christoph Bauer.
The EMBO Journal (2004)

304 Citations

Predictability of biomass burning in response to climate changes

A.L. Daniau;P.J. Bartlein;S.P. Harrison;S.P. Harrison;I.C. Prentice;I.C. Prentice;I.C. Prentice.
Global Biogeochemical Cycles (2012)

291 Citations

The Function of Nuclear Architecture: A Genetic Approach

Angela Taddei;Florence Hediger;Frank R. Neumann;Susan M. Gasser.
Annual Review of Genetics (2004)

290 Citations

Randomized local search, evolutionary algorithms, and the minimum spanning tree problem

Frank Neumann;Ingo Wegener.
Theoretical Computer Science (2007)

273 Citations

Sir-Mediated Repression Can Occur Independently of Chromosomal and Subnuclear Contexts

Marc R. Gartenberg;Frank R. Neumann;Thierry Laroche;Marek Blaszczyk;Marek Blaszczyk.
Cell (2004)

195 Citations

Bioinspired Computation in Combinatorial Optimization

Frank Neumann;Carsten Witt.
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (2010)

187 Citations

Best Scientists Citing Frank Neumann

Benjamin Doerr

Benjamin Doerr

Max Planck Institute for Informatics

Publications: 113

Dirk Sudholt

Dirk Sudholt

University of Sheffield

Publications: 76

Carsten Witt

Carsten Witt

Technical University of Denmark

Publications: 57

Xin Yao

Xin Yao

Southern University of Science and Technology

Publications: 47

Tobias Friedrich

Tobias Friedrich

Hasso Plattner Institute

Publications: 32

David Kaniewski

David Kaniewski

Paul Sabatier University

Publications: 32

Brian M. Chase

Brian M. Chase

Centre national de la recherche scientifique, CNRS

Publications: 27

Michael E. Meadows

Michael E. Meadows

University of Cape Town

Publications: 26

Thomas Jansen

Thomas Jansen

Aberystwyth University

Publications: 25

Ke Tang

Ke Tang

Southern University of Science and Technology

Publications: 24

Joachim Weickert

Joachim Weickert

Saarland University

Publications: 20

Zhi-Hua Zhou

Zhi-Hua Zhou

Nanjing University

Publications: 20

Carlos A. Coello Coello

Carlos A. Coello Coello

CINVESTAV

Publications: 19

Thomas Litt

Thomas Litt

University of Bonn

Publications: 17

Kalyanmoy Deb

Kalyanmoy Deb

Michigan State University

Publications: 17

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-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
Something went wrong. Please try again later.