36 citations · 216 across the 70 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.DS2008★ 5 cited
Drawing Binary Tanglegrams: An Experimental Evaluation
Martin Nöllenburg, Danny Holten, Markus Völker +1
A binary tanglegram is a pair <S,T> of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for examp…
cs.CG2008★ 13 cited
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
Kevin Buchin, Maike Buchin, Jaroslaw Byrka +4
A \emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For ap…