{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T06:52:38Z","timestamp":1770533558170,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642112683","type":"print"},{"value":"9783642112690","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11269-0_3","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T08:36:15Z","timestamp":1259656575000},"page":"38-49","source":"Crossref","is-referenced-by-count":15,"title":["A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"B\u00f6cker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falk","family":"H\u00fcffner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anke","family":"Truss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus","family":"Wahlstr\u00f6m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"LNBI","first-page":"114","volume-title":"BICoB\u00a02009","author":"M.S. Bansal","year":"2009","unstructured":"Bansal, M.S., Chang, W.-C., Eulenstein, O., Fern\u00e1ndez-Baca, D.: Generalized binary tanglegrams: Algorithms and applications. In: Rajasekaran, S. (ed.) BICoB\u00a02009. LNCS (LNBI), vol.\u00a05462, pp. 114\u2013125. Springer, Heidelberg (2009)"},{"key":"3_CR2","unstructured":"Baumann, F., Buchheim, C., Liers, F.: Exact crossing minimization in general tanglegrams. Technical Report zaik2009-581, Zentrum f\u00fcr Angewandte Informatik K\u00f6ln (Mar 2009)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-00219-9_32","volume-title":"Graph Drawing","author":"K. Buchin","year":"2009","unstructured":"Buchin, K., Buchin, M., Byrka, J., N\u00f6llenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (complete) binary tanglegrams. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 324\u2013335. Springer, Heidelberg (2009)"},{"key":"3_CR4","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: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 457\u2013469. Springer, Heidelberg (2005)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/800061.808753","volume-title":"Proc. of ACM Symposium on Theory of Computing (STOC 1983)","author":"H.N. Gabow","year":"1983","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. In: Proc. of ACM Symposium on Theory of Computing (STOC 1983), pp. 246\u2013251. ACM Press, New York (1983)"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0167-6377(81)90020-1","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Pulleyblank, W.R.: Weakly bipartite graphs and the max-cut problem. Oper. Res. Lett.\u00a01(1), 23\u201327 (1981)","journal-title":"Oper. Res. Lett."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-72845-0_23","volume-title":"Experimental Algorithms","author":"F. H\u00fcffner","year":"2007","unstructured":"H\u00fcffner, F., Betzler, N., Niedermeier, R.: Optimal edge deletions for signed graph balancing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 297\u2013310. Springer, Heidelberg (2007)"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1137\/1.9781611972894.11","volume-title":"Proc. of Workshop on Algorithm Engineering and Experiments (ALENEX 2009)","author":"M. N\u00f6llenburg","year":"2009","unstructured":"N\u00f6llenburg, M., Holten, D., V\u00f6lker, M., Wolff, A.: Drawing binary tanglegrams: An experimental evaluation. In: Proc. of Workshop on Algorithm Engineering and Experiments (ALENEX 2009), pp. 106\u2013119. SIAM, Philadelphia (2009)"},{"key":"3_CR9","volume-title":"Tangled Trees: Phylogeny, Cospeciation, and Coevolution","year":"2002","unstructured":"Page, R.D.M. (ed.): Tangled Trees: Phylogeny, Cospeciation, and Coevolution. University of Chicago Press, Chicago (2002)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11269-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T20:26:40Z","timestamp":1676060800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11269-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642112683","9783642112690"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11269-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}