1. Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132–169 (1998)
2. Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability (2008), http://arxiv.org/abs/0806.0920 Arxiv report
3. DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees. In: Proc. 18th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA 1997), pp. 427–436 (1997)
4. Lecture Notes in Computer Science;V. Dujmović,2004
5. Dwyer, T., Schreiber, F.: Optimal leaf ordering for two and a half dimensional phylogenetic tree visualization. In: Proc. Australasian Sympos. Inform. Visual (InVis.au 2004). CRPIT, vol. 35, pp. 109–115. Australian Comput. Soc. (2004)