"Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, ..."

Kevin Buchin et al. (2012)

> Home

Details and statistics

DOI: 10.1007/S00453-010-9456-3

access: open

type: Journal Article

metadata version: 2019-10-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BuchinBBNOSW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BuchinBBNOSW12
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.