AbstractWe show an algorithm for constructing O(dnlogn) area outerplanar straight-line drawings of n-vertex outerplanar graphs with degree d. Also, we settle in the negative a conjecture (Biedl, 2002 [1]) on the area requirements of outerplanar graphs by showing that snowflake graphs admit linear-area drawings
International audienceWe show that any outerplanar graph admits a planar straight-line drawing such ...
A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edg...
We show that any outerplanar graph admits a planar straight-line drawing such that the length ratio ...
AbstractIt is important to minimize the area of a drawing of a graph, so that the drawing can fit in...
AbstractIt is important to minimize the area of a drawing of a graph, so that the drawing can fit in...
We show three linear time algorithms for constructing planar straight-line grid drawings of outerpla...
We show three linear time algorithms for constructing planar straight-line grid drawings of outerpla...
We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid ...
We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid ...
In this paper, we study drawings of outer-planar graphs in various models. We show that O(n log n) a...
In this paper, we study drawings of outer-planar graphs in various models. We show that O(n log n) a...
We study area-efficient drawings of planar graphs: embeddings of graphs on an integer grid so that t...
We make progress on a number of open problems concerning the area requirement for drawing trees on a...
Despite a long research effort, finding the minimum area for straight-line grid drawings of planar g...
Despite a long research effort, finding the minimum area for straight-line grid drawings of planar g...
International audienceWe show that any outerplanar graph admits a planar straight-line drawing such ...
A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edg...
We show that any outerplanar graph admits a planar straight-line drawing such that the length ratio ...
AbstractIt is important to minimize the area of a drawing of a graph, so that the drawing can fit in...
AbstractIt is important to minimize the area of a drawing of a graph, so that the drawing can fit in...
We show three linear time algorithms for constructing planar straight-line grid drawings of outerpla...
We show three linear time algorithms for constructing planar straight-line grid drawings of outerpla...
We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid ...
We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid ...
In this paper, we study drawings of outer-planar graphs in various models. We show that O(n log n) a...
In this paper, we study drawings of outer-planar graphs in various models. We show that O(n log n) a...
We study area-efficient drawings of planar graphs: embeddings of graphs on an integer grid so that t...
We make progress on a number of open problems concerning the area requirement for drawing trees on a...
Despite a long research effort, finding the minimum area for straight-line grid drawings of planar g...
Despite a long research effort, finding the minimum area for straight-line grid drawings of planar g...
International audienceWe show that any outerplanar graph admits a planar straight-line drawing such ...
A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edg...
We show that any outerplanar graph admits a planar straight-line drawing such that the length ratio ...
DOI
Add to ORKG