@article{ dblp2425367,
  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},
  author_short = {Buchin, K. and Buchin, M. and Byrka, J. and Nöllenburg, M. and Okamoto, Y. and Silveira, R. I. and Wolff, A.},
  bibtype = {article},
  type = {article},
  year = {2012},
  key = {dblp2425367},
  id = {dblp2425367},
  biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/BuchinBBNOSW12},
  url = {http://dx.doi.org/10.1007/s00453-010-9456-3},
  journal = {Algorithmica},
  pages = {309-332},
  number = {1-2},
  volume = {62},
  text = {Algorithmica 62(1-2):309-332 (2012)}
}

{"_id":"zDm24vnRZ9HbgPXRx","bibbaseid":"buchin-buchin-byrka-nllenburg-okamoto-silveira-wolff-drawingcompletebinarytanglegramshardnessapproximationfixedparametertractability-2012","downloads":0,"creationDate":"2016-01-14T11:55:47.221Z","title":"Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability","author_short":["Buchin, K.","Buchin, M.","Byrka, J.","Nöllenburg, M.","Okamoto, Y.","Silveira, R. I.","Wolff, A."],"year":2012,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/algorithmica/BuchinBBNOSW12","bibdata":{"title":"Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability","author":["Kevin Buchin","Maike Buchin","Jaroslaw Byrka","Martin Nöllenburg","Yoshio Okamoto","Rodrigo I. Silveira","Alexander Wolff"],"author_short":["Buchin, K.","Buchin, M.","Byrka, J.","Nöllenburg, M.","Okamoto, Y.","Silveira, R. I.","Wolff, A."],"bibtype":"article","type":"article","year":"2012","key":"dblp2425367","id":"dblp2425367","biburl":"http://www.dblp.org/rec/bibtex/journals/algorithmica/BuchinBBNOSW12","url":"http://dx.doi.org/10.1007/s00453-010-9456-3","journal":"Algorithmica","pages":"309-332","number":"1-2","volume":"62","text":"Algorithmica 62(1-2):309-332 (2012)","bibtex":"@article{ dblp2425367,\n title = {Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability},\n author = {Kevin Buchin and Maike Buchin and Jaroslaw Byrka and Martin Nöllenburg and Yoshio Okamoto and Rodrigo I. Silveira and Alexander Wolff},\n author_short = {Buchin, K. and Buchin, M. and Byrka, J. and Nöllenburg, M. and Okamoto, Y. and Silveira, R. I. and Wolff, A.},\n bibtype = {article},\n type = {article},\n year = {2012},\n key = {dblp2425367},\n id = {dblp2425367},\n biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/BuchinBBNOSW12},\n url = {http://dx.doi.org/10.1007/s00453-010-9456-3},\n journal = {Algorithmica},\n pages = {309-332},\n number = {1-2},\n volume = {62},\n text = {Algorithmica 62(1-2):309-332 (2012)}\n}","bibbaseid":"buchin-buchin-byrka-nllenburg-okamoto-silveira-wolff-drawingcompletebinarytanglegramshardnessapproximationfixedparametertractability-2012","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s00453-010-9456-3"},"downloads":0},"search_terms":["drawing","complete","binary","tanglegrams","hardness","approximation","fixed","parameter","tractability","buchin","buchin","byrka","nöllenburg","okamoto","silveira","wolff"],"keywords":[],"authorIDs":[],"dataSources":["NRwsacAxb7hy3DgsN"]}