Michael Kaufmann

6.1k total citations
172 papers, 2.3k citations indexed

About

Michael Kaufmann is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Michael Kaufmann has authored 172 papers receiving a total of 2.3k indexed citations (citations by other indexed papers that have themselves been cited), including 74 papers in Computer Graphics and Computer-Aided Design, 58 papers in Computational Theory and Mathematics and 49 papers in Computer Vision and Pattern Recognition. Recurrent topics in Michael Kaufmann's work include Computational Geometry and Mesh Generation (74 papers), Advanced Graph Theory Research (43 papers) and Data Visualization and Analytics (23 papers). Michael Kaufmann is often cited by papers focused on Computational Geometry and Mesh Generation (74 papers), Advanced Graph Theory Research (43 papers) and Data Visualization and Analytics (23 papers). Michael Kaufmann collaborates with scholars based in Germany, United States and Italy. Michael Kaufmann's co-authors include Burkhard Morgenstern, A R Subramanian, Andreas Gerasch, Hans‐Peter Lenhof, Christina Backes, Michael A. Bekos, Antonios Symvonis, Andreas Keller, Peter Nicholls and Katharina A. Zweig and has published in prestigious journals such as Nucleic Acids Research, Bioinformatics and International Journal of Cancer.

In The Last Decade

Michael Kaufmann

152 papers receiving 2.1k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Michael Kaufmann Germany 25 657 499 444 336 274 172 2.3k
Mike Houston United States 19 736 1.1× 706 1.4× 554 1.2× 176 0.5× 1.3k 4.8× 36 3.5k
Jens Krüger Germany 24 530 0.8× 961 1.9× 765 1.7× 249 0.7× 986 3.6× 125 4.0k
Bruce R. Donald United States 44 2.1k 3.1× 1.5k 2.9× 321 0.7× 508 1.5× 329 1.2× 178 5.6k
Edward A. Bender United States 25 286 0.4× 144 0.3× 109 0.2× 1.0k 3.1× 293 1.1× 126 4.8k
Emden R. Gansner United States 20 444 0.7× 900 1.8× 162 0.4× 359 1.1× 715 2.6× 50 3.2k
Stephen C. North United States 25 444 0.7× 1.4k 2.9× 211 0.5× 304 0.9× 475 1.7× 63 3.1k
Andreas Schadschneider Germany 47 436 0.7× 384 0.8× 17 0.0× 452 1.3× 231 0.8× 162 8.9k
Nicholas Wormald Australia 29 152 0.2× 180 0.4× 223 0.5× 1.4k 4.2× 472 1.7× 145 3.0k
Eric Mjolsness United States 32 1.9k 2.9× 1.5k 2.9× 82 0.2× 133 0.4× 141 0.5× 116 4.7k
Elchanan Mossel United States 34 582 0.9× 140 0.3× 191 0.4× 1.3k 3.9× 627 2.3× 169 4.1k

Countries citing papers authored by Michael Kaufmann

Since Specialization
Citations

This map shows the geographic impact of Michael Kaufmann's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Kaufmann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Kaufmann more than expected).

Fields of papers citing papers by Michael Kaufmann

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Kaufmann. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Kaufmann. The network helps show where Michael Kaufmann may publish in the future.

Co-authorship network of co-authors of Michael Kaufmann

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Kaufmann. A scholar is included among the top collaborators of Michael Kaufmann based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Kaufmann. Michael Kaufmann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Angelini, Patrizio, Michael A. Bekos, Giuseppe Di Battista, et al.. (2023). Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications. 43(3). 24–35. 1 indexed citations
2.
Didimo, Walter, et al.. (2023). Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time. Algorithmica. 85(9). 2605–2666. 1 indexed citations
3.
Angelini, Patrizio, et al.. (2018). Beyond Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. 2 indexed citations
4.
Hong, Seok-Hee, Michael Kaufmann, Stephen Kobourov, & János Pach. (2017). Beyond-Planar Graphs: Algorithmics and Combinatorics. 6(11). 1 indexed citations
5.
Kaufmann, Michael, et al.. (2015). On Bar (1, j)-Visibility Graphs - (Extended Abstract).. 246–257. 1 indexed citations
6.
Giacomo, Emilio Di, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, & Fabrizio Montecchiani. (2014). Upward-rightward planar drawings. 145–150. 1 indexed citations
7.
Das, Aparna, et al.. (2013). Maximum Differential Coloring of Caterpillars and Spiders. arXiv (Cornell University). 1 indexed citations
8.
Angelini, Patrizio, et al.. (2012). On the area requirements of Euclidean minimum spanning trees. Computational Geometry. 47(2). 200–213. 1 indexed citations
9.
Kaufmann, Michael & Dorothea Wagner. (2007). Graph drawing : 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006 : revised papers. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).
10.
Luxburg, Ulrike von, Stefanie Jegelka, Michael Kaufmann, & Sébastien Bubeck. (2007). Consistent Minimization of Clustering Objective Functions. MPG.PuRe (Max Planck Society). 20. 961–968. 8 indexed citations
11.
Kaufmann, Michael, Jan Kratochvı́l, Katharina Lehmann, & A R Subramanian. (2006). Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. Symposium on Discrete Algorithms. 832–841. 17 indexed citations
12.
Kaufmann, Michael. (2005). The Solace of Bad Form: Tim O'Brien's Postmodernist Revisions of Vietnam in "Speaking of Courage". UST Research Online (University of St. Thomas - Minnesota). 46(4). 2 indexed citations
13.
Kaufmann, Michael, et al.. (2002). ELECTRONIC BRAINSTORMING WITH GRAPHICAL STRUCTURES OF IDEAS. Journal of the Association for Information Systems. 120–130. 3 indexed citations
14.
Kaufmann, Michael, et al.. (2001). kappa NUMA: A Model for Clusters of SMP-Machines. Proceedings of the International Conference on Parallel Processing. 42–50. 2 indexed citations
15.
Kaufmann, Michael, et al.. (2001). Drawing graphs: methods and models. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 312–312. 176 indexed citations
16.
Eiglsperger, Markus, et al.. (2000). Orthogonal graph drawing with constraints. Symposium on Discrete Algorithms. 3–11. 7 indexed citations
17.
Biedl, Thérèse, Michael Kaufmann, & Petra Mutzel. (1998). Drawing Planar Partitions II: HH-Drawings. Max Planck Institute for Plasma Physics. 124–136. 7 indexed citations
18.
Kaufmann, Michael, et al.. (1997). Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. Discrete & Computational Geometry. 18(1). 93–109. 7 indexed citations
19.
Kaufmann, Michael, Jop F. Sibeyn, & Torsten Suel. (1994). Derandomizing algorithms for routing and sorting on meshes. Symposium on Discrete Algorithms. 669–679. 27 indexed citations
20.
Kaufmann, Michael & Jop F. Sibeyn. (1991). Randomized Multi-Packet Routing on Meshes. Data Archiving and Networked Services (DANS). 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Mike Houston Breakdown of academic impact, for papers by Jens Krüger Breakdown of academic impact, for papers by Bruce R. Donald Breakdown of academic impact, for papers by Edward A. Bender Breakdown of academic impact, for papers by Emden R. Gansner Breakdown of academic impact, for papers by Stephen C. North Breakdown of academic impact, for papers by Andreas Schadschneider Breakdown of academic impact, for papers by Nicholas Wormald Breakdown of academic impact, for papers by Eric Mjolsness Breakdown of academic impact, for papers by Elchanan Mossel
Rankless by CCL
2026