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.
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.
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.
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.
Drawing graphs: methods and models
Michael Kaufmann;Dorothea Wagner.
Drawing graphs: methods and models (2001)
DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment
Amarendran R Subramanian;Michael Kaufmann;Burkhard Morgenstern.
Algorithms for Molecular Biology (2008)
Identification of plasma-edge-related operational regime boundaries and the effect of edge instability on confinement in ASDEX Upgrade
W Suttrop;M Kaufmann;H J de Blank;B Brüsehaber.
Plasma Physics and Controlled Fusion (1997)
Energy flux to the ASDEX-Upgrade diverter plates determined by thermography and calorimetry
A Herrmann;W Junker;K Gunther;S Bosch.
Plasma Physics and Controlled Fusion (1995)
ELM pace making and mitigation by pellet injection in ASDEX Upgrade
P. T. Lang;G. D. Conway;T. Eich;L. Fattorini.
Nuclear Fusion (2004)
High-Efficiency Plasma Refuelling by Pellet Injection from the Magnetic High-Field Side into ASDEX Upgrade
P. T. Lang;K. Buchl;M. Kaufmann;R. S. Lang.
Physical Review Letters (1997)
DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment.
Amarendran R Subramanian;Jan Weyer-Menkhoff;Michael Kaufmann;Burkhard Morgenstern.
BMC Bioinformatics (2005)
Drawing High Degree Graphs with Low Bend Numbers
Ulrich Fößmeier;Michael Kaufmann.
graph drawing (1995)
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
Michael Kaufmann;Roland Wiese.
Journal of Graph Algorithms and Applications (2002)
Observation of continuous divertor detachment in H-mode discharges in ASDEX upgrade.
O. Gruber;A. Kallenbach;M. Kaufmann;K. Lackner.
Physical Review Letters (1995)
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.
University of Arizona
Harvard Medical School
École Polytechnique Fédérale de Lausanne
Max Planck Institute for Plasma Physics
Max Planck Institute for Informatics
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: