H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 32 Citations 5,941 94 World Ranking 6989 National Ranking 338
Mathematics H-index 39 Citations 6,892 96 World Ranking 1086 National Ranking 67

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Geometry
  • Combinatorics

Discrete mathematics, Mathematical optimization, Algorithm, Combinatorics and Integer programming are his primary areas of study. His study in the field of Indifference graph, Pathwidth, Chordal graph and Graph drawing also crosses realms of Constructive. His Algorithm study combines topics in areas such as Iterated function, Theoretical computer science, Heuristics and Minification.

His Theoretical computer science study integrates concerns from other disciplines, such as Unified Modeling Language, Software, Class diagram, Relational database and Visualization. His biological study spans a wide range of topics, including Crossing number, Bipartite graph and Minimization problem. His biological study spans a wide range of topics, including Travelling salesman problem and Maximum cut.

His most cited work include:

  • An application of combinatorial optimization to statistical physics and circuit layout design (350 citations)
  • Graph Drawing Software (299 citations)
  • A Cutting Plane Algorithm for the Linear Ordering Problem (267 citations)

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

Michael Jünger mainly investigates Combinatorics, Discrete mathematics, Algorithm, Mathematical optimization and Integer programming. His work carried out in the field of Algorithm brings together such families of science as Graph drawing, Heuristics, Degree and Minification. Michael Jünger has included themes like Linear programming and Combinatorial optimization in his Integer programming study.

His studies in Combinatorial optimization integrate themes in fields like Programming language and Travelling salesman problem. His Planar graph study incorporates themes from Planarity testing and Directed acyclic graph. His Branch and cut research includes elements of Maximum cut and Branch and price.

He most often published in these fields:

  • Combinatorics (32.54%)
  • Discrete mathematics (29.59%)
  • Algorithm (23.08%)

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

  • Algorithm (23.08%)
  • Mathematical optimization (20.12%)
  • Flow (2.96%)

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

His scientific interests lie mostly in Algorithm, Mathematical optimization, Flow, Graph drawing and Minification. His Algorithm research is multidisciplinary, incorporating elements of Edge and Code generation. His work in the fields of Mathematical optimization, such as Integer programming, Heuristic, Branch and cut and Combinatorial optimization, overlaps with other areas such as Network planning and design.

His Branch and cut study combines topics in areas such as Branch and price and Basic block. The Graph drawing study combines topics in areas such as Planarity testing, Graph, Monotone polygon and Flow network. Michael Jünger works mostly in the field of Minification, limiting it down to topics relating to Line and, in certain cases, Theoretical computer science, as a part of the same area of interest.

Between 2010 and 2021, his most popular works were:

  • The Open Graph Drawing Framework (OGDF) (94 citations)
  • Crossings and Planarization (34 citations)
  • The Open Graph Drawing Framework (24 citations)

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

  • Algorithm
  • Geometry
  • Combinatorics

His primary areas of study are Minification, Discrete mathematics, Open graph, Theoretical computer science and Graph drawing. His research investigates the connection with Minification and areas like Algorithm which intersect with concerns in Representation. His Combinatorics research extends to Discrete mathematics, which is thematically connected.

His study in Theoretical computer science is interdisciplinary in nature, drawing from both Cluster analysis and Artificial intelligence. His Graph drawing research is multidisciplinary, relying on both Heuristic, Heuristics, Special case, Scheme and Integer programming. His Mathematical optimization study combines topics from a wide range of disciplines, such as Large set and Polytope.

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

An application of combinatorial optimization to statistical physics and circuit layout design

Francisco Barahona;Martin Grötschel;Michael Jünger;Gerhard Reinelt.
Operations Research (1988)

517 Citations

A Cutting Plane Algorithm for the Linear Ordering Problem

Martin Grötschel;Michael Jünger;Gerhard Reinelt.
Operations Research (1984)

445 Citations

50 years of integer programming 1958-2008 : from the early years to the state-of-the-art

M. Jünger.
(2010)

403 Citations

Drawing large graphs with a potential-field-based multilevel algorithm

Stefan Hachul;Michael Jünger.
graph drawing (2004)

324 Citations

Graph Drawing Software

Michael Junger;Petra Mutzel.
(2003)

299 Citations

2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms

Michael Jünger;Petra Mutzel.
Journal of Graph Algorithms and Applications (1997)

264 Citations

50 Years of Integer Programming 1958-2008

Michael Jünger;Thomas M. Liebling;Denis Naddef;George L. Nemhauser.
(2010)

251 Citations

Experiments in quadratic 0-1 programming

F. Barahona;M. Junger;G. Reinelt.
Mathematical Programming (1989)

251 Citations

Facets of the linear ordering polytope

Martin Grötschel;Michael Jünger;Gerhard Reinelt.
Mathematical Programming (1985)

229 Citations

Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm

C. De Simone;M. Diehl;M. Jünger;P. Mutzel.
Journal of Statistical Physics (1995)

179 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 Michael Jünger

Giuseppe Di Battista

Giuseppe Di Battista

Roma Tre University

Publications: 53

Petra Mutzel

Petra Mutzel

University of Bonn

Publications: 51

Stephen G. Kobourov

Stephen G. Kobourov

University of Arizona

Publications: 42

Giuseppe Liotta

Giuseppe Liotta

University of Perugia

Publications: 42

Peter Eades

Peter Eades

University of Sydney

Publications: 41

Michael Kaufmann

Michael Kaufmann

University of Tübingen

Publications: 29

Kwan-Liu Ma

Kwan-Liu Ma

University of California, Davis

Publications: 28

Gerhard Reinelt

Gerhard Reinelt

Heidelberg University

Publications: 21

Franz Rendl

Franz Rendl

University of Klagenfurt

Publications: 20

Panos M. Pardalos

Panos M. Pardalos

University of Florida

Publications: 20

David Eppstein

David Eppstein

University of California, Irvine

Publications: 19

Rafael Martí

Rafael Martí

University of Valencia

Publications: 19

Ulrik Brandes

Ulrik Brandes

ETH Zurich

Publications: 18

Falk Schreiber

Falk Schreiber

University of Konstanz

Publications: 17

Andrea Lodi

Andrea Lodi

Polytechnique Montréal

Publications: 16

Something went wrong. Please try again later.