Sciweavers

43 search results - page 5 / 9
» Treemaps with Bounded Aspect Ratio
Sort
View
GD
2000
Springer
13 years 11 months ago
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
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 w...
Therese C. Biedl, Torsten Thiele, David R. Wood
IJCGA
2007
44views more  IJCGA 2007»
13 years 7 months ago
On the Expected Size of the 2D Visibility Complex
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the asymptotic expected number of free bitangents (which corres...
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, ...
ATVA
2011
Springer
254views Hardware» more  ATVA 2011»
12 years 7 months ago
Formal Analysis of Online Algorithms
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
Benjamin Aminof, Orna Kupferman, Robby Lampert
ICALP
2009
Springer
14 years 8 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
ICCAD
2006
IEEE
123views Hardware» more  ICCAD 2006»
14 years 4 months ago
A revisit to floorplan optimization by Lagrangian relaxation
With the advent of deep sub-micron (DSM) era, floorplanning has become increasingly important in physical design process. In this paper we clarify a misunderstanding in using Lag...
Chuan Lin, Hai Zhou, Chris C. N. Chu