O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams | IEEE Conference Publication | IEEE Xplore