Therese Biedl, Torsten Thiele, David R. Wood, T. Biedl, T. Thiele, D. R. Wood, ...
Abstract An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid which only...
A Lower Bound on the Independence Number of Arbitrary Hypergraphs (2007)
We present a lower bound on the independence number of arbitrary hypergraphs in terms of the degree vectors. The degree vector of a vertex v is given by d(v) = (d 1 (v); d 2 (v); : : :) where dm (v)...
Therese Biedl, Torsten Thiele, David R. Wood
Abstract An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid which only...
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume (2004)
Therese Biedl, Torsten Thiele, David R. Wood
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid that only possibly...
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume (2001)
Biedl, Therese, Thiele, Torsten, Wood, David R.
In this paper, we study three-dimensional orthogonal box-drawings of graphs without loops. We provide lower bounds for three scenarios: (1) drawings where vertices have bounded aspect ratio, (2)...
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume (2001)
Biedl, Therese, Thiele, Torsten, Wood, David R.
In this paper, we study three-dimensional orthogonal box-drawings of graphs without loops. We provide lower bounds for three scenarios: (1) drawings where vertices have bounded aspect ratio, (2)...
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume (2001)
Biedl, Therese, Thiele, Torsten, Wood, David R.
In this paper, we study three-dimensional orthogonal box-drawings of graphs without loops. We provide lower bounds for three scenarios: (1) drawings where vertices have bounded aspect ratio, (2)...
Three-Dimensional Grid Drawings of Graphs (1998)
Pach, János, Thiele, Torsten, Tóth, Géza
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It is...
Three-Dimensional Grid Drawings of Graphs (1998)
Pach, János, Thiele, Torsten, Tóth, Géza
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It is...
Three-Dimensional Grid Drawings of Graphs (1998)
Pach, János, Thiele, Torsten, Tóth, Géza
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It is...
Three-Dimensional Grid Drawings of Graphs (1998)
János Pach, Torsten Thiele, Géza Tóth
. A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It...
Three-Dimensional Grid Drawings of Graphs (1998)
János Pach, Torsten Thiele, Géza Tóth, Fu Berlin
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It is...
Three-Dimensional Grid Drawings of Graphs (1998)
Anos Pach Courant, Torsten Thiele, Fu Berlin
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It is...
Untersuchungen des perioperativen Keimspektrums der Bindehaut / (1996)
Halle, Univ., Diss., 1997.
Geometric selection problems and hypergraphs [microform] / (1995)
Mikrofiche-Ausg.: 1 Mikrofiche : 24x.
This paper proves a lower bound on the independence number of general hypergraphs in terms of the degree vectors. The degree vector of a vertex v is given by d(v) = (d1(v); d2(v); : : :) where dm(v)...
Point Sets with Distinct Distances (1995)
For positive integers d and n let fd(n) denote the maximum cardinality of a subset of the n d -grid f1; 2; : : : ; ng d with distinct mutual euclidean distances. Improving earlier results of Erdos...
Geometric Selection Problems and Hypergraphs (1995)
Phd Thesis, Torsten Thiele, Supervisors Prof, Dr. M. Aigner, Prof Dr, E. Welzl
Contents Introduction 5 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1...