REFERENCES 41
[PT00] M. Pizzonia and R. Tamassia. Minimum depth graph embedding. In
M. Paterson, editor, ESA ’00, volume 1879 of LN CS, pages 356–367, 2000.
[RND77] E. M. Reingold, J. Nievergelt, and N. Deo. Combinatorial Algorithms:
Theory and Practice. Prentice Hall, Englewood Cliffs, NJ, 1977.
[Ros80] P. Rosenstiehl. Preuve alg´eb r iq ue du cr it`ere de planarit´e du Wu-Liu. An-
nals of Discrete Mathematics, 9:67–78, 1980.
[RR89] V. Ramachandran and J. H. Reif. An optimal parallel algorithm for graph
planarity. In Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci., pages
282–293, 1989.
[RR94] V. Ramachandran and J. Reif. Planarity testing in parallel. Journal of
Computer and System Sciences, 49:517–561, December 1994.
[RS84] N. Robertson and P. D.