[1]
Marriott, K. and Stuckey, P. 2004. NP-Completeness of Minimal Width Unordered Tree Layout. Journal of Graph Algorithms and Applications. 8, 3 (Jan. 2004), 295–312. DOI:https://doi.org/10.7155/jgaa.00093.