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

Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff. Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. Algorithmica, 62(1-2):309-332, 2012. [doi]

@article{BuchinBBNOSW12,
  title = {Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability},
  author = {Kevin Buchin and Maike Buchin and Jaroslaw Byrka and Martin Nöllenburg and Yoshio Okamoto and Rodrigo I. Silveira and Alexander Wolff},
  year = {2012},
  doi = {10.1007/s00453-010-9456-3},
  url = {http://dx.doi.org/10.1007/s00453-010-9456-3},
  researchr = {https://researchr.org/publication/BuchinBBNOSW12},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {62},
  number = {1-2},
  pages = {309-332},
}