@awolff

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

, , , , , , and . Proc. 16th Int. Sympos. Graph Drawing (GD'08), volume 5417 of Lecture Notes in Computer Science, page 324--335. Springer-Verlag, (2009)
DOI: 10.1007/978-3-642-00219-9_32

Links and resources

Tags

community

  • @awolff
  • @fink
@awolff's tags highlighted