We show that finding a minimum-width orthogonal upward drawing of a phylogenetic tree is NP-hard if the ordering of leaves is unconstrained and we provide a linear time algorithm for ordered trees. We also study a couple heuristic algorithms for the unconstrained case and compare experimental results.
Joint work with Juan Besa, Michael Goodrich, and Timothy Johnson