Drawing planar partitions I: LL-drawings and LH-drawings
Proceedings of the fourteenth annual symposium on Computational geometry
Level Planarity Testing in Linear Time
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Drawing Planar Partitions II: HH-Drawings
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Nice Drawings for Planar Bipartite Graphs
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Curve-constrained drawings of planar graphs
Computational Geometry: Theory and Applications
Computing straight-line 3D grid drawings of graphs in linear volume
Computational Geometry: Theory and Applications
Theoretical Computer Science
Computing straight-line 3D grid drawings of graphs in linear volume
Computational Geometry: Theory and Applications
Proper and planar drawings of graphs on three layers
GD'05 Proceedings of the 13th international conference on Graph Drawing
Computing radial drawings on the minimum number of circles
GD'04 Proceedings of the 12th international conference on Graph Drawing
Hamiltonian-with-handles graphs and thek-spine drawability problem
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |
We give a linear-time algorithm to decide whether a graph has a planar LL-drawing, i.e. a planar drawing on two parallel lines. This has previously been known only for trees. We utilize this result to obtain planar drawings on three lines for a generalization of bipartite graphs, also in linear time.