Bachmaier, Christian, Brandenburg, Franz J., Brunner, Wolfgang, Hofmeier, Andreas, Matzeder, Marco
Eintrag für die Universitätsbibliographie
Bachmaier, Christian, Brandenburg, Franz J., Brunner, Wolfgang
Eintrag für die Universitätsbibliographie
Bachmaier, Christian, Brandenburg, Franz J., Brunner, Wolfgang
Eintrag für die Universitätsbibliographie
In Silico Biology 2(3):415-426, 2002 The system architecture of the BioPath system* (2008)
Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber, Franz J. Brandenburg
BioPath is a prototype system for the interactive exploration of biochemical pathways. It has been developed as an electronic version of the famous Boehringer Biochemical Pathways map and offers...
08191 Working Group Report -- X-graphs of Y-graphs and their Representations (2008)
Batagelj, Vladimir, Brandenburg, Franz J., Didimo, Walter, Liotta, Guiseppe, Patrignani, Maurizio
We address graph decomposition problems that help the hybrid visualization of large graphs, where different graphic metaphors (node-link, matrix, etc.) are used in the same picture. We generalize the...
Eintrag für die Universitätsbibliographie
Drawing planar graphs on 8/9 n2 area. (2008)
Eintrag für die Universitätsbibliographie
1 On Drawing Planar Angle Graphs (2007)
Franz J. Brandenburg, Andreas Stbinger
Recently, some advanced algorithms for straight line drawings of planar graphs have been introduced. However, these algorithms produce drawings with many small angles. Their drawings are not...
Drawing Decorated Graphs (2007)
. Graph drawing algorithms are generally concerned with abstract graphs. Nodes are displayed as small points and edges as thin lines. Their real expansion on screen is neglected, since it is much...
The Ancestor Width of Grammars and Languages (2007)
The ancestor width is a new measure for the structure of derivations of arbitrary grammars. For every production used in a derivation or equivalently for every leaf we consider the strings of...
Graph Clustering II: Trees of Cliques with Size Bounds (2007)
Franz J. Brandenburg, Arunabha Sen
. We consider decompositions of a graph into cliques such that the resulting supergraph is a tree and there are bounds on the size of the tree or its degree, on the clique-size, or the separators...
The Generalized Shortest Path Problem (2007)
Vladimir Batagelj, Franz J. Brandenburg, Arunabha Sen
this paper we show that the generalized shortest path problem can be solved efficiently for multiplicative weights. The solution is running Dijkstra's algorithm in reverse. In the case of...
Partitions of Graphs into Trees (2007)
Biedl, Therese, Brandenburg, Franz J.
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with applications e.g. in...
Partitions of graphs into trees / Therese Biedl and Franz J. Brandenburg. (2007)
Eintrag für die Universitätsbibliographie
Partitions of Graphs into Trees (2007)
Biedl, Therese, Brandenburg, Franz J.
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with applications e.g. in...
Crossings and Permutations (2006)
Biedl, Therese, Brandenburg, Franz J., Deng, Xiaotie
We investigate crossing minimization problems for a set of permutations, where a crossing expresses a disarrangement between elements. The goal is a common permutation pi which minimizes the number...
Crossings and Permutations (2006)
Biedl, Therese, Brandenburg, Franz J., Deng, Xiaotie
We investigate crossing minimization problems for a set of permutations, where a crossing expresses a disarrangement between elements. The goal is a common permutation pi which minimizes the number...
Crossings and permutations / Therese Biedl, Franz J. Brandenburg and Xiaotie Deng. (2006)
Eintrag für die Universitätsbibliographie
Graph searching and search time / Franz J. Brandenburg and Stephanie Herrmann. (2006)
Eintrag für die Universitätsbibliographie
Crossings and Permutations (2006)
Biedl, Therese, Brandenburg, Franz J., Deng, Xiaotie
We investigate crossing minimization problems for a set of permutations, where a crossing expresses a disarrangement between elements. The goal is a common permutation pi which minimizes the number...
Efficient Visual Navigation of Hierarchically Structured Graphs (2006)
Marcus Raitner, Prof Dr, Franz J. Brandenburg
isual navigation of hierarchically structured graphs is a technique for interactively exploring large graphs that possess an additional hierar- chical structure. This structure is expressed in form...
Drawing Planar Bipartite Graphs With Small Area (2005)
Biedl, Therese, Brandenburg, Franz J.
In this paper, we study planar straight-line drawings of bipartite planar graphs. We show that these graphs admit drawings in an n/2 x (n/2-1) -grid, and that this is optimal. Our results generalize...
Drawing Planar Bipartite Graphs With Small Area (2005)
Biedl, Therese, Brandenburg, Franz J.
In this paper, we study planar straight-line drawings of bipartite planar graphs. We show that these graphs admit drawings in an n/2 x (n/2-1) -grid, and that this is optimal. Our results generalize...
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael
Eintrag für die Universitätsbibliographie
Eintrag für die Universitätsbibliographie
Eintrag für die Universitätsbibliographie
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael, Raitner, Marcus
Eintrag für die Universitätsbibliographie
Eintrag für die Universitätsbibliographie
Drawing planar bipartite graphs with small area / Therese Biedl, Franz Brandenburg. (2005)
Eintrag für die Universitätsbibliographie
Drawing Planar Bipartite Graphs With Small Area (2005)
Biedl, Therese, Brandenburg, Franz J.
In this paper, we study planar straight-line drawings of bipartite planar graphs. We show that these graphs admit drawings in an n/2 x (n/2-1) -grid, and that this is optimal. Our results generalize...
Radial Level Planarity Testing and Embedding in Linear Time (2005)
Christian Bachmaier, Franz J. Brandenburg, Michael Forster
A graph with a given partition of the vertices on k concentric circles is radial level planar if there is a vertex permutation such that the edges can be routed strictly outwards without crossings....
Radial Level Planarity Testing and Embedding in Linear Time (Extended Abstract) (2004)
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael
Every planar graph has a concentric representation based on a breadth first search, see [21]. The vertices are placed on concentric circles and the edges are routed as curves without crossings. Here...
Graph Drawing Contest Report (2004)
Brandenburg, Franz J., Brandes, Ulrik, Eades, Peter, Marks, Joe
This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy. The purpose of the contest is to monitor and challenge the...
Selected Open Problems in Graph Drawing (2004)
Brandenburg, Franz J., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Liotta, Giuseppe, Mutzel, Petra
In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research in graph drawing.
QUOGGLES: Query On Graphs – A Graphical Largely Extensible System (2004)
Holleis, Paul, Brandenburg, Franz J.
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line processing, and...
Gravisto: Graph Visualization Toolkit (2004)
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael, Holleis, Paul, Raitner, Marcus
Gravisto, the Graph Visualization Toolkit, is more than a (Java-based) editor for graphs. It includes data structures, graph algorithms, several layout algorithms, and a graph viewer component. As a...
Graph-Drawing Contest Report (2004)
Brandenburg, Franz J., Duncan, Christian A., Gansner, Emden R., Kobourov, Stephen G.
This report describes the Eleventh Annual Graph Drawing Contest, held in conjunction with the 2004 Graph Drawing Symposium in New York, USA. The purpose of the contest is to monitor and challenge the...
Radial Level Planarity Testing and Embedding in Linear Time (Extended Abstract) (2004)
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael
Every planar graph has a concentric representation based on a breadth first search, see [21]. The vertices are placed on concentric circles and the edges are routed as curves without crossings. Here...
Graph Drawing Contest Report (2004)
Brandenburg, Franz J., Brandes, Ulrik, Eades, Peter, Marks, Joe
This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy. The purpose of the contest is to monitor and challenge the...
Selected Open Problems in Graph Drawing (2004)
Brandenburg, Franz J., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Liotta, Giuseppe, Mutzel, Petra
In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research in graph drawing.
QUOGGLES: Query On Graphs – A Graphical Largely Extensible System (2004)
Holleis, Paul, Brandenburg, Franz J.
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line processing, and...
Gravisto: Graph Visualization Toolkit (2004)
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael, Holleis, Paul, Raitner, Marcus
Gravisto, the Graph Visualization Toolkit, is more than a (Java-based) editor for graphs. It includes data structures, graph algorithms, several layout algorithms, and a graph viewer component. As a...
Graph-Drawing Contest Report (2004)
Brandenburg, Franz J., Duncan, Christian A., Gansner, Emden R., Kobourov, Stephen G.
This report describes the Eleventh Annual Graph Drawing Contest, held in conjunction with the 2004 Graph Drawing Symposium in New York, USA. The purpose of the contest is to monitor and challenge the...
Radial Level Planarity Testing and Embedding in Linear Time (Extended Abstract) (2004)
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael
Every planar graph has a concentric representation based on a breadth first search, see [21]. The vertices are placed on concentric circles and the edges are routed as curves without crossings. Here...
Graph Drawing Contest Report (2004)
Brandenburg, Franz J., Brandes, Ulrik, Eades, Peter, Marks, Joe
This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy. The purpose of the contest is to monitor and challenge the...
Selected Open Problems in Graph Drawing (2004)
Brandenburg, Franz J., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Liotta, Giuseppe, Mutzel, Petra
In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research in graph drawing.
QUOGGLES: Query On Graphs – A Graphical Largely Extensible System (2004)
Holleis, Paul, Brandenburg, Franz J.
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line processing, and...
Gravisto: Graph Visualization Toolkit (2004)
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael, Holleis, Paul, Raitner, Marcus
Gravisto, the Graph Visualization Toolkit, is more than a (Java-based) editor for graphs. It includes data structures, graph algorithms, several layout algorithms, and a graph viewer component. As a...
Graph-Drawing Contest Report (2004)
Brandenburg, Franz J., Duncan, Christian A., Gansner, Emden R., Kobourov, Stephen G.
This report describes the Eleventh Annual Graph Drawing Contest, held in conjunction with the 2004 Graph Drawing Symposium in New York, USA. The purpose of the contest is to monitor and challenge the...
Crossings in Clustered Level Graphs (2004)
Michael Forster, Prof Dr, Franz J. Brandenburg
Clustered graphs are an enhanced graph model with a recursive clustering of the vertices according to a given nesting relation. This prime technique for expressing coherence of certain parts of the...
Gravisto: Graph Visualization Toolkit (Poster) (2004)
Franz J. Brandenburg, Christian Bachmaier, Franz J. Br, Michael Forster, Paul Holleis, ...
Gravisto, the Graph Visualization Toolkit, is more than a (Java-based) editor for graphs. It includes data structures, graph algorithms, several layout algorithms, and a graph viewer component. As a...
BioPath - Exploration and Visualization of Biochemical Pathways (2004)
Franz J. Brandenburg, Franz J. Br, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber
Biochemical reactions in organisms form large and complex networks. Examples are given by the Biochemical Pathways atlas [17] and the well known Boehringer Biochemical Pathways poster [16], see Fig....
Dissertation Circle Planarity of Level Graphs (2004)
Christian Bachmaier, Prof Dr, Franz J. Brandenburg
In this thesis we generalise the notion of level planar graphs in two directions: track planarity and radial planarity. Our main results are linear time algorithms both for the planarity test and for...
Circle Planarity of Level Graphs (2004)
Christian Bachmaier, Prof Dr, Franz J. Brandenburg
In this thesis we generalise the notion of level planar graphs in two directions: track planarity and radial planarity. Our main results are linear time algorithms both for the planarity test and for...
Graph Drawing Contest Report (2004)
Brandenburg, Franz J., Brandes, Ulrik, Eades, Peter, Marks, Joe
This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy. The purpose of the contest is to monitor and challenge the...
Radial level planarity testing and embedding in linear time (2003)
Christian Bachmaier, Franz J. Brandenburg, Michael Forster
A graph with a given partition of the vertices on k concentric circles is radial level planar if there is a vertex permutation such that the edges can be routed strictly outwards without crossings....
Radial Level Planarity Testing and Embedding in Linear Time (2003)
Christian Bachmaier, Franz J. Brandenburg, Franz J. Br, Michael Forster
Every planar graph has a concentric representation based on a breadth first search, see [24]. The vertices are placed on concentric circles and the edges are routed as curves without crossings. Here...
Radial level planarity testing and embedding in linear time (2003)
Christian Bachmaier, Franz J. Brandenburg, Michael Forster
michael_forster.cfm
Radial Level Planarity Testing and Embedding in Linear Time (2003)
Christian Bachmaier, Franz J. Brandenburg, Franz J. Br, Michael Forster
Every planar graph has a concentric representation based on a breadth first search, see [24]. The vertices are placed on concentric circles and the edges are routed as curves without crossings. Here...
Radial level planarity testing and embedding in linear time (2003)
Christian Bachmaier, Franz J. Brandenburg, Michael Forster
michael forster.cfm
Graph-Drawing Contest Report (2002)
This report describes the Ninth Annual Graph Drawing Contest, held in conjuction with the 2002 Graph Drawing Symposium in Irvine, California. The purpose of the contest is to monitor and challenge...
Computing and Drawing Isomorphic Subgraphs (2002)
Bachl, Sabine, Brandenburg, Franz J.
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. Then the graph partitions into a large subgraph, its copy and a remainder. The problem...
Brandenburg, Franz J., Forster, Michael, Pick, Andreas, Raitner, Marcus, Schreiber, Falk
Biochemical processes in organisms are considered as very large networks consisting of reactants, products and enzymes with interconnections representing reactions and regulation. Examples are given...
Graph-Drawing Contest Report (2002)
Biedl, Therese, Brandenburg, Franz J.
This report describes the Eight Annual Graph Drawing Contest, held in conjunction with the Ninth Graph Drawing Symposium in Vienna, Austria. The purpose of the contest is to monitor and challenge the...
Graph-Drawing Contest Report (2002)
This report describes the Ninth Annual Graph Drawing Contest, held in conjuction with the 2002 Graph Drawing Symposium in Irvine, California. The purpose of the contest is to monitor and challenge...
Computing and Drawing Isomorphic Subgraphs (2002)
Bachl, Sabine, Brandenburg, Franz J.
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. Then the graph partitions into a large subgraph, its copy and a remainder. The problem...
Brandenburg, Franz J., Forster, Michael, Pick, Andreas, Raitner, Marcus, Schreiber, Falk
Biochemical processes in organisms are considered as very large networks consisting of reactants, products and enzymes with interconnections representing reactions and regulation. Examples are given...
Graph-Drawing Contest Report (2002)
Biedl, Therese, Brandenburg, Franz J.
This report describes the Eight Annual Graph Drawing Contest, held in conjunction with the Ninth Graph Drawing Symposium in Vienna, Austria. The purpose of the contest is to monitor and challenge the...
Graph-Drawing Contest Report (2002)
This report describes the Ninth Annual Graph Drawing Contest, held in conjuction with the 2002 Graph Drawing Symposium in Irvine, California. The purpose of the contest is to monitor and challenge...
Computing and Drawing Isomorphic Subgraphs (2002)
Bachl, Sabine, Brandenburg, Franz J.
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. Then the graph partitions into a large subgraph, its copy and a remainder. The problem...
Brandenburg, Franz J., Forster, Michael, Pick, Andreas, Raitner, Marcus, Schreiber, Falk
Biochemical processes in organisms are considered as very large networks consisting of reactants, products and enzymes with interconnections representing reactions and regulation. Examples are given...
Graph-Drawing Contest Report (2002)
Biedl, Therese, Brandenburg, Franz J.
This report describes the Eight Annual Graph Drawing Contest, held in conjunction with the Ninth Graph Drawing Symposium in Vienna, Austria. The purpose of the contest is to monitor and challenge the...
Franz J. Brandenburg, Franz J. Br, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber, ...
Biochemical processes in organisms are considered as very large networks consisting of reactants, products and enzymes...
Graph-Drawing Contest Report (2001)
Brandenburg, Franz J., Brandes, Ulrik, Himsolt, Michael, Raitner, Marcus
This report describes the Seventh Annual Graph Drawing Contest, held in conjunction with the 2000 Graph Drawing Symposium in Williamsburg, Virginia. The purpose of the contest is to monitor and...
Graph-Drawing Contest Report (2001)
Brandenburg, Franz J., Brandes, Ulrik, Himsolt, Michael, Raitner, Marcus
This report describes the Seventh Annual Graph Drawing Contest, held in conjunction with the 2000 Graph Drawing Symposium in Williamsburg, Virginia. The purpose of the contest is to monitor and...
Graph-Drawing Contest Report (2001)
Brandenburg, Franz J., Brandes, Ulrik, Himsolt, Michael, Raitner, Marcus
This report describes the Seventh Annual Graph Drawing Contest, held in conjunction with the 2000 Graph Drawing Symposium in Williamsburg, Virginia. The purpose of the contest is to monitor and...
Graph Clustering Using Distance-k Cliques (1999)
Edachery, Jubin, Sen, Arunabha, Brandenburg, Franz J.
Identifying the natural clusters of nodes in a graph and treating them as supernodes or metanodes for a higher level graph (or an abstract graph) is a technique used for the reduction of visual...
Graph-Drawing Contest Report (1999)
Brandenburg, Franz J., Jünger, Michael, Marks, Joe, Mutzel, Petra, Schreiber, Falk
This report describes the Sixth Annual Graph Drawing Contest, held in conjunction with the 1999 Graph Drawing Symposium in Prague, Czech Republic. The purpose of the contest is to monitor and...
Graph Clustering Using Distance-k Cliques (1999)
Edachery, Jubin, Sen, Arunabha, Brandenburg, Franz J.
Identifying the natural clusters of nodes in a graph and treating them as supernodes or metanodes for a higher level graph (or an abstract graph) is a technique used for the reduction of visual...
Graph-Drawing Contest Report (1999)
Brandenburg, Franz J., Jünger, Michael, Marks, Joe, Mutzel, Petra, Schreiber, Falk
This report describes the Sixth Annual Graph Drawing Contest, held in conjunction with the 1999 Graph Drawing Symposium in Prague, Czech Republic. The purpose of the contest is to monitor and...
Graph Clustering Using Distance-k Cliques (1999)
Edachery, Jubin, Sen, Arunabha, Brandenburg, Franz J.
Identifying the natural clusters of nodes in a graph and treating them as supernodes or metanodes for a higher level graph (or an abstract graph) is a technique used for the reduction of visual...
Graph-Drawing Contest Report (1999)
Brandenburg, Franz J., Jünger, Michael, Marks, Joe, Mutzel, Petra, Schreiber, Falk
This report describes the Sixth Annual Graph Drawing Contest, held in conjunction with the 1999 Graph Drawing Symposium in Prague, Czech Republic. The purpose of the contest is to monitor and...
Graph Drawing Contest Report (1999)
Franz J. Brandenburg, Franz J. Br, Ulrik Brandes, Peter Eades, Joe Marks
This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy. The purpose of the contest is to monitor and challenge the...
Graph-Drawing Contest Report (1999)
Franz J. Brandenburg, Michael Junger, Joe Marks, Petra Mutzel, Falk Schreiber
. This report describes the Sixth Annual Graph Drawing Contest, held in conjunction with the 1999 Graph Drawing Symposium in Prague, Czech Republic. The purpose of the contest is to monitor and...
Graph Clustering I: Cycles of Cliques (1998)
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that each cluster is a clique and the cliques form a cycle. Then there is a partition of the set of edges...
Graph Clustering I: Cycles of Cliques (1998)
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that each cluster is a clique and the cliques form a cycle. Then there is a partition of the set of edges...
Graph Clustering I: Cycles of Cliques (1998)
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that each cluster is a clique and the cliques form a cycle. Then there is a partition of the set of edges...
Algorithmen zum automatischen Zeichnen von Graphen (1997)
Brandenburg, Franz J., Jünger, Michael, Mutzel, Petra
Graph drawing is a new and growing area in Computer Science. It is concerned with the design, analysis, implementation and evaluation of new algorithms for aesthetically nice drawings of graphs....
Algorithmen zum automatischen Zeichnen von Graphen (1997)
Brandenburg, Franz J., Jünger, Michael, Mutzel, Petra
Graph drawing is a new and growing area in Computer Science. It is concerned with the design, analysis, implementation and evaluation of new algorithms for aesthetically nice drawings of graphs....
Algorithmen zum automatischen Zeichnen von Graphen (1997)
Brandenburg, Franz J., Jünger, Michael, Mutzel, Petra
Graph drawing is a new and growing area in Computer Science. It is concerned with the design, analysis, implementation and evaluation of new algorithms for aesthetically nice drawings of graphs....
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms (1996)
Brandenburg, Franz J., Himsolt, Michael, Rohrer, Christoph
We report on our experiments with five graph drawing algorithms for general undirected graphs. These are the algorithms FR introduced by Fruchterman and Reingold [5], KK by Kamada and Kawai [11], Tu...
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms (1996)
Brandenburg, Franz J., Himsolt, Michael, Rohrer, Christoph
We report on our experiments with five graph drawing algorithms for general undirected graphs. These are the algorithms FR introduced by Fruchterman and Reingold [5], KK by Kamada and Kawai [11], Tu...
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms (1996)
Brandenburg, Franz J., Himsolt, Michael, Rohrer, Christoph
We report on our experiments with five graph drawing algorithms for general undirected graphs. These are the algorithms FR introduced by Fruchterman and Reingold [5], KK by Kamada and Kawai [11], Tu...
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms (1996)
Franz J. Brandenburg, Michael Himsolt, Christoph Rohrer
. We report on our experiments with five graph drawing algorithms for general undirected graphs. These are the algorithms FR introduced by Fruchterman and Reingold [5], KK by Kamada and Kawai [11],...
Designing Graph Drawings by Layout Graph Grammars (1995)
Layout graph grammars are a grammatical or rule-based method for the construction of graphs and of their drawings. As such they are representatives of the so-called declarative approach. A layout...
Designing Graph Drawings by Layout Graph Grammars (1995)
Layout graph grammars are a grammatical or rule-based method for the construction of graphs and of their drawings. As such they are representatives of the so-called declarative approach. A layout...
Designing Graph Drawings by Layout Graph Grammars (1995)
Layout graph grammars are a grammatical or rule-based method for the construction of graphs and of their drawings. As such they are representatives of the so-called declarative approach. A layout...
On Local Routing of Two-Terminal Nets (1987)
Kaufmann, Michael, Mehlhorn, Kurt, Brandenburg, Franz J., Vidal-Naquet, Guy, Wirsing, Martin
Die Zusammenhangskomplexität von nicht-kontextfreien Grammatiken / (1978)
Zugl.: Bonn, Univ., Math.-Naturwissenschaftl. Fak., Diss., 1978.