On the cytotoxicity of HCR-NTPase in the neuroblastoma cell line SH-SY5Y (2009)
Pasdziernik, Markus, Kaltschmidt, Barbara, Kaltschmidt, Christian, Klinger, Claudia, Kaufmann, Michael
Abstract Background The human cancer-related nucleoside triphosphatase (HCR-NTPase) is overexpressed in several tumour tissues including neuroblastoma. HCR-NTPase is an enzyme exhibiting a slow in...
Subdivision Drawings of Hypergraphs ⋆ (2009)
Michael Kaufmann, Marc Van Kreveld, Bettina Speckmann
Abstract. We introduce the concept of subdivision drawings of hypergraphs. In a subdivision drawing each vertex corresponds uniquely to a face of a planar subdivision and, for each hyperedge, the...
On the Free Energy That Drove Primordial Anabolism (2009)
A key problem in understanding the origin of life is to explain the mechanism(s) that led to the spontaneous assembly of molecular building blocks that ultimately resulted in the appearance of...
Keller, Andreas, Backes, Christina, Gerasch, Andreas, Kaufmann, Michael, Kohlbacher, Oliver, Meese, Eckart, ...
Motivation: Deregulated signaling cascades are known to play a crucial role in many pathogenic processes, among them are tumor initiation and progression. In the recent past, modern experimental...
Constrained Simultaneous and (2008)
Studi Di, Roma Tre, Near-simultaneous Embeddings, Fabrizio Frati, Michael Kaufmann, ...
The research for this paper was done when the first author was visiting the Tübingen university. A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective...
Keller, Andreas, Backes, Christina, Al-Awadhi, Maher, Gerasch, Andreas, Küntzer, Jan, Kohlbacher, Oliver, ...
Abstract Background High-throughput methods that allow for measuring the expression of thousands of genes or proteins simultaneously have opened new avenues for studying biochemical processes. While...
Extension of the COG and arCOG databases by amino acid and nucleotide sequences (2008)
Meereis, Florian, Kaufmann, Michael
Abstract Background The current versions of the COG and arCOG databases, both excellent frameworks for studies in comparative and functional genomics, do not contain the nucleotide sequences...
Line Crossing Minimization on Metro Maps (2008)
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is minimized. This...
DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment (2008)
Subramanian, Amarendran R, Kaufmann, Michael, Morgenstern, Burkhard
Abstract Background DIALIGN-T is a reimplementation of the multiple-alignment program DIALIGN. Due to several algorithmic improvements, it produces significantly better alignments on locally and...
Multi-stack Boundary Labeling Problems ⋆ (2008)
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
Abstract. The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a rectangle R...
Ho Nguyen Cat, Lanvu Nhu, Viet Le Xuan, A Convergence, Sabin Tabirca, Tatiana Tabirca, ...
Classification
On Multi-Stack Boundary Labeling Problems ∗ (2008)
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
Abstract: Boundary labeling is a relatively new labeling method. It targets the areas of technical drawings and medical maps, where it is often common to explain certain parts of the drawing with...
Nonnumerical Algorithms and Problems—Computations (2008)
Katharina A. Lehmann, Michael Kaufmann
While the evolution of biological networks can be modeled sensefully as a series of mutation and selection, evolution of other networks such as the social network in a city or the network of streets...
Line Crossing Minimization on Metro Maps ⋆ (2008)
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
Abstract. We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G =(V,E), so that the total number of crossings among pairs of paths is minimized....
Disaggregation and reutilization of Sharable Content Objects (2008)
Álvaro Reis Figueira, Michael Kaufmann
Abstract. The need to produce high-quality digital educational contents for web-based instruction raises the problem of trying to meet individual students’ needs and the extreme cost of that...
BN++- A Biological Information System (2008)
Jan Küntzer, Torsten Blum, Andreas Gerasch, Christina Backes, Michael Kaufmann, Oliver Kohlbacher, ...
Recent years have seen an explosive growth in the amount of biochemical data available. Numerous databases have been established and are being used as an essential resource by biologists around the...
An Efficient Implementation of Sugiyama’s Algorithm for Layered Graph Drawing (2008)
Markus Eiglsperger, Zühlke Engineering Ag, Martin Siebenhaller, Michael Kaufmann
Sugiyama’s algorithm for layered graph drawing is very popular and commonly used in practical software. The extensive use of dummy vertices to break long edges between non-adjacent layers often...
Federal Republic of Germany (2008)
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Schirra, Christian Uhrig, ...
Abstract: We study rigid motions of a rectangle amidst polygonal obstacles. The best known algorithms for this problem have running time f~(n 2) where n is the number of obstacle corners. We...
Ulrike Von Luxburg, Stefanie Jegelka, Sébastien Bubeck, Michael Kaufmann
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure. However, in the...
Multi-Stack Boundary Labeling Problems ⋆ (2008)
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
Abstract. The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a rectangle R...
Constrained Simultaneous and Near-Simultaneous Embeddings (2008)
Fabrizio Frati, Michael Kaufmann, Stephen Kobourov
Abstract. A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ: V1 → V2 is a pair of planar straightline drawings Γ1 of...
ELECTRONIC BRAINSTORMING WITH GRAPHICAL STRUCTURES OF IDEAS ABSTRACT (2008)
Thomas Krätschmer, Michael Kaufmann
Group brainstorming is a very popular technique for the creation of ideas, although the state of the art in psychological research backs from this kind of brainstorming. Electronic brainstorming...
Ulrike Von Luxburg, Stefanie Jegelka, Sébastien Bubeck, Michael Kaufmann
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure. However, in the...
Polygon Labelling of Minimum Leader Length (2008)
Michael Bekos Michael, Michael Kaufmann, Katerina Potika, Antonios Symvonis
We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectangle (that encloses...
Polynomial Area Bounds for MST embeddings of trees (2008)
In their seminal paper on geometric minimum spanning trees, Monma and Suri [6] gave a method to embed any tree of maximal degree 5 as a minimum spanning tree in the Euclidean plane. They derived area...
Constrained Simultaneous and Near-Simultaneous Embeddings (2008)
Frati, Fabrizio, Kaufmann, Michael, Kobourov, Stephen G.
A geometric simultaneous embedding of two graphs $G_1=(V_1,E_1)$ and $G_2=(V_2,E_2)$ with a bijective mapping of their vertex sets $gamma : V_1 rightarrow V_2$ is a pair of planar straight-line...
Line Crossing Minimization on Metro Maps (2008)
Bekos, Michael A., Kaufmann, Michael, Potika, Katerina, Symvonis, Antonios
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph $G=(V,E)$, so that the total number of crossings among pairs of paths is minimized. This...
Consistent Minimization of Clustering Objective Functions (2008)
V. Luxburg, Ulrike, Bubeck, Sebastien, Jegelka, Stefanie, Kaufmann, Michael
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure. However, in the...
Subramanian, Amarendran R., Kaufmann, Michael, Morgenstern, Burkhard
Background: DIALIGN-T is a reimplementation of the multiple-alignment program DIALIGN. Due to several algorithmic improvements, it produces significantly better alignments on locally and globally...
Polynomial Area Bounds for MST embeddings of trees (2008)
In their seminal paper on geometric minimum spanning trees, Monma and Suri [6] gave a method to embed any tree of maximal degree 5 as a minimum spanning tree in the Euclidean plane. They derived area...
Constrained Simultaneous and Near-Simultaneous Embeddings (2008)
Frati, Fabrizio, Kaufmann, Michael, Kobourov, Stephen G.
A geometric simultaneous embedding of two graphs $G_1=(V_1,E_1)$ and $G_2=(V_2,E_2)$ with a bijective mapping of their vertex sets $gamma : V_1 rightarrow V_2$ is a pair of planar straight-line...
Line Crossing Minimization on Metro Maps (2008)
Bekos, Michael A., Kaufmann, Michael, Potika, Katerina, Symvonis, Antonios
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph $G=(V,E)$, so that the total number of crossings among pairs of paths is minimized. This...
08191 Working Group Report -- Visualization of Trajectories (2008)
Borgatti, Stephen, Brandes, Ulrik, Kaufmann, Michael, Kobourov, Stephen, Lubiw, Anna, Wagner, Dorothea
We considered the following problem: Given a set of vertices V and a set of paths P, where each path is a sequence of vertices, represent these paths somehow. We explored representations in different...
Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
In this paper we study the map labeling problem where the sites to be labeled are restricted to a line L. Previous models studied in the map labeling literature fail to produce label placements (i.e....
Bmc Bioinformatics, Andreas Keller, Christina Backes, Maher Al-awadhi, Andreas Gerasch, Jan Küntzer, ...
Software GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments
Florian Meereis, Michael Kaufmann
nucleotide sequences
Routing on Meshes With Applications to Worm-Hole Routing (2007)
Jop F. Sibeyn, Michael Kaufmann
In 1-k routing each of the n 2 processing units of an n \Theta n mesh connected computer initially holds 1 packet which must be routed such that any processor is the destination of at most k packets....
Visualization of Parallel Execution Graphs (2007)
Björn Steckelbach, Till Bubeck, Ulrich Fößmeier, Michael Kaufmann, Marcus Ritt, Wolfgang Rosenstiel
Measuring and evaluating the runtime of parallel programs is a difficult task. In this paper we present tools for performance evaluation and visualization in the distributed thread system (DTS), a...
Deterministic Permutation Routing on Meshes (2007)
Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an n × n array, one of them runs in the optimal 2 n - 2 steps. It has maximum queue length...
Deterministic 1-k Routing on Meshes - With Applications to Worm-Hole Routing (2007)
Jop F. Sibeyn, Michael Kaufmann
In 1-k routing each of the n 2 processing units of an n \Theta n mesh connected computer initially holds 1 packet which must be routed such that any processor is the destination of at most k packets....
Routing on Meshes with Buses (2007)
Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn
We consider the problem of routing packets on an n \Theta \Delta \Delta \Delta \Theta n MIMD mesh-connected array of processors augmented with row and column buses. We give lower bounds and...
Fast Routing On The Reconfigurable Mesh (2007)
Michael Kaufmann, Heiko Schröder, Jop F. Sibeyn
We consider permutation routing problems on mesh connected processor arrays under a very weak model of reconfiguration: we allow only uni-directional row or column buses, point-to-point...
Sketch-Driven Orthogonal Graph Drawing* (2007)
Ulrik Br, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner
Abstract. We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kandinsky model...
Michael Kaufmann, Michael Kaufmann, Jop F. Sibeyn, Jop F. Sibeyn
Randomized multi-packet routing on meshes
BNDB – The Biochemical Network Database (2007)
Küntzer, Jan, Backes, Christina, Blum, Torsten, Gerasch, Andreas, Kaufmann, Michael, Kohlbacher, Oliver, ...
Abstract Background Technological advances in high-throughput techniques and efficient data acquisition methods have resulted in a massive amount of life science data. The data is stored in numerous...
Kaufmann, Michael, Bretthauer, Georg
Zum Vol. I von: Computer science meets automation: 52. IWK, Internationales Wissenschaftliches Kolloquium ; proceedings ; 10 - 13 September 2007 Zum Vol. II von: Computer science meets automation:...
Consistent Minimization of Clustering Objective Functions (2007)
Von Luxburg, Ulrike, Bubeck, Sébastien, Jegelka, Stefanie, Kaufmann, Michael
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure. However, in the...
Consistent Minimization of Clustering Objective Functions (2007)
Von Luxburg, Ulrike, Bubeck, Sébastien, Jegelka, Stefanie, Kaufmann, Michael
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure. However, in the...
Colored Simultaneous Geometric Embeddings (2007)
Brandes, Ulrik, Erten, Cesim, Fowler, J. Joseph, Frati, Fabrizio, Geyer, Markus, Gutwenger, Carsten, ...
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of...
A.: Line crossing minimization on metro maps (2007)
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
Abstract. We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V,E), so that the total number of crossings among pairs of paths is minimized....
BMC Bioinformatics Database BNDB – The Biochemical Network Database (2007)
Jan Küntzer, Christina Backes, Torsten Blum, Andreas Gerasch, Michael Kaufmann, Oliver Kohlbacher, ...
Background: Technological advances in high-throughput techniques and efficient data acquisition methods have resulted in a massive amount of life science data. The data is stored in numerous...
Lehmann, Katharina A, Kaufmann, Michael, Steigele, Stephan, Nieselt, Kay
Abstract Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the generation...
Two trees which are self-intersecting when drawn simultaneously (2006)
Kaufmann, Michael, Vrto, Imrich, Geyer, Markus
An actual topic in the graph drawing is the question how to draw two edge sets on the same vertex set, the so-called simultaneous drawing of graphs. The goal is to simultaneously find a nice drawing...
Mixed Upward Planarization - Fast and Robust (2006)
Siebenhaller, Martin, Kaufmann, Michael
In a mixed upward drawing of a graph G=(V,E) all directed edges E_D \subseteq E are represented by monotonically increasing curves. Mixed upward drawings arise in applications like UML diagrams where...
Two trees which are self-intersecting when drawn simultaneously (2006)
Kaufmann, Michael, Vrto, Imrich, Geyer, Markus
An actual topic in the graph drawing is the question how to draw two edge sets on the same vertex set, the so-called simultaneous drawing of graphs. The goal is to simultaneously find a nice drawing...
Mixed Upward Planarization - Fast and Robust (2006)
Siebenhaller, Martin, Kaufmann, Michael
In a mixed upward drawing of a graph G=(V,E) all directed edges E_D \subseteq E are represented by monotonically increasing curves. Mixed upward drawings arise in applications like UML diagrams where...
Two trees which are self-intersecting when drawn simultaneously (2006)
Kaufmann, Michael, Vrto, Imrich, Geyer, Markus
An actual topic in the graph drawing is the question how to draw two edge sets on the same vertex set, the so-called simultaneous drawing of graphs. The goal is to simultaneously find a nice drawing...
Mixed Upward Planarization - Fast and Robust (2006)
Siebenhaller, Martin, Kaufmann, Michael
In a mixed upward drawing of a graph G=(V,E) all directed edges E_D \subseteq E are represented by monotonically increasing curves. Mixed upward drawings arise in applications like UML diagrams where...
BN++ - A Biological Information System (2006)
Küntzer, Jan, Blum, Torsten, Gerasch, Andreas, Backes, Christina, Hildebrandt, Andreas, Kaufmann, Michael, ...
Recent years have seen an explosive growth in the amount of biochemical data available. Numerous databases have been established and are being used as an essential resource by biologists around the...
A New Approach for Boundary Recognition in Geometric Sensor Networks (2005)
Fekete, Sandor P., Kaufmann, Michael, Kroeller, Alexander, Lehmann, Katharina
We describe a new approach for dealing with the following central problem in the self-organization of a geometric sensor network: Given a polygonal region R, and a large, dense set of sensor nodes...
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment (2005)
Subramanian, Amarendran R, Weyer-Menkhoff, Jan, Kaufmann, Michael, Morgenstern, Burkhard
Abstract Background We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous version 2.2 of...
Roßbach, Michael, Daumke, Oliver, Klinger, Claudia, Wittinghofer, Alfred, Kaufmann, Michael
Abstract Background aaTHEP1, the gene product of aq_1292 from Aquifex aeolicus , shows sequence homology to proteins from most thermophiles, hyperthermophiles, and higher organisms such as man,...
Subramanian, Amarendran R., Weyer-Menkhoff, Jan, Kaufmann, Michael, Morgenstern, Burkhard
Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous version 2.2 of DIALIGN....
Comparing trees via crossing minimization (2005)
Henning Fernau, Michael Kaufmann, Mathias Poths
Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges between the leaves...
aeolicus: a variation of the RecA fold (2005)
Michael Roßbach, Oliver Daumke, Claudia Klinger, Alfred Wittinghofer, Michael Kaufmann
Crystal structure of THEP1 from the hyperthermophile Aquifex
Meereis, Florian, Kaufmann, Michael
Abstract Background The rapidly increasing number of completely sequenced genomes led to the establishment of the COG-database which, based on sequence homologies, assigns similar proteins from...
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors (2004)
Schmollinger, Martin, Nieselt, Kay, Kaufmann, Michael, Morgenstern, Burkhard
Abstract Background Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results Herein, a parallel version of the multi-alignment program DIALIGN is...
Decentralized algorithms for evaluating centrality in complex networks (2004)
Lehmann, Katharina A., Kaufmann, Michael
Im vorliegenden Bericht beschreiben wir eine neue Familie von dezentralen Algorithmen, mit denen autonome Knoten in einem komplexen Netzwerk ihre Zentralität berechnen können. Insbesondere gehen...
Fixed Parameter Algorithms for one-sided crossing minimization Revisited (2004)
Dujmovic, Vida, Fernau, Henning, Kaufmann, Michael
We exhibit a small problem kernel for the problem one-sided crossing minimization which plays an important role in graph drawing algorithms based on the Sugiyama layering approach. Moreover, we...
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps (2004)
Bekos, Michael A., Kaufmann, Michael, Symvonis, Antonios, Wolff, Alexander
In this paper, we present boundary labeling, a new approach for labeling point sets with large labels. We first place disjoint labels around an axis-parallel rectangle that contains the points. Then...
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing (2004)
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael
Sugiyama's algorithmic framework for layered graph drawing is commonly used in practical software. The extensive use of dummy vertices to break long edges between non-adjacent layers often leads to...
Fixed Parameter Algorithms for one-sided crossing minimization Revisited (2004)
Dujmovic, Vida, Fernau, Henning, Kaufmann, Michael
We exhibit a small problem kernel for the problem one-sided crossing minimization which plays an important role in graph drawing algorithms based on the Sugiyama layering approach. Moreover, we...
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps (2004)
Bekos, Michael A., Kaufmann, Michael, Symvonis, Antonios, Wolff, Alexander
In this paper, we present boundary labeling, a new approach for labeling point sets with large labels. We first place disjoint labels around an axis-parallel rectangle that contains the points. Then...
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing (2004)
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael
Sugiyama's algorithmic framework for layered graph drawing is commonly used in practical software. The extensive use of dummy vertices to break long edges between non-adjacent layers often leads to...
Boundary labeling: models and efficient algorithms for rectangular maps (2004)
Bekos, Michael A., Kaufmann, Michael, Symvonis, Antonios, Wolff, Alexander
In this paper, we present boundary labelling, a new approachfor labelling point sets with large labels. We first place disjoint labels around an axis-parallel rectangle that contains the point sites....
Boundary labeling: models and efficient algorithms for rectangular maps. (2004)
Bekos, Michael A., Kaufmann, Michael, Symvonis, Antonios, Wolff, Alexander
Fixed Parameter Algorithms for one-sided crossing minimization Revisited (2004)
Dujmovic, Vida, Fernau, Henning, Kaufmann, Michael
We exhibit a small problem kernel for the problem one-sided crossing minimization which plays an important role in graph drawing algorithms based on the Sugiyama layering approach. Moreover, we...
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps (2004)
Bekos, Michael A., Kaufmann, Michael, Symvonis, Antonios, Wolff, Alexander
In this paper, we present boundary labeling, a new approach for labeling point sets with large labels. We first place disjoint labels around an axis-parallel rectangle that contains the points. Then...
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing (2004)
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael
Sugiyama's algorithmic framework for layered graph drawing is commonly used in practical software. The extensive use of dummy vertices to break long edges between non-adjacent layers often leads to...
Fixed parameter algorithms for one-sided crossing minimization revisited (2004)
Vida Dujmović, Henning Fernau, Michael Kaufmann
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering approach. Moreover,...
Bmc Bioinformatics, Martin Schmollinger, Kay Nieselt, Michael Kaufmann, Burkhard Morgenstern, Michael Kaufmann, ...
Software DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Fixed parameter algorithms for one-sided crossing minimization revisited (2004)
Vida Dujmović, Henning Fernau, Michael Kaufmann
Abstract. We exhibit a small problem kernel for the problem onesided crossing minimization which plays an important role in graph drawing algorithms based on the Sugiyama layering approach. Moreover,...
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps (2004)
Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Er Wolff
Abstract. In this paper, we present boundary labeling, a new approach for labeling point sets with large labels. We first place disjoint labels around an axis-parallel rectangle that contains the...
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps (2004)
Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Er Wolff
Abstract. In this paper, we present boundary labeling, a new approach for labeling point sets with large labels. We first place disjoint labels around an axis-parallel rectangle that contains the...
Bmc Bioinformatics, Florian Meereis, Michael Kaufmann
Software PCOGR: Phylogenetic COG ranking as an online tool to judge the specificity of COGs with respect to freely definable groups of organisms
Thermophile-specific proteins: the gene product of aq_1292from Aquifex aeolicusis an NTPase (2003)
Klinger, Claudia, Roßbach, Michael, Howe, Rebecca, Kaufmann, Michael
Abstract Background To identify thermophile-specific proteins, we performed phylogenetic patterns searches of 66 completely sequenced microbial genomes. This analysis revealed a cluster of...
Zugl.: Bremen, Universiẗat, Diss., 2000.
1 Summary What Can Be Computed Locally? (2003)
The paper [1] deals with locality on several levels: It introduces a model for distributed computations and the notion of locally checkable labelings (LCLs). It proves properties about algorithms for...
Sketch-Driven Orthogonal Graph Drawing (2002)
Brandes, Ulrik, Eiglsperger, Markus, Kaufmann, Michael, Wagner, Dorothea
We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kadinsky model it also...
Maintaining the Mental Map for Circular Drawings (2002)
Kaufmann, Michael, Wiese, Roland
In this paper we present new ideas to extend the framework for circular drawing of networks by Six and Tollis [15] by some new concepts which makes the framework suitable for user interaction. The...
yFiles: Visualization and Automatic Layout of Graphs (2002)
Wiese, Roland, Eiglsperger, Markus, Kaufmann, Michael
yFiles is a Java-based library for the visualization and automatic layout of graph structures. Included features are data structures, graph algorithms, diverse layout and labeling algorithms and a...
Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size (2002)
Eiglsperger, Markus, Kaufmann, Michael
In this paper, we present a new compaction algorithm which computes orthogonal drawings where the size of the vertices is given as input. This is a critical constraint for many practical applications...
Sketch-Driven Orthogonal Graph Drawing (2002)
Brandes, Ulrik, Eiglsperger, Markus, Kaufmann, Michael, Wagner, Dorothea
We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kadinsky model it also...
Maintaining the Mental Map for Circular Drawings (2002)
Kaufmann, Michael, Wiese, Roland
In this paper we present new ideas to extend the framework for circular drawing of networks by Six and Tollis [15] by some new concepts which makes the framework suitable for user interaction. The...
yFiles: Visualization and Automatic Layout of Graphs (2002)
Wiese, Roland, Eiglsperger, Markus, Kaufmann, Michael
yFiles is a Java-based library for the visualization and automatic layout of graph structures. Included features are data structures, graph algorithms, diverse layout and labeling algorithms and a...
Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size (2002)
Eiglsperger, Markus, Kaufmann, Michael
In this paper, we present a new compaction algorithm which computes orthogonal drawings where the size of the vertices is given as input. This is a critical constraint for many practical applications...
Sketch-Driven Orthogonal Graph Drawing (2002)
Brandes, Ulrik, Eiglsperger, Markus, Kaufmann, Michael, Wagner, Dorothea
We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kadinsky model it also...
Maintaining the Mental Map for Circular Drawings (2002)
Kaufmann, Michael, Wiese, Roland
In this paper we present new ideas to extend the framework for circular drawing of networks by Six and Tollis [15] by some new concepts which makes the framework suitable for user interaction. The...
yFiles: Visualization and Automatic Layout of Graphs (2002)
Wiese, Roland, Eiglsperger, Markus, Kaufmann, Michael
yFiles is a Java-based library for the visualization and automatic layout of graph structures. Included features are data structures, graph algorithms, diverse layout and labeling algorithms and a...
Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size (2002)
Eiglsperger, Markus, Kaufmann, Michael
In this paper, we present a new compaction algorithm which computes orthogonal drawings where the size of the vertices is given as input. This is a critical constraint for many practical applications...
Sketch-Driven Orthogonal Graph Drawing (2002)
Brandes, Ulrik, Eiglsperger, Markus, Kaufmann, Michael, Wagner, Dorothea
We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kandinsky model it also...
An approach for mixed upward planarization (2002)
Markus Eiglsperger, Michael Kaufmann
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization...
Extracting common motifs under the levenshtein measure: Theory and experimentation (2002)
Ezekiel F. Adebiyi, Michael Kaufmann
Abstract. Using our techniques for extracting approximate non-tandem repeats[1] on well constructed maximal models, we derive an algorithm to find common motifs of length P that occur in N sequences...
Fast compaction for orthogonal drawings with vertices of prescribed size (2002)
Markus Eiglsperger, Michael Kaufmann
Abstract. In this paper, we present a new compaction algorithm which computes orthogonal drawings where the size of the vertices is given as input. This is a critical constraint for many practical...
An approach for mixed upward planarization (2002)
Markus Eiglsperger, Michael Kaufmann
Abstract. In this paper, we consider the problem of nding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the...
Embedding vertices at points: Few bends suffice for planar graphs (2002)
Michael Kaufmann, Roland Wiese
The existing literature gives ecient algorithms for mapping trees or less restrictively outerplanar graphs on a given set of points in a plane, so that the edges are drawn planar and as straight...
Embedding Vertices at Points: Few Bends suffice for Planar Graphs (2002)
Michael Kaufmann, Roland Wiese
The existing literature gives efficient algorithms for mapping trees or less restrictively outerplanar graphs on a given set of points in a plane, so that the edges are drawn planar and as straight...
Embedding vertices at points: Few bends suffice for planar graphs (2002)
Michael Kaufmann, Roland Wiese
The existing literature gives efficient algorithms for mapping trees or less restrictively outerplanar graphs on a given set of points in a plane, so that the edges are drawn planar and as straight...
Zugl.: Karlsruhe, Universiẗat, Diss., 2002.
Usage-based visualization of web localities (2001)
Boris Diebold, Michael Kaufmann
The World-Wide Web has evolved into an extremely huge but "messy " information space which is hard to overview. Sitemaps as alternative views of Web sites have been proposed to...
An efficient algorithm for finding short approximate non-tandem repeats (2001)
Adebiyi, Ezekiel F., Jiang, Tao, Kaufmann, Michael
We study the problem of approximate non-tandem repeat †extraction. Given a long subject string S of length N over a finite alphabet &Sgr; and a threshold D, we would like to find all short...
Orthogonal graph drawing with constraints (2000)
Markus Eiglsperger, Michael Kaufmann
One of the primary prerequisites of drawing a graph directly from practical application is that the user must be able to formulate constraints for the layout. We introduce a concept to incorporate...
American Literature - Volume 71, Number 4, December 1999
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs (1999)
Kaufmann, Michael, Wiese, Roland
The existing literature gives efficient algorithms for mapping trees or less restrictively outerplanar graphs on a given set of points in a plane, so that the edges are drawn planar and as straight...
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs (1999)
Kaufmann, Michael, Wiese, Roland
The existing literature gives efficient algorithms for mapping trees or less restrictively outerplanar graphs on a given set of points in a plane, so that the edges are drawn planar and as straight...
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs (1999)
Kaufmann, Michael, Wiese, Roland
The existing literature gives efficient algorithms for mapping trees or less restrictively outerplanar graphs on a given set of points in a plane, so that the edges are drawn planar and as straight...
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings (1998)
Fößmeier, Ulrich, Kaufmann, Michael
We report on some extensions of the Kandinsky model: A new and highly nontrivial technique to incorporate nonplanar drawings into the Kandinsky model in the same way as in the GIOTTO approach is...
On Improving Orthogonal Drawings: The 4M-Algorithm (1998)
Fößmeier, Ulrich, Heß, Carsten, Kaufmann, Michael
Orthogonal drawings of graphs are widely investigated in the literature and many algorithms have been presented to compute such drawings. Most of these algorithms lead to unpleasant drawings with...
Adding Constraints to an Algorithm for Orthogonal Graph Drawing (1998)
Wiese, Roland, Kaufmann, Michael
No Abstract
Visualization of Parallel Execution Graphs (1998)
Steckelbach, Björn, Bubeck, Till, Fößmeier, Ulrich, Kaufmann, Michael, Ritt, Marcus, Rosenstiel, Wolfgang
Measuring and evaluating the runtime of parallel programs is a difficult task. In this paper we present tools for performance evaluation and visualization in the distributed thread system (DTS), a...
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings (1998)
Fößmeier, Ulrich, Kaufmann, Michael
We report on some extensions of the Kandinsky model: A new and highly nontrivial technique to incorporate nonplanar drawings into the Kandinsky model in the same way as in the GIOTTO approach is...
On Improving Orthogonal Drawings: The 4M-Algorithm (1998)
Fößmeier, Ulrich, Heß, Carsten, Kaufmann, Michael
Orthogonal drawings of graphs are widely investigated in the literature and many algorithms have been presented to compute such drawings. Most of these algorithms lead to unpleasant drawings with...
Adding Constraints to an Algorithm for Orthogonal Graph Drawing (1998)
Wiese, Roland, Kaufmann, Michael
No Abstract
Visualization of Parallel Execution Graphs (1998)
Steckelbach, Björn, Bubeck, Till, Fößmeier, Ulrich, Kaufmann, Michael, Ritt, Marcus, Rosenstiel, Wolfgang
Measuring and evaluating the runtime of parallel programs is a difficult task. In this paper we present tools for performance evaluation and visualization in the distributed thread system (DTS), a...
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings (1998)
Fößmeier, Ulrich, Kaufmann, Michael
We report on some extensions of the Kandinsky model: A new and highly nontrivial technique to incorporate nonplanar drawings into the Kandinsky model in the same way as in the GIOTTO approach is...
On Improving Orthogonal Drawings: The 4M-Algorithm (1998)
Fößmeier, Ulrich, Heß, Carsten, Kaufmann, Michael
Orthogonal drawings of graphs are widely investigated in the literature and many algorithms have been presented to compute such drawings. Most of these algorithms lead to unpleasant drawings with...
Adding Constraints to an Algorithm for Orthogonal Graph Drawing (1998)
Wiese, Roland, Kaufmann, Michael
No Abstract
Visualization of Parallel Execution Graphs (1998)
Steckelbach, Björn, Bubeck, Till, Fößmeier, Ulrich, Kaufmann, Michael, Ritt, Marcus, Rosenstiel, Wolfgang
Measuring and evaluating the runtime of parallel programs is a difficult task. In this paper we present tools for performance evaluation and visualization in the distributed thread system (DTS), a...
2-Visibility Drawings of Planar Graphs (1997)
Fößmeier, Ulrich, Kant, Goos, Kaufmann, Michael
In a 2-visibility drawing the vertices of a given graph are represented by rectangular boxes and the adjacency relations are expressed by horizontal and vertical lines drawn between the boxes. In...
2-Visibility Drawings of Planar Graphs (1997)
Fößmeier, Ulrich, Kant, Goos, Kaufmann, Michael
In a 2-visibility drawing the vertices of a given graph are represented by rectangular boxes and the adjacency relations are expressed by horizontal and vertical lines drawn between the boxes. In...
2-Visibility Drawings of Planar Graphs (1997)
Fößmeier, Ulrich, Kant, Goos, Kaufmann, Michael
In a 2-visibility drawing the vertices of a given graph are represented by rectangular boxes and the adjacency relations are expressed by horizontal and vertical lines drawn between the boxes. In...
On triangulating planar graphs under the four-connectivity constraint (1997)
T. Biedl, T. Biedl, G. Kant, G. Kant, M. Kaufmann, M. Kaufmann, ...
Triangulation of planar graphs under constraints is a fundamental problem in the representation of objects. Related keywords are graph augmentation from the field of graph algorithms and mesh...
BSP-like external-memory computation (1997)
Jop F. Sibeyn, Michael Kaufmann
In this paper we present a paradigm for solving external-memory problems, and illustrate it by algorithms for matrix multiplication, sorting, list ranking, transitive closure and FFT. Our paradigm is...
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings (1997)
Ulrich Fößmeier, Michael Kaufmann
We report on some extensions of the Kandinsky model: A new and highly nontrivial technique to incorporate nonplanar drawings into the Kandinsky model in the same way as in the GIOTTO approach is...
Area-Efficient Static and Incremental Graph Drawings (1997)
Therese C. Biedl, Michael Kaufmann
. In this paper, we present algorithms to produce orthogonal drawings of arbitrary graphs. As opposed to most known algorithms, we do not restrict ourselves to graphs with maximum degree 4. The best...
Matrix Transpose on Meshes: Theory and Practice (1997)
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
Matrix transpose is a fundamental communication operation which is not dealt with optimally by general purpose routing schemes. For two dimensional meshes, the first optimal routing schedule is...
Matrix Transpose on Meshes: Theory and Practice (1997)
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
We consider the problem of matrix transpose on mesh-connected processor networks. On the theoretical side, we present the first optimal algorithm for matrix transpose on twodimensional meshes. Then...
2-Visibility Drawings of Planar Graphs (1997)
Ulrich Fößmeier, Goos Kant, Michael Kaufmann
In a 2-visibility drawing the vertices of a given graph are represented by rectangular boxes and the adjacency relations are expressed by horizontal and vertical lines drawn between the boxes. In...
Randomized Multi-Packet Routing and Sorting on Meshes (1997)
Michael Kaufmann, Jop F. Sibeyn
We consider the problem of routing and sorting on d-dimensional n \Theta : : :\Theta n mesh connected computers. Each of the processing units initially holds k packets. We present randomized...
Nice Drawings for Planar Bipartite Graphs (1997)
Ulrich Fößmeier, Michael Kaufmann
Graph drawing algorithms usually attempt to display the characteristic properties of the input graphs. In this paper we consider the class of planar bipartite graphs and try to achieve planar...
2-Visibility Drawings of Planar Graphs (1997)
Ulrich Fößmeier, Goos Kant, Michael Kaufmann
this paper. The purpose of this paper is to introduce this model as a practical alternative to the models used before and to demonstrate the quality of the produced drawings. An idea is to first draw...
Matrix Transpose on Meshes: Theory and Practice (1997)
Matrix transpose is a fundamental communication operation which is not dealt with optimally by general purpose routing schemes. For two dimensional meshes, the first optimal routing schedule is...
Drawing High Degree Graphs with Low Bend Numbers (1996)
Fößmeier, Ulrich, Kaufmann, Michael
We consider the problem of drawing plane graphs with an arbitrarily high vertex degree orthogonally into the plane such that the number of bends on the edges should be minimized.It has been known how...
Drawing High Degree Graphs with Low Bend Numbers (1996)
Fößmeier, Ulrich, Kaufmann, Michael
We consider the problem of drawing plane graphs with an arbitrarily high vertex degree orthogonally into the plane such that the number of bends on the edges should be minimized.It has been known how...
Drawing High Degree Graphs with Low Bend Numbers (1996)
Fößmeier, Ulrich, Kaufmann, Michael
We consider the problem of drawing plane graphs with an arbitrarily high vertex degree orthogonally into the plane such that the number of bends on the edges should be minimized.It has been known how...
Solving Cheap Graph Problems on Meshes (1996)
Jop F. Sibeyn, Michael Kaufmann
Efficient mesh algorithms exist for `expensive' graph problems like transitive closure and computing all shortest paths, taking O(n) time on an n \Theta n mesh for a graph with n vertices. This...
Design and Implementation of the Extensible Graph Drawing System Dr.Graph (1996)
Harald Lauer, Michael Kaufmann, Arbeitsbereich Paralleles Rechnen
Lack of extensibility and flexibility is the main reason why grapheditors today seem to have only a very short lifespan compared to tools in other research areas. Some of the existing editors can be...
On Exact Solutions for the Rectilinear Steiner Tree Problem - Part I: Theoretical Results (1996)
Ulrich Fößmeier, Michael Kaufmann
The rectilinear Steiner Tree problem asks for a shortest tree connecting given points in the plane with rectilinear distance. The best theoretically analysed algorithms for this problem base on...
On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs (1995)
Fößmeier, Ulrich, Kaufmann, Michael
In last year's graph drawing workshop GD'93 we considered a restricted version of the problem of minimization of bends in orthogonal upward drawings. Inserting the severe restriction that each node...
On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs (1995)
Fößmeier, Ulrich, Kaufmann, Michael
In last year's graph drawing workshop GD'93 we considered a restricted version of the problem of minimization of bends in orthogonal upward drawings. Inserting the severe restriction that each node...
On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs (1995)
Fößmeier, Ulrich, Kaufmann, Michael
In last year's graph drawing workshop GD'93 we considered a restricted version of the problem of minimization of bends in orthogonal upward drawings. Inserting the severe restriction that each node...
Approaching the 5/4-Approximation for Rectilinear Steiner Trees (1995)
Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky
The rectilinear Steiner tree problem requires a shortest tree spanning a given vertex subset in the plane with rectilinear distance. It was proved that the output length of Zelikovsky's [25] and...
Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes (1995)
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
Sorting is an important subroutine in many parallel algorithms and has been studied extensively on meshes and related networks. If every processor of an n \Theta n mesh is the source and destination...
Drawing High Degree Graphs with Low Bend Numbers (1995)
Ulrich Fößmeier, Michael Kaufmann, Arbeitsbereich Paralleles Rechnen
We consider the problem of drawing plane graphs with an arbitrarily high vertex degree orthogonally into the plane such that the number of bends on the edges should be minimized. It has been known...
Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes (1995)
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
Sorting is an important subroutine in many parallel algorithms and has been studied extensively on meshes and related networks. If every processor of an n \Theta n mesh is the source and destination...
Derandomizing Algorithms for Routing and Sorting on Meshes (1994)
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deriving improved...
Towards Practical Permutation Routing on Meshes (1994)
Michael Kaufmann Uli, Michael Kaufmann, Uli Meyer, Jop F. Sibeyn
We consider the permutation routing problem on twodimensional n \Theta n meshes. To be practical, a routing algorithm is required to ensure very small queue sizes Q, and very low running time T , not...
Towards Practical Permutation Routing on Meshes (1994)
Michael Kaufmann, Uli Meyer, Jop F. Sibeyn
We consider the permutation routing problem on twodimensional n \Theta n meshes. To be practical, a routing algorithm is required to ensure very small queue sizes Q, and very low running time T , not...
Shorter Queues for Permutation Routing on Meshes (1994)
Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
. New deterministic algorithms for routing permutations on an n \Theta n MIMD mesh are presented. They are very efficient in terms of the size of auxiliary memory at each processor, measured as the...
Derandomizing Algorithms for Routing and Sorting on Meshes (1994)
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deriving improved...
Approaching the 5/4-Approximation for Rectilinear Steiner Trees (1994)
Piotr Berman, Ulrich Fößmeier, Rectilinear Steiner Trees, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky
The rectilinear Steiner tree problem requires to find a shortest tree connecting a given set of terminal points in the plane with rectilinear distance. We show that the performance ratios of...
Deterministic Permutation Routing on Meshes (1993)
Bogdan Chlebus, Michael Kaufmann, Jop F. Sibeyn
We present a new deterministic algorithm for routing permutations on a two-dimensional MIMD mesh. The algorithm runs in the optimal time 2n \Gamma 2 on an n \Theta n mesh, and the maximal number of...
Deterministic Permutation Routing on Meshes (1993)
Jop Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an n \Theta n array, one of them runs in the optimal 2 \Delta n \Gamma 2 steps. It has maximum queue...
Deterministic Permutation Routing on Meshes (1993)
Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn
We present new deterministic algorithms for routing permutations on a two-dimensional n\Thetan MIMD mesh. One algorithm runs in the optimal time 2 \Delta n \Gamma 2, while the maximal number of...
Randomized Routing on Meshes with Buses (1993)
Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman
We give algorithms and lower bounds for the problem of routing k-permutations on d-dimensional MIMD meshes with additional buses. A straightforward argument shows that for all d 1, 2=3 \Delta n steps...
Exploratorische Studien zur B12-Katalyse / (1992)
Diss. Naturwiss. Bern, 1991 (kein Austausch).
Deterministic Routing on Circular Arrays (1992)
Michael Kaufmann, Jop F. Sibeyn
We analyze the routing of k-permutations on circular processor arrays connected by bidirectional links. In contrast to linear processor arrays, it is hard to prove lower bounds for the routing time...
Matching the Bisection Bound for Routing and Sorting on the Mesh (extended abstract) (1992)
Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn
In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh connected processor array. In these three problems, each processor is assumed to...
Optimal Multi-Packet Routing on the Torus (1992)
Michael Kaufmann, Jop F. Sibeyn
We present new algorithms for k-k routing on mesh connected processor arrays with wrap-around connections. Using new techniques for the performance analysis we show that an original randomized four...
Alt, Helmut, Fleischer, Rudolf, Kaufmann, Michael, Mehlhorn, Kurt, Näher, Stefan, Schirra, Stefan, ...
Randomized Multi-Packet Routing on Meshes (1991)
Michael Kaufmann, Jop F. Sibeyn
We present algorithms for routing packets on a two-dimensional array of processors in the so-called k-k routing model. Each processor sends and receives exactly k packets. Using new techniques for...
Alt, Helmut, Fleischer, Rudolf, Kaufmann, Michael, Mehlhorn, Kurt, Näher, Stefan, Schirra, Stefan, ...
Erscheint in 2 Bd.
Göttingen, Univ., Diss., 1988 (Nicht f.d. Austausch).
On continuous homotopic one layer routing (1988)
Shaodi Gao, Mark Jerrum, Michael Kaufmann
Abstract: We give an O(n s-log n) time and O(n s) space algorithm for the continuous ho-motopic one layer routing problem. The main contribution is an extension of the sweep pa-radigm to a universal...
On Continuous Homotopic One Layer Routing (Extended Abstract) (1988)
Gao, Shaodi, Kaufmann, Michael, Mehlhorn, Kurt, Rülling, Wolfgang, Storb, Christoph, Jerrum, Mark, ...
On Continuous Homotopic One Layer Routing (1988)
Gao, Shaodi, Jerrum, Mark, Kaufmann, Michael, Mehlhorn, Kurt, Rülling, Wolfgang
Über Lokales Verdrahten von Zwei-Punkt-Netzen. (1987)
Saarbrücken, Univ., Diss., 1987 (Nicht f.d. Austausch).
On Local Routing of Two-Terminal Nets (1987)
Kaufmann, Michael, Mehlhorn, Kurt, Brandenburg, Franz J., Vidal-Naquet, Guy, Wirsing, Martin
Die Strahlungsverluste eines z-Pinches hoher Dichte : (Ausz.). (1967)
Aus: Zeitschrift f. Physik. Bd 225. 1969. Vollständige maschinenschriftlich vervielfältigte Ausgabe angezeigt U 67.12179
Die Strahlungsverluste eines Z-Pinches hoher Dichte. (1967)
München, T. H., F. f. allg. Wiss., Diss. v. 14. Dez. 1967 (Nicht f. d. Aust.).
Ueber die anaesthesirende Wirkung des Stickstoffoxydulgases / (1874)
Thesis (doctoral)--Vereinigte Friedrichs-Universität Halle-Wittenberg, 1874.
Thermophile-specific proteins: the gene product of aq_1292 from Aquifex aeolicus is an NTPase
Klinger, Claudia, Roβbach, Michael, Howe, Rebecca, Kaufmann, Michael
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Schmollinger, Martin, Nieselt, Kay, Kaufmann, Michael, Morgenstern, Burkhard
Crystal structure of THEP1 from the hyperthermophile Aquifex aeolicus: a variation of the RecA fold
Roßbach, Michael, Daumke, Oliver, Klinger, Claudia, Wittinghofer, Alfred, Kaufmann, Michael
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Subramanian, Amarendran R, Weyer-Menkhoff, Jan, Kaufmann, Michael, Morgenstern, Burkhard
Lehmann, Katharina A, Kaufmann, Michael, Steigele, Stephan, Nieselt, Kay
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the generation of a...
Thermophile-specific proteins: the gene product of aq_1292 from Aquifex aeolicus is an NTPase
Klinger, Claudia, Roßbach, Michael, Howe, Rebecca, Kaufmann, Michael
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Schmollinger, Martin, Nieselt, Kay, Kaufmann, Michael, Morgenstern, Burkhard
Crystal structure of THEP1 from the hyperthermophile Aquifex aeolicus: a variation of the RecA fold
Roßbach, Michael, Daumke, Oliver, Klinger, Claudia, Wittinghofer, Alfred, Kaufmann, Michael
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Subramanian, Amarendran R, Weyer-Menkhoff, Jan, Kaufmann, Michael, Morgenstern, Burkhard
Lehmann, Katharina A, Kaufmann, Michael, Steigele, Stephan, Nieselt, Kay
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the generation of a...
BNDB – The Biochemical Network Database
Küntzer, Jan, Backes, Christina, Blum, Torsten, Gerasch, Andreas, Kaufmann, Michael, Kohlbacher, Oliver, ...
Specific tumor suppressor function for E2F2 in Myc-induced T cell lymphomagenesis
Opavsky, Rene, Tsai, Shih-Yin, Guimond, Martin, Arora, Anjulie, Opavska, Jana, Becknell, Brian, ...
Deregulation of the Myc pathway and deregulation of the Rb pathway are two of the most common abnormalities in human malignancies. Recent in vitro experiments suggest a complex cross-regulatory...
DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment
Subramanian, Amarendran R, Kaufmann, Michael, Morgenstern, Burkhard
GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments
Keller, Andreas, Backes, Christina, Al-Awadhi, Maher, Gerasch, Andreas, Küntzer, Jan, Kohlbacher, Oliver, ...
BSP-Like External-Memory Computation
Jop F. Sibeyn, Michael Kaufmann
In this paper we present a paradigm for solving external-memory problems, and illustrate it by algorithms for matrix multiplication, sorting and list ranking. Our paradigm is based on the use of BSP...
On the Free Energy That Drove Primordial Anabolism
A key problem in understanding the origin of life is to explain the mechanism(s) that led to the spontaneous assembly of molecular building blocks that ultimately resulted in the appearance of...