Michael Kaufmann

引用次数

	总计	2019 年至今
引用	9546	2303
h 指数	48	22
i10 指数	198	63

500

250

125

375

19891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202428 53 47 53 65 84 93 87 140 126 115 113 98 123 180 168 240 262 301 306 423 406 386 461 457 438 483 451 378 422 395 432 392 337 375 365

开放获取的出版物数量

查看全部

80 篇文章

9 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, Greece在 uoi.gr 的电子邮件经过验证
Stephen KobourovProfessor of Computer Science, Technical University Munich在 tum.de 的电子邮件经过验证
Antonios SymvonisNational Technical U. of Athens在 math.ntua.gr 的电子邮件经过验证
Patrizio AngeliniJohn Cabot University在 dia.uniroma3.it 的电子邮件经过验证
Dorothea WagnerProfessor of Computer Science, Karlsruhe Institute of Technology (KIT)在 kit.edu 的电子邮件经过验证
Walter DidimoProfessor, University of Perugia在 unipg.it 的电子邮件经过验证
Prof. Dr. Hans-Peter LenhofCenter for Bioinformatics, Saarland Informatics Campus, Saarland University在 bioinf.uni-sb.de 的电子邮件经过验证
Giuseppe LiottaProfessor of Computer Science, University of Perugia在 unipg.it 的电子邮件经过验证
Muhammad Jawaherul AlamPh.D., Computer Science, University of Arizona在 cs.arizona.edu 的电子邮件经过验证
Sergey PupyrevApplied Research在 uran.ru 的电子邮件经过验证
Fabrizio FratiFull Professor, Roma Tre University在 dia.uniroma3.it 的电子邮件经过验证
Markus EiglspergerProfessor of Computer Science, University of Applied Science Konstanz在 htwg-konstanz.de 的电子邮件经过验证
Torsten UeckerdtKarlsruhe Institute of Technology在 kit.edu 的电子邮件经过验证
Therese BiedlUniversity of Waterloo在 cs.uwaterloo.ca 的电子邮件经过验证
Oliver KohlbacherProfessor for Applied Bioinformatics, University of Tübingen在 uni-tuebingen.de 的电子邮件经过验证
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of Würzburg在 uni-wuerzburg.de 的电子邮件经过验证
Martin SiebenhalleryWorks GmbH在 siebenhaller.de 的电子邮件经过验证
Christina BackesSaarland University在 mx.uni-saarland.de 的电子邮件经过验证
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics Campus在 mpi-inf.mpg.de 的电子邮件经过验证
Fabrizio MontecchianiAssociate Professor, University of Perugia在 unipg.it 的电子邮件经过验证

关注

Michael Kaufmann

Professor of Computer Science, Tübingen University

在 uni-tuebingen.de 的电子邮件经过验证

Geometric algorithms Graph drawing Combinatorial algorithms


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Drawing graphs: methods and models M Kaufmann, D Wagner Springer, 2003	835	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	188	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	170	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	153	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	152	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	135	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	128	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	117	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	107	1990
Channel routing of multiterminal nets S Gao, M Kaufmann Journal of the ACM (JACM) 41 (4), 791-818, 1994	105*	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	96	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	91	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

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

关注

引用次数

合著作者