Michael Kaufmann
Michael Kaufmann
Professor of Computer Science, Tübingen University
Bestätigte E-Mail-Adresse bei informatik.uni-tuebingen.de
TitelZitiert vonJahr
Drawing graphs: methods and models
M Kaufmann, D Wagner
Springer, 2003
678*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), 6, 2008
2372008
DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment
AR Subramanian, J Weyer-Menkhoff, M Kaufmann, B Morgenstern
BMC bioinformatics 6 (1), 66, 2005
1932005
Drawing high degree graphs with low bend numbers
U Fößmeier, M Kaufmann
International Symposium on Graph Drawing, 254-266, 1995
1691995
Embedding vertices at points: Few bends suffice for planar graphs
MKR Wiese
1462002
Tungsten as first wall material in fusion devices
M Kaufmann, R Neu
Fusion Engineering and Design 82 (5-14), 521-527, 2007
1302007
yFiles — Visualization and Automatic Layout of Graphs
R Wiese, M Eiglsperger, M Kaufmann
Graph Drawing Software, 173-191, 2004
1232004
A new approach for boundary recognition in geometric sensor networks
SP Fekete, M Kaufmann, A Kröller, K Lehmann
arXiv preprint cs/0508006, 2005
1152005
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
1151993
Boundary labeling: Models and efficient algorithms for rectangular maps
MA Bekos, M Kaufmann, A Symvonis, A Wolff
Computational Geometry 36 (3), 215-236, 2007
1002007
Channel routing of multiterminal nets
S Gao, M Kaufmann
Journal of the ACM (JACM) 41 (4), 791-818, 1994
99*1994
The art gallery theorem for polygons with holes
F Hoffmann, M Kaufmann, K Kriegel
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium …, 1991
981991
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
Algorithmica 8 (1-6), 391-406, 1992
961992
Area-efficient static and incremental graph drawings
TC Biedl, M Kaufmann
European Symposium on Algorithms, 37-52, 1997
951997
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), 552, 2008
932008
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
902004
Derandomizing algorithms for routing and sorting on meshes
M Kaufmann, JF Sibeyn, T Suel
SODA 94, 669-679, 1994
771994
A systematic approach to the one-mode projection of bipartite graphs
KA Zweig, M Kaufmann
Social Network Analysis and Mining 1 (3), 187-218, 2011
732011
Experimental studies of toroidal momentum transport in ASDEX Upgrade
D Nishijima, A Kallenbach, S Günter, M Kaufmann, K Lackner, CF Maggi, ...
Plasma physics and controlled fusion 47 (1), 89, 2004
732004
2-visibility drawings of planar graphs
U Fößmeier, G Kant, M Kaufmann
International Symposium on Graph Drawing, 155-168, 1996
671996
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20