Sciweavers

7 search results - page 1 / 2
» Drawing (Complete) Binary Tanglegrams
Sort
View
112
Voted
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 1 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
83
Voted
GD
2008
Springer
15 years 1 months ago
Drawing (Complete) Binary Tanglegrams
Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin...
58
Voted
CORR
2008
Springer
83views Education» more  CORR 2008»
15 years 16 days ago
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin...
120
Voted
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
15 years 7 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
92
Voted
GD
1997
Springer
15 years 4 months ago
Minimum-Area h-v Drawings of Complete Binary Trees
Pierluigi Crescenzi, Paolo Penna