Non-Planar Orthogonal Drawings with Fixed Topology Extended Abstract (2008)
Markus Chimani, Gunnar W. Klau, René Weiskircher
Abstract. This paper discusses the calculation of bend minimal shapes for non-planar graphs with given topology. Based on the Simple-Kandinsky drawing standard – a simplification of the more...
Non-Planar Orthogonal Drawings with Fixed Topology Extended Abstract (2008)
Markus Chimani, Gunnar W. Klau, René Weiskircher
Abstract. This paper discusses the calculation of bend minimal shapes for non-planar graphs with given topology. Based on the Simple-Kandinsky drawing standard – a simplification of the more...
Label Number Maximization in the Slider Model (Extended Abstract) (2008)
Dietmar Ebner, Gunnar W. Klau, René Weiskircher
Abstract. We consider the NP-hard label number maximization problem lnm: Given a set of rectangular labels, each of which belongs to a point feature in the plane, the task is to find a labeling for a...
Label Number Maximization in the Slider Model (Extended Abstract) (2008)
Dietmar Ebner, Gunnar W. Klau, René Weiskircher
Abstract. We consider the NP-hard label number maximization problem lnm: Given a set of rectangular labels, each of which belongs to a point feature in the plane, the task is to find a labeling for a...
Solving the prize-collecting Steiner tree problem to optimality (2008)
Ivana Ljubić, René Weiskircher, Ulrich Pferschy, Gunnar Klau, Petra Mutzel
The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus the total...
Non-Planar Orthogonal Drawings with Fixed Topology (2008)
Markus Chimani, Gunnar W. Klau, René Weiskircher, Markus Chimani, Gunnar W. Klau, René Weiskircher
Abstract. We present a procedure for calculating the bend minimal shape of non-planar graphs with given topology. The method is an extension of the Simple-Kandinsky drawing standard – a...
Univ.Ass. Dr. Gunnar W. Klau sowie (2008)
Ausgeführt Am, Univ. Ass Dr, René Weiskircher, Dietmar Ebner
First of all I want to thank my advisor Petra Mutzel and her group at the department of Algorithms and Data Structures at the Technical University of Vienna for the possibility to write my thesis...
Solving the Prize-Collecting Steiner Tree Problem to Optimality ⋆ (2008)
Ivana Ljubi, René Weiskircher, Ulrich Pferschy, Gunnar Klau, Petra Mutzel, Ivana Ljubić, ...
www.cg.tuwien.ac.at
Univ.Ass. Dr. Gunnar W. Klau sowie (2008)
Ausgeführt Am, Univ. Ass Dr, René Weiskircher, Dietmar Ebner
First of all I want to thank my advisor Petra Mutzel and her group at the department of Algorithms and Data Structures at the Technical University of Vienna for the possibility to write my thesis...
Solving the Prize-Collecting Steiner Tree Problem to Optimality ⋆ (2008)
Ivana Ljubi, René Weiskircher, Ulrich Pferschy, Gunnar Klau, Petra Mutzel, Ivana Ljubić, ...
www.cg.tuwien.ac.at
25.07.97 Diploma at the Universität des Saarlandes (2008)
René Weiskircher, Nationality German
23.05.02 Awarded PhD from the Universität des Saarlandes for the thesis “New Applications of SPQR-Trees in Graph Drawing” (summa cum laude). Since 01/00 Researcher with teaching responsibilities...
25.07.97 Diploma at the Universität des Saarlandes (2008)
René Weiskircher, Nationality German
23.05.02 Awarded PhD from the Universität des Saarlandes for the thesis “New Applications of SPQR-Trees in Graph Drawing” (summa cum laude). Since 01/00 Researcher with teaching responsibilities...
Exact Crossing Minimization (2006)
Buchheim, Christoph, Ebner, Dietmar, Jünger, Michael, Klau, Gunnar W., Mutzel, Petra, Weiskircher, René
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph into the plane. This very basic property has been studied extensively in the literature from a...
Exact Crossing Minimization (2006)
Buchheim, Christoph, Ebner, Dietmar, Jünger, Michael, Klau, Gunnar W., Mutzel, Petra, Weiskircher, René
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph into the plane. This very basic property has been studied extensively in the literature from a...
Exact Crossing Minimization (2006)
Buchheim, Christoph, Ebner, Dietmar, Jünger, Michael, Klau, Gunnar W., Mutzel, Petra, Weiskircher, René
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph into the plane. This very basic property has been studied extensively in the literature from a...
Solving the prize-collecting Steiner tree problem to optimality (2005)
Ivana Ljubić, René Weiskircher, Ulrich Pferschy, Gunnar Klau, Petra Mutzel
The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus the total...
Label Number Maximization in the Slider Model (Extended Abstract) (2004)
Ebner, Dietmar, Klau, Gunnar W., Weiskircher, René
We consider the NP-hard label number maximization problem lnm: Given a set of rectangular labels, each of which belongs to a point feature in the plane, the task is to find a labeling for a largest...
Label Number Maximization in the Slider Model (Extended Abstract) (2004)
Ebner, Dietmar, Klau, Gunnar W., Weiskircher, René
We consider the NP-hard label number maximization problem lnm: Given a set of rectangular labels, each of which belongs to a point feature in the plane, the task is to find a labeling for a largest...
Label Number Maximization in the Slider Model (Extended Abstract) (2004)
Ebner, Dietmar, Klau, Gunnar W., Weiskircher, René
We consider the NP-hard label number maximization problem lnm: Given a set of rectangular labels, each of which belongs to a point feature in the plane, the task is to find a labeling for a largest...
www.cg.tuwien.ac.at Bend Minimization in Planar Orthogonal Drawings Using Integer Programming (2004)
Petra Mutzel, René Weiskircher, Petra Mutzel, René Weiskircher
We consider the problem of minimizing the number of bends in a planar orthogonal graph drawing. While the problem can be solved via network flow for a given planar embedding of a graph G, it is...
Solving the Prize-Collecting Steiner Tree Problem (2004)
Ivana Lubic, Ivana Ljubić, René Weiskircher, René Weiskircher, Ulrich Pferschy, Ulrich Pferschy, ...
The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus the total...
Bend-Minimal Orthogonal Drawing of Non-Planar Graphs (2004)
Ausgeführt Am, Unter Anleitung Von, Univ. Prof Dr, Petra Mutzel, Gunnar W. Klau, Univ. Ass Dr, ...
This tis is belongst ot he field of graph drawing research. It present s a new procedure for calculatp tl bend minimal shape of non--planar graphswit givent opology. This met9 d is anextP,,9 oft he...
Non-Planar Orthogonal Drawings with Fixed Topology (2004)
Markus Chimani, Gunnar W. Klau, René Weiskircher, Markus Chimani, Gunnar W. Klau, René Weiskircher
Abstract. We present a procedure for calculating the bend minimal shape of non-planar graphs with given topology. The method is an extension of the Simple-Kandinsky drawing standard – a...
Forcebased label number maximization (2003)
Dietmar Ebner, Dietmar Ebner, Gunnar W. Klau, Gunnar W. Klau, René Weiskircher
Abstract. We present a force-based simulated annealing algorithm to heuristically solve the NP-hard label number maximization problem lnm: Given a set of rectangular labels, each of which belongs to...
The fractional prize-collecting Steiner tree problem on trees (2003)
Gunnar W. Klau, Gunnar W. Klau, Ivana Ljubić, Ivana Ljubić, Petra Mutzel, Petra Mutzel, ...
Abstract. We consider the fractional prize-collecting Steiner tree problem on trees. This problem asks for a subtree T containing the root of a given tree G = (V, E) maximizing the ratio of the...
Advances in C-Planarity Testing of Clustered Graphs (2002)
Gutwenger, Carsten, Jünger, Michael, Leipert, Sebastian, Mutzel, Petra, Percan, Merijam, Weiskircher, René
A clustered graph C=(G,T) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G=(V,E). Each vertex c in T corresponds to a subset of the...
Advances in C-Planarity Testing of Clustered Graphs (Extended Abstract) (2002)
Gutwenger, Carsten, Jünger, Michael, Leipert, Sebastian, Mutzel, Petra, Percan, Merijam, Weiskircher, René
A clustered graph C=(G,T) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G=(V,E). Each vertex \mu in T corresponds to a subset of the...
AGD: A Library of Algorithms for Graph Drawing (2002)
Gutwenger, Carsten, Jünger, Michael, Klau, Gunnar W., Leipert, Sebastian, Mutzel, Petra, Weiskircher, René
The AGD library provides algorithms, data structures, and tools to create geometric representations of graphs and aims at bridging the gap between theory and practice in the area of graph drawing. It...
Advances in C-Planarity Testing of Clustered Graphs (2002)
Gutwenger, Carsten, Jünger, Michael, Leipert, Sebastian, Mutzel, Petra, Percan, Merijam, Weiskircher, René
A clustered graph C=(G,T) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G=(V,E). Each vertex c in T corresponds to a subset of the...
Advances in C-Planarity Testing of Clustered Graphs (Extended Abstract) (2002)
Gutwenger, Carsten, Jünger, Michael, Leipert, Sebastian, Mutzel, Petra, Percan, Merijam, Weiskircher, René
A clustered graph C=(G,T) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G=(V,E). Each vertex \mu in T corresponds to a subset of the...
AGD: A Library of Algorithms for Graph Drawing (2002)
Gutwenger, Carsten, Jünger, Michael, Klau, Gunnar W., Leipert, Sebastian, Mutzel, Petra, Weiskircher, René
The AGD library provides algorithms, data structures, and tools to create geometric representations of graphs and aims at bridging the gap between theory and practice in the area of graph drawing. It...
Advances in C-Planarity Testing of Clustered Graphs (2002)
Gutwenger, Carsten, Jünger, Michael, Leipert, Sebastian, Mutzel, Petra, Percan, Merijam, Weiskircher, René
A clustered graph C=(G,T) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G=(V,E). Each vertex c in T corresponds to a subset of the...
Advances in C-Planarity Testing of Clustered Graphs (Extended Abstract) (2002)
Gutwenger, Carsten, Jünger, Michael, Leipert, Sebastian, Mutzel, Petra, Percan, Merijam, Weiskircher, René
A clustered graph C=(G,T) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G=(V,E). Each vertex \mu in T corresponds to a subset of the...
AGD: A Library of Algorithms for Graph Drawing (2002)
Gutwenger, Carsten, Jünger, Michael, Klau, Gunnar W., Leipert, Sebastian, Mutzel, Petra, Weiskircher, René
The AGD library provides algorithms, data structures, and tools to create geometric representations of graphs and aims at bridging the gap between theory and practice in the area of graph drawing. It...
Optimizing over All Combinatorial Embeddings of a Planar Graph (1998)
Petra Mutzel, René Weiskircher, Im Stadtwald
We study the problem of optimizing over the set of all combinatorial embeddings of a given planar graph. Our objective function prefers certain cycles of G as face cycles in the embedding. The...