World's Best Scientists 2026 revealed!
Michael Kaufmann

Michael Kaufmann

D-Index & Metrics

Computer Science

D-Index
42
Citations
7255
World Ranking
8407
National Ranking
410

Overview

Michael Kaufmann is affiliated with the University of Tübingen in Germany. Their research primarily spans the fields of Computer Science and Engineering, with a focus on several subfields including Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Computer Networks and Communications, and Electrical and Electronic Engineering.

The scientist's work addresses main topics such as Computational Geometry and Mesh Generation, Advanced Graph Theory Research, Digital Image Processing Techniques, Data Visualization and Analytics, graph theory and CDMA systems, 3D Modeling in Geospatial Applications, and Optimization and Search Problems.

Michael Kaufmann's recent publications illustrate the scope and focus of their research contributions. These include:

  • The Density of Fan-Planar Graphs, 2022, The Electronic Journal of Combinatorics
  • Queue Layouts of Planar 3-Trees, 2020, Algorithmica
  • Splitting Vertices in 2-Layer Graph Drawings, 2023, IEEE Computer Graphics and Applications
  • On Compact RAC Drawings, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Graph Product Structure for h-Framed Graphs, 2022, arXiv (Cornell University)

Kaufmann has frequently published in several venues, with numerous works appearing in arXiv (Cornell University), Leibniz-Zentrum für Informatik (Schloss Dagstuhl), Journal of Graph Algorithms and Applications, Lecture Notes in Computer Science, and Algorithmica.

The scientist's collaborative network includes frequent co-authors such as Michael A. Bekos, Giuseppe Liotta, Walter Didimo, Sergey Pupyrev, and Torsten Ueckerdt. This network reflects concentrated collaborations in graph theory and computational geometry research areas.

Best Publications

  • Drawing graphs: methods and models

    Michael Kaufmann;Dorothea Wagner

  • DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment

    Amarendran R Subramanian;Michael Kaufmann;Burkhard Morgenstern

  • An integer linear programming approach for finding deregulated subgraphs in regulatory networks

    Christina Backes;Alexander Rurainski;Gunnar W. Klau;Oliver Müller

  • DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment.

    Amarendran R Subramanian;Jan Weyer-Menkhoff;Michael Kaufmann;Burkhard Morgenstern

  • Tungsten as first wall material in fusion devices

    M. Kaufmann;R. Neu

  • Drawing High Degree Graphs with Low Bend Numbers

    Ulrich Fößmeier;Michael Kaufmann

  • Embedding Vertices at Points: Few Bends Suffice for Planar Graphs

    Michael Kaufmann;Roland Wiese

  • An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing

    Markus Eiglsperger;Martin Siebenhaller;Michael Kaufmann

  • Computing Cartograms with Optimal Complexity

    Md. Jawaherul Alam;Therese C. Biedl;Stefan Felsner;Michael Kaufmann

  • Multi-omics enrichment analysis using the GeneTrail2 web service

    Daniel Stöckel;Tim Kehl;Patrick Trampert;Lara Schneider

  • Boundary labeling: Models and efficient algorithms for rectangular maps

    Michael A. Bekos;Michael Kaufmann;Antonios Symvonis;Alexander Wolff

  • yFiles — Visualization and Automatic Layout of Graphs

    Roland Wiese;Markus Eiglsperger;Michael Kaufmann

  • A systematic approach to the one-mode projection of bipartite graphs

    Katharina Anna Zweig;Michael Kaufmann

  • Drawing graphs in the plane with high resolution

    M. Formann;T. Hagerup;J. Haralambides;M. Kaufmann

  • A New Approach for Boundary Recognition in Geometric Sensor Networks.

    Sándor P. Fekete;Michael Kaufmann;Alexander Kröller;Katharina Anna Lehmann

  • Approximate motion planning and the complexity of the boundary of the union of simple geometric figures

    Helmut Alt;Rudolf Fleischer;Michael Kaufmann;Kurt Mehlhorn

  • An efficient implementation of sugiyama's algorithm for layered graph drawing

    Markus Eiglsperger;Martin Siebenhaller;Michael Kaufmann

  • The art gallery theorem for polygons with holes

    F. Hoffmann;M. Kaufmann;K. Kriegel

  • Area-Efficient Static and Incremental Graph Drawings

    Therese C. Biedl;Michael Kaufmann

  • GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments.

    Andreas Keller;Christina Backes;Maher Al-Awadhi;Andreas Gerasch

  • Channel routing of multiterminal nets

    Shaodi Gao;Michael Kaufmann

  • A topology-shape-metrics approach for the automatic layout of UML class diagrams

    Markus Eiglsperger;Michael Kaufmann;Martin Siebenhaller

  • Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191)

    Camil Demetrescu;Michael Kaufmann;Stephen G. Kobourov;Petra Mutzel

Frequent Co-Authors

A. Kallenbach
A. Kallenbach Max Planck Society
F. Ryter
F. Ryter Max Planck Society
H. Zohm
H. Zohm Max Planck Institute for Plasma Physics
Stephen G. Kobourov
Stephen G. Kobourov University of Arizona
A. Herrmann
A. Herrmann Max Planck Society
Wolf-Dieter Schneider
Wolf-Dieter Schneider École Polytechnique Fédérale de Lausanne
R. Dux
R. Dux Max Planck Society
R. Neu
R. Neu Max Planck Institute for Plasma Physics
J. Roth
J. Roth Max Planck Society
Kurt Mehlhorn
Kurt Mehlhorn Max Planck Institute for Informatics

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

Report an issue

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:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens up a range of online degree options and diverse career pathways. Many universities now offer flexible learning formats so you can advance your education while balancing work and life commitments.

For professionals aiming to combine technical skills with leadership, an online emba can provide crucial management expertise to move into senior roles. Those interested in information organization or digital management may pursue the most affordable online mlis programs for a specialized approach to data, libraries, or archives.

If affordability is a priority, consider starting with one of the many affordable online masters programs across fields related to tech, business, and more. For those aspiring to top executive or academic positions, a doctorate in organizational leadership online can maximize your impact in organizations shaping the future of technology.

Whichever path you choose, these online degree options help support versatile careers in the fast-evolving landscape of computer science and beyond.

Best Scientists Citing Michael Kaufmann

Trending Scientists