Drawing (Complete) Binary Tanglegrams

Buchin, Kevin, Buchin, Maike, Byrka, Jaroslaw, Martin Nöllenburg, Okamoto, Yoshio, Silveira, Rodrigo, Wolff, Alexander
January 2012
bib DOI

Abstract

Full Citation:

Buchin, Kevin, Buchin, Maike, Byrka, Jaroslaw, Nöllenburg, Martin, Okamoto, Yoshio, Silveira, Rodrigo, Wolff, Alexander. Drawing (Complete) Binary Tanglegrams. Algorithmica, volume 62, number 1–2, pages 309-332, 2012.

Type
Journal Article
Martin Nöllenburg
Martin Nöllenburg

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