A note on optimal area algorithms for upward drawings of binary trees

This publication has 23 references indexed in Scilit:

• A linear-time algorithm for drawing a planar graph on a grid
  Information Processing Letters, 1995
• Algorithms for drawing graphs: an annotated bibliography
  Computational Geometry, 1994
• Bipartite graphs, upward drawings, and planarity
  Information Processing Letters, 1990
• Automatic graph drawing and readability of diagrams
  IEEE Transactions on Systems, Man, and Cybernetics, 1988
• Fundamentals of planar ordered sets
  Discrete Mathematics, 1987
• Computational aspects of VLSI: J D Ullman, Computer Science Press (1984) 495 pp
  Computer-Aided Design, 1985
• Minimum Edge Length Planar Embeddings of Trees
  Published by Springer Nature ,1981
• On the area of binary tree layouts
  Information Processing Letters, 1980
• Pretty-printing of trees
  Software: Practice and Experience, 1980
• Planar Lattices
  Canadian Journal of Mathematics, 1975