Michael Kaufmann

Cited by

	All	Since 2019
Citations	9442	2200
h-index	48	21
i10-index	197	57

500

250

125

375

19891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202428 53 47 52 65 84 93 87 140 126 118 113 98 123 180 168 240 262 301 306 423 406 386 461 457 438 483 451 376 422 396 432 391 338 366 271

Public access

View all

81 articles

7 articles

available

not available

Based on funding mandates

Co-authors

Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, GreeceVerified email at uoi.gr
Stephen KobourovProfessor of Computer Science, Technical University MunichVerified email at tum.de
Antonios SymvonisNational Technical U. of AthensVerified email at math.ntua.gr
Patrizio AngeliniJohn Cabot UniversityVerified email at dia.uniroma3.it
Dorothea WagnerProfessor of Computer Science, Karlsruhe Institute of Technology (KIT)Verified email at kit.edu
Prof. Dr. Hans-Peter LenhofCenter for Bioinformatics, Saarland Informatics Campus, Saarland UniversityVerified email at bioinf.uni-sb.de
Walter DidimoProfessor, University of PerugiaVerified email at unipg.it
Giuseppe LiottaProfessor of Computer Science, University of PerugiaVerified email at unipg.it
Muhammad Jawaherul AlamPh.D., Computer Science, University of ArizonaVerified email at cs.arizona.edu
Sergey PupyrevApplied ResearchVerified email at uran.ru
Fabrizio FratiFull Professor, Roma Tre UniversityVerified email at dia.uniroma3.it
Markus EiglspergerProfessor of Computer Science, University of Applied Science KonstanzVerified email at htwg-konstanz.de
Torsten UeckerdtKarlsruhe Institute of TechnologyVerified email at kit.edu
Therese BiedlUniversity of WaterlooVerified email at cs.uwaterloo.ca
Oliver KohlbacherProfessor for Applied Bioinformatics, University of TübingenVerified email at uni-tuebingen.de
Martin SiebenhalleryWorks GmbHVerified email at siebenhaller.de
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgVerified email at uni-wuerzburg.de
Christina BackesSaarland UniversityVerified email at mx.uni-saarland.de
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Katharina Anna Zweig, Katharina Ann...Computer Science, TU KaiserslauternVerified email at cs.uni-kl.de

Michael Kaufmann

Professor of Computer Science, Tübingen University

Verified email at uni-tuebingen.de

Geometric algorithms Graph drawing Combinatorial algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Drawing graphs: methods and models M Kaufmann, D Wagner Springer, 2003	832	2003
DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment AR Subramanian, M Kaufmann, B Morgenstern Algorithms for Molecular Biology 3, 1-11, 2008	309	2008
DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment AR Subramanian, J Weyer-Menkhoff, M Kaufmann, B Morgenstern BMC bioinformatics 6, 1-13, 2005	233	2005
Drawing high degree graphs with low bend numbers U Fößmeier, M Kaufmann International Symposium on Graph Drawing, 254-266, 1995	193	1995
yFiles — Visualization and Automatic Layout of Graphs R Wiese, M Eiglsperger, M Kaufmann Graph Drawing Software, 173-191, 2004	185	2004
Multi-omics enrichment analysis using the GeneTrail2 web service D Stöckel, T Kehl, P Trampert, L Schneider, C Backes, N Ludwig, ... Bioinformatics 32 (10), 1502-1508, 2016	168	2016
Embedding vertices at points: Few bends suffice for planar graphs M Kaufmann, R Wiese Journal of Graph Algorithms and Applications 6 (1), 115-129, 2002	168	2002
Boundary labeling: Models and efficient algorithms for rectangular maps MA Bekos, M Kaufmann, A Symvonis, A Wolff Computational Geometry 36 (3), 215-236, 2007	152	2007
Drawing graphs in the plane with high resolution M Formann, T Hagerup, J Haralambides, M Kaufmann, FT Leighton, ... SIAM Journal on Computing 22 (5), 1035-1052, 1993	151	1993
A systematic approach to the one-mode projection of bipartite graphs KA Zweig, M Kaufmann Social Network Analysis and Mining 1, 187-218, 2011	132	2011
A new approach for boundary recognition in geometric sensor networks SP Fekete, M Kaufmann, A Kröller, K Lehmann arXiv preprint cs/0508006, 2005	126	2005
An efficient implementation of Sugiyama’s algorithm for layered graph drawing M Eiglsperger, M Siebenhaller, M Kaufmann International Symposium on Graph Drawing, 155-166, 2004	116	2004
The art gallery theorem for polygons with holes F Hoffmann, M Kaufmann, K Kriegel [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science …, 1991	116	1991
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures H Alt, R Fleischer, M Kaufmann, K Mehlhorn, S Näher, S Schirra, C Uhrig Proceedings of the sixth annual symposium on Computational geometry, 281-289, 1990	106	1990
Channel routing of multiterminal nets S Gao, M Kaufmann Journal of the ACM (JACM) 41 (4), 791-818, 1994	104*	1994
GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments A Keller, C Backes, M Al-Awadhi, A Gerasch, J Küntzer, O Kohlbacher, ... BMC bioinformatics 9, 1-6, 2008	101	2008
Area-efficient static and incremental graph drawings TC Biedl, M Kaufmann European Symposium on Algorithms, 37-52, 1997	100	1997
Computing cartograms with optimal complexity MJ Alam, T Biedl, S Felsner, M Kaufmann, SG Kobourov, T Ueckerdt Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012	92	2012
An integer linear programming approach for finding deregulated subgraphs in regulatory networks C Backes, A Rurainski, GW Klau, O Müller, D Stöckel, A Gerasch, ... Nucleic acids research 40 (6), e43-e43, 2012	90	2012
A topology-shape-metrics approach for the automatic layout of UML class diagrams M Eiglsperger, M Kaufmann, M Siebenhaller Proceedings of the 2003 ACM symposium on Software visualization, 189-ff, 2003	87	2003

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors