Selected references
- Jonathan F. Buss and Peter W. Shor. On the pagenumber of planar graphs. In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pages 98-100, Washington, D.C., 1984.
- I. S. Filotti, Gary L. Miller, and John Reif. On determining the genus of a graph in O(v^{O(g)}) steps. In Conference Record of the Eleventh Annual ACM Symposium on Theory of Computing, pages 27-37, Atlanta, Georgia, 30 April-2 May 1979.
- Zvi Galil, Ravi Kannan, and Endre Szemeredi. On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 39-49, Berkeley, California, 28-30 May 1986.
- Lenny Heath. Embedding planar graphs in seven pages. In 25th Annual Symposium on Foundations of Computer Science, pages 74-83, Singer Island, Florida, 24-26 October 1984. IEEE.
- Lenwood S. Heath and Sorin Istrail. The pagenumber of genus g graphs is O(g). In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 388-397, New York City, 25-27 May 1987.
- Ravi Kannan. Unraveling k-page graphs. Information and Control, 66(1/2):1-5, July/August 1985.
- Seth M. Malitz. Genus g graphs have pagenumber O(\sqrt g)}. In 29th Annual Symposium on Foundations of Computer Science, pages 458-468, White Plains, New York, 24-26 October 1988. IEEE.
- Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, and William T. Trotter. On determinism versus non-determinism and related problems (preliminary version). In 24th Annual Symposium on Foundations of Computer Science, pages 429-438, Tucson, Arizona, 7-9 November 1983. IEEE.
- Mihalis Yannakakis. Four pages are necessary and sufficient for planar graphs (extended abstract). In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 104-108, Berkeley, California, 28-30 May 1986.