Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability

Buchin, Kevin, Buchin, Maike, Byrka, Jaroslaw, Martin Nöllenburg, Okamoto, Yoshio, Silveira, Rodrigo I., Wolff, Alexander
January 2009
PDF Cite DOI
Type
Conference Paper
Martin Nöllenburg
Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.