On the pagenumber of planar graphs

Authors:
Jonathan F. Buss;Peter W. Shor
Affiliations:
-;-
Venue:
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Year:
1984

On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Four pages are necessary and sufficient for planar graphs

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The page number of genus g graphs is (g)

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The pagenumber of genus g graphs is O(g)

Journal of the ACM (JACM)
On the page number of upward planar directed acyclic graphs

GD'11 Proceedings of the 19th international conference on Graph Drawing
Implementing a partitioned 2-page book embedding testing algorithm

GD'12 Proceedings of the 20th international conference on Graph Drawing

Hi-index	0.00