{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:49:41Z","timestamp":1742384981676},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_32","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T13:03:51Z","timestamp":1233752631000},"page":"324-335","source":"Crossref","is-referenced-by-count":9,"title":["Drawing (Complete) Binary Tanglegrams"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[]},{"given":"Maike","family":"Buchin","sequence":"additional","affiliation":[]},{"given":"Jaroslaw","family":"Byrka","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P. Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput.\u00a027(1), 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Byrka, J., N\u00f6llenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability (2008), http:\/\/arxiv.org\/abs\/0806.0920 Arxiv report","DOI":"10.1007\/978-3-642-00219-9_32"},{"key":"32_CR3","unstructured":"DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees. In: Proc. 18th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA 1997), pp. 427\u2013436 (1997)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-24595-7_31","volume-title":"Graph Drawing","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Fernau, H., Kaufmann, M.: Fixed Parameter Algorithms for one-sided crossing minimization Revisited. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 332\u2013344. Springer, Heidelberg (2004)"},{"key":"32_CR5","unstructured":"Dwyer, T., Schreiber, F.: Optimal leaf ordering for two and a half dimensional phylogenetic tree visualization. In: Proc. Australasian Sympos. Inform. Visual (InVis.au 2004). CRPIT, vol.\u00a035, pp. 109\u2013115. Australian Comput. Soc. (2004)"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"10","author":"P. Eades","year":"1994","unstructured":"Eades, P., Wormald, N.: Edge crossings in drawings of bipartite graphs. Algorithmica\u00a010, 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11590156_37","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"H. Fernau","year":"2005","unstructured":"Fernau, H., Kaufmann, M., Poths, M.: Comparing trees via crossing minimization. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 457\u2013469. Springer, Heidelberg (2005)"},{"issue":"6","key":"32_CR8","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM\u00a042(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1126\/science.8066445","volume":"265","author":"M.S. Hafner","year":"1994","unstructured":"Hafner, M.S., Sudman, P.D., Villablanca, F.X., Spradling, T.A., Demastes, J.W., Nadler, S.A.: Disparate rates of molecular evolution in cospeciating hosts and parasites. Science\u00a0265, 1087\u20131090 (1994)","journal-title":"Science"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Holten, D., van Wijk, J.J.: Visual comparison of hierarchically organized data. In: Proc. 10th Eurographics\/IEEE-VGTC Sympos. Visualization (EuroVis 2008), pp. 759\u2013766 (2008)","DOI":"10.1111\/j.1467-8659.2008.01205.x"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. 34th Annu. ACM Sympos. Theory Comput (STOC 2002), pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Khot, S., Vishnoi, N.K.: The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l 1. In: Proc. 46th Annu. IEEE Sympos. Foundat. Comput. Sci. (FOCS 2005), pp. 53\u201362 (2005)","DOI":"10.1145\/2629614"},{"key":"32_CR13","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-74126-8_10","volume-title":"Algorithms in Bioinformatics","author":"A. Lozano","year":"2007","unstructured":"Lozano, A., Pinter, R.Y., Rokhlenko, O., Valiente, G., Ziv-Ukelson, M.: Seeded tree alignment and planar tanglegram layout. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS (LNBI), vol.\u00a04645, pp. 98\u2013110. Springer, Heidelberg (2007)"},{"issue":"4","key":"32_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00454-005-1168-0","volume":"33","author":"H. Nagamochi","year":"2005","unstructured":"Nagamochi, H.: An improved bound on the one-sided minimum crossing number in two-layered drawings. Discrete Comput. Geom.\u00a033(4), 565\u2013591 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR15","unstructured":"N\u00f6llenburg, M., Holten, D., V\u00f6lker, M., Wolff, A.: Drawing binary tanglegrams: An experimental evaluation. Arxiv report (2008), http:\/\/arxiv.org\/abs\/0806.0928"},{"key":"32_CR16","unstructured":"Page, R.D.M. (ed.): Tangled Trees: Phylogeny, Cospeciation, and Coevolution. University of Chicago Press (2002)"},{"issue":"2","key":"32_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T20:06:43Z","timestamp":1558123603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}