Sciweavers

GD
2003
Springer
13 years 10 months ago
Graph Drawing Contest Report
This report describes the the Second Annual Graph Drawing Contest, held in conjunction with the 1995 Graph Drawing Symposium in Passau, Germany. The purpose of the contest is to b...
Franz-Josef Brandenburg, Ulrik Brandes, Peter Eade...
GD
2004
Springer
13 years 10 months ago
Layout Volumes of the Hypercube
We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Gr...
Lubomir Torok, Imrich Vrto
GD
2005
Springer
13 years 10 months ago
Drawing Kn in Three Dimensions with One Bend Per Edge
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounde...
Olivier Devillers, Hazel Everett, Sylvain Lazard, ...
GD
2007
Springer
13 years 11 months ago
Minimizing the Area for Planar Straight-Line Grid Drawings
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
Marcus Krug, Dorothea Wagner
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 5 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic