A.: Drawing (complete) binary tanglegrams: Hardness, approximation, fixedparameter tractability. Arxiv report (2008)

by K Buchin, M Buchin, J Byrka, M Nöllenburg, Y Okamoto, R I Silveira, Wolff