Drawing (complete) binary tanglegrams: hardness, approximation, fixed-parameter tractability

K. Buchin, M. Buchin, J. Byrka, M. Nöllenburg, Y. Okamoto, R.I. Silveira, A. Wolff

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

12 Citations (Scopus)

Fingerprint Dive into the research topics of 'Drawing (complete) binary tanglegrams: hardness, approximation, fixed-parameter tractability'. Together they form a unique fingerprint.

Mathematics