What is he best known for?
The fields of study he is best known for:
- Algorithm
- Programming language
- Geometry
His primary areas of study are ASDEX Upgrade, Atomic physics, Plasma, Tokamak and Divertor.
His ASDEX Upgrade study integrates concerns from other disciplines, such as Nuclear engineering, Electron temperature and Magnetic confinement fusion.
The concepts of his Atomic physics study are interwoven with issues in Electron, Neutral beam injection, Fusion power and Scaling.
His studies examine the connections between Plasma and genetics, as well as such issues in Pellet, with regards to High field.
Michael Kaufmann combines subjects such as Range, Ohmic contact and Instability with his study of Tokamak.
The study incorporates disciplines such as Effective radiated power, Neon and Collisionality in addition to Divertor.
His most cited work include:
- Drawing graphs: methods and models (275 citations)
- DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment (215 citations)
- DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment. (189 citations)
What are the main themes of his work throughout his whole career to date?
Michael Kaufmann focuses on Combinatorics, Discrete mathematics, Planar graph, ASDEX Upgrade and Atomic physics.
The study of Combinatorics is intertwined with the study of Planar in a number of ways.
The Discrete mathematics study combines topics in areas such as Routing and Algorithm.
His Planar graph research is multidisciplinary, incorporating perspectives in Time complexity, Embedding, Book embedding, Vertex and Planar straight-line graph.
His ASDEX Upgrade research integrates issues from Nuclear engineering and Divertor.
In most of his Atomic physics studies, his work intersects topics such as Electron.
He most often published in these fields:
- Combinatorics (37.61%)
- Discrete mathematics (21.32%)
- Planar graph (20.97%)
What were the highlights of his more recent work (between 2012-2021)?
- Combinatorics (37.61%)
- Planar graph (20.97%)
- Graph (13.17%)
In recent papers he was focusing on the following fields of study:
Michael Kaufmann mainly focuses on Combinatorics, Planar graph, Graph, Discrete mathematics and Planar.
His research on Combinatorics frequently links to adjacent areas such as Upper and lower bounds.
His Planar graph research is multidisciplinary, relying on both Time complexity, Embedding, Multiple edges, Planar straight-line graph and Edge.
In general Graph, his work in Bipartite graph is often linked to Edge density linking many areas of study.
His study in Planar is interdisciplinary in nature, drawing from both Planarity testing, Partition, Coloring problem, Bundle and Integer grid.
His Graph drawing research incorporates elements of Intersection, Vertex and Heuristic.
Between 2012 and 2021, his most popular works were:
- Multi-omics enrichment analysis using the GeneTrail2 web service (95 citations)
- The Density of Fan-Planar Graphs. (49 citations)
- Computing Cartograms with Optimal Complexity (40 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algorithm
- Programming language
His primary areas of study are Combinatorics, Planar graph, Graph, Discrete mathematics and Vertex.
Much of his study explores Combinatorics relationship to Planar.
Michael Kaufmann interconnects 1-planar graph, Chordal graph, Book embedding, Multiple edges and Upper and lower bounds in the investigation of issues within Planar graph.
Michael Kaufmann has included themes like Maximization, Embedding, Heuristic and Algorithm, Heuristic in his Graph study.
His study in the field of Outerplanar graph, Complement graph, Line graph and Force-directed graph drawing also crosses realms of Visual clutter.
His Vertex research includes themes of Plane and Planar straight-line graph.
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.
