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 38 Citations 12,103 101 World Ranking 1526 National Ranking 85
Computer Science D-index 40 Citations 12,527 104 World Ranking 5632 National Ranking 262

Research.com Recognitions

Awards & Achievements

2010 - EURO Gold Medal

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Mathematical optimization
  • Algebra

Rolf H. Möhring spends much of his time researching Mathematical optimization, Scheduling, Discrete mathematics, Interval graph and Time complexity. His research in Mathematical optimization intersects with topics in Rate-monotonic scheduling, Dynamic priority scheduling and Resource allocation. The concepts of his Dynamic priority scheduling study are interwoven with issues in Scheduling and Fair-share scheduling.

His Scheduling research incorporates elements of Least slack time scheduling and Operations research. He does research in Scheduling, focusing on Job shop scheduling specifically. His Discrete mathematics research includes elements of Tree, Combinatorics, Combinatorial optimization and Decomposition.

His most cited work include:

  • Resource-constrained project scheduling: Notation, classification, models, and methods (1246 citations)
  • Scheduling project networks with resource constraints and time windows (323 citations)
  • Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization (242 citations)

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

Rolf H. Möhring focuses on Mathematical optimization, Combinatorics, Scheduling, Discrete mathematics and Algorithm. His Mathematical optimization research is multidisciplinary, incorporating elements of Dynamic priority scheduling and Job shop scheduling. In his study, Heuristic is inextricably linked to Fair-share scheduling, which falls within the broad field of Job shop scheduling.

His work deals with themes such as Time complexity, Decision support system and Theoretical computer science, which intersect with Scheduling. Rolf H. Möhring works mostly in the field of Discrete mathematics, limiting it down to topics relating to Comparability and, in certain cases, Ordered set. As part of one scientific family, he deals mainly with the area of Scheduling, narrowing it down to issues related to the Operations research, and often Network planning and design.

He most often published in these fields:

  • Mathematical optimization (35.59%)
  • Combinatorics (23.73%)
  • Scheduling (18.64%)

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

  • Combinatorics (23.73%)
  • Price of anarchy (5.93%)
  • Mathematical optimization (35.59%)

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

His main research concerns Combinatorics, Price of anarchy, Mathematical optimization, Approximation algorithm and Combinatorial optimization. His Combinatorics study integrates concerns from other disciplines, such as Algorithm and Polynomial. Rolf H. Möhring has researched Mathematical optimization in several fields, including Convergence and Job shop scheduling.

The various areas that he examines in his Job shop scheduling study include Local search, Graph and Traffic optimization. His Combinatorial optimization research is multidisciplinary, incorporating elements of Disjoint sets, Partition, Performance guarantee and Meta heuristic. His Travelling salesman problem study incorporates themes from Scheduling and Independent set.

Between 2011 and 2021, his most popular works were:

  • Strong equilibria in games with the lexicographical improvement property (31 citations)
  • Stochastic Runtime Analysis of the Cross-Entropy Algorithm (18 citations)
  • Computing network tolls with support constraints (16 citations)

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

  • Algorithm
  • Algebra
  • Mathematical optimization

Rolf H. Möhring mostly deals with Mathematical optimization, Function, Job shop scheduling, Adaptive routing and Local search. He is interested in Optimization problem, which is a field of Mathematical optimization. His work in the fields of Function, such as Continuous function, overlaps with other areas such as Class, Pairwise comparison and Pareto efficiency.

His studies deal with areas such as Graph and Traffic optimization as well as Job shop scheduling.

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

Resource-constrained project scheduling: Notation, classification, models, and methods

Peter Brucker;Andreas Drexl;Rolf H. Möhring;Klaus Neumann.
European Journal of Operational Research (1999)

5578 Citations

Scheduling project networks with resource constraints and time windows

M. Bartusch;R. H. Mohring;F. J. Radermacher.
Annals of Operations Research (1988)

537 Citations

Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization

R.H. Möhring;F.J. Radermacher.
North-holland Mathematics Studies (1984)

361 Citations

The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications

Christian Liebchen;Marco Lübbecke;Rolf Möhring;Sebastian Stiller.
Lecture Notes in Computer Science (2009)

352 Citations

Algorithmic Aspects of Comparability Graphs and Interval Graphs

Rolf H. Möhring.
(1985)

288 Citations

System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion

Olaf Jahn;Rolf H. Möhring;Andreas S. Schulz;Nicolás E. Stier-Moses.
Operations Research (2005)

283 Citations

Solving Project Scheduling Problems by Minimum Cut Computations

Rolf H. Möhring;Andreas S. Schulz;Frederik Stork;Marc Uetz.
Management Science (2003)

283 Citations

The pathwidth and treewidth of cographs

Hans L. Bodlaender;Rolf H. Möhring.
SIAM Journal on Discrete Mathematics (1993)

281 Citations

Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time

Rolf H. Möhring.
Operations Research (1984)

263 Citations

An incremental linear-time algorithm for recognizing interval graphs

Norbert Korte;Rolf H. Möhring.
SIAM Journal on Computing (1989)

256 Citations

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

Contact us

Best Scientists Citing Rolf H. Möhring

Mario Vanhoucke

Mario Vanhoucke

Ghent University

Publications: 106

Hans L. Bodlaender

Hans L. Bodlaender

Utrecht University

Publications: 51

Michel Habib

Michel Habib

Université Paris Cité

Publications: 42

Willy Herroelen

Willy Herroelen

KU Leuven

Publications: 42

Daniel Delling

Daniel Delling

Apple (United States)

Publications: 38

Dorothea Wagner

Dorothea Wagner

Karlsruhe Institute of Technology

Publications: 33

Anita Schöbel

Anita Schöbel

Technical University of Kaiserslautern

Publications: 30

Dieter Kratsch

Dieter Kratsch

University of Lorraine

Publications: 28

Erik Demeulemeester

Erik Demeulemeester

KU Leuven

Publications: 27

Peter Sanders

Peter Sanders

Karlsruhe Institute of Technology

Publications: 27

Andreas Brandstädt

Andreas Brandstädt

University of Rostock

Publications: 27

Dimitrios M. Thilikos

Dimitrios M. Thilikos

National and Kapodistrian University of Athens

Publications: 24

Andreas S. Schulz

Andreas S. Schulz

Technical University of Munich

Publications: 22

Renato F. Werneck

Renato F. Werneck

Microsoft (United States)

Publications: 20

Martin Skutella

Martin Skutella

Technical University of Berlin

Publications: 18

Andrew V. Goldberg

Andrew V. Goldberg

Amazon (United States)

Publications: 18

Trending Scientists

Bidyut B. Chaudhuri

Bidyut B. Chaudhuri

Indian Statistical Institute

Jayaraman Balamurugan

Jayaraman Balamurugan

Jeonbuk National University

José Manuel Domínguez

José Manuel Domínguez

Universidade de Vigo

Pengfei Yan

Pengfei Yan

Heilongjiang University

Yong Pei

Yong Pei

Xiangtan University

Michael Curt Elwenspoek

Michael Curt Elwenspoek

University of Twente

Wei Yang

Wei Yang

Sichuan University

Christopher H. Lusk

Christopher H. Lusk

University of Waikato

Tim Newbold

Tim Newbold

University College London

Robert J. Fletcher

Robert J. Fletcher

University of Florida

Ken-ichiro Hayashi

Ken-ichiro Hayashi

Okayama University of Science

Alex C. Ruane

Alex C. Ruane

Goddard Institute for Space Studies

Wayne P. Maddison

Wayne P. Maddison

University of British Columbia

Vittorio E. Brando

Vittorio E. Brando

National Research Council (CNR)

Chaim Brautbar

Chaim Brautbar

Hebrew University of Jerusalem

Thomas Münzel

Thomas Münzel

Johannes Gutenberg University of Mainz

Something went wrong. Please try again later.