A near-linear area bound for drawing binary trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Upward drawings of trees on the minimum number of layers
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Quantifying the space-efficiency of 2D graphical representations of trees
Information Visualization
Hi-index | 0.00 |