Sciweavers

24 search results - page 2 / 5
» New Lower Bounds For Orthogonal Drawings
Sort
View
GD
2001
Springer
13 years 8 months ago
Orthogonal Drawings with Few Layers
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
Therese C. Biedl, John R. Johansen, Thomas C. Sher...
CORR
2004
Springer
113views Education» more  CORR 2004»
13 years 3 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers
APVIS
2008
13 years 5 months ago
Crossing Minimization meets Simultaneous Drawing
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
Markus Chimani, Michael Jünger, Michael Schul...
APVIS
2007
13 years 5 months ago
Straight-line grid drawings of planar graphs with linear area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
Md. Rezaul Karim, Md. Saidur Rahman
ICALP
2005
Springer
13 years 9 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos