Follow
Michael Kaufmann
Michael Kaufmann
Professor of Computer Science, Tübingen University
Verified email at informatik.uni-tuebingen.de
Title
Cited by
Cited by
Year
Drawing graphs: methods and models
M Kaufmann, D Wagner
Springer, 2003
8182003
DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment
AR Subramanian, M Kaufmann, B Morgenstern
Algorithms for Molecular Biology 3 (1), 1-11, 2008
3042008
DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment
AR Subramanian, J Weyer-Menkhoff, M Kaufmann, B Morgenstern
BMC bioinformatics 6 (1), 1-13, 2005
2342005
Drawing high degree graphs with low bend numbers
U Fößmeier, M Kaufmann
International Symposium on Graph Drawing, 254-266, 1995
1931995
yFiles — Visualization and Automatic Layout of Graphs
R Wiese, M Eiglsperger, M Kaufmann
Graph Drawing Software, 173-191, 2004
1842004
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
1662002
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
1642016
Boundary labeling: Models and efficient algorithms for rectangular maps
MA Bekos, M Kaufmann, A Symvonis, A Wolff
Computational Geometry 36 (3), 215-236, 2007
1482007
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
1441993
A systematic approach to the one-mode projection of bipartite graphs
KA Zweig, M Kaufmann
Social Network Analysis and Mining 1, 187-218, 2011
1302011
A new approach for boundary recognition in geometric sensor networks
SP Fekete, M Kaufmann, A Kröller, K Lehmann
arXiv preprint cs/0508006, 2005
1272005
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
1152004
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
1121991
Channel routing of multiterminal nets
S Gao, M Kaufmann
Journal of the ACM (JACM) 41 (4), 791-818, 1994
105*1994
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
1051990
Area-efficient static and incremental graph drawings
TC Biedl, M Kaufmann
European Symposium on Algorithms, 37-52, 1997
1001997
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
992008
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
882012
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
852012
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
842003
The system can't perform the operation now. Try again later.
Articles 1–20