{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T05:12:59Z","timestamp":1770527579014,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131929","type":"print"},{"value":"9783642131936","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_11","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"118-128","source":"Crossref","is-referenced-by-count":5,"title":["Exact Bipartite Crossing Minimization under Tree Constraints"],"prefix":"10.1007","author":[{"given":"Frank","family":"Baumann","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Buchheim","sequence":"additional","affiliation":[]},{"given":"Frauke","family":"Liers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"B\u00f6cker, S., H\u00fcffner, F., Truss, A., Wahlstr\u00f6m, M.: A faster fixed-parameter approach to drawing binary tanglegrams. In: Proc. of International Workshop on Parameterized and Exact Computation, IWPEC 2009 (2009) (to appear)","DOI":"10.1007\/978-3-642-11269-0_3"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Buchheim, C., Wiegele, A., Zheng, L.: Exact algorithms for the quadratic linear ordering problem. INFORMS J. on Computing (to appear)","DOI":"10.1287\/ijoc.1090.0318"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C. Simone De","year":"1989","unstructured":"De Simone, C.: The cut polytope and the boolean quadric polytope. Discrete Mathematics\u00a079, 71\u201375 (1989)","journal-title":"Discrete Mathematics"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P. Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawing bipartite graphs. Algorithmica\u00a011, 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Fernau, H., Kaufmann, M., Poths, M.: Comparing trees via crossing minimization. J. of Computer and System Sciences (2009) (in press)","DOI":"10.1016\/j.jcss.2009.10.014"},{"key":"11_CR6","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":"11_CR7","unstructured":"Holten, D.: Personal communication (2009)"},{"key":"11_CR8","unstructured":"ILOG, Inc. ILOG CPLEX 11.2 (2007), http:\/\/www.ilog.com\/products\/cplex"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M. J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Mutzel, P.: 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. J. Graph Algorithms Appl.\u00a01, 1\u201325 (1997)","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR10","first-page":"106","volume-title":"Proc. of the Workshop on Algorithm Engineering and Experiments, ALENEX 2009","author":"M. N\u00f6llenburg","year":"2009","unstructured":"N\u00f6llenburg, M., V\u00f6lker, M., Wolff, A., Holten, D.: Drawing binary tanglegrams: An experimental evaluation. In: Proc. of the Workshop on Algorithm Engineering and Experiments, ALENEX 2009, pp. 106\u2013119. SIAM, Philadelphia (2009)"},{"key":"11_CR11","volume-title":"Tangled Trees: Phylogeny, Cospeciation, and Coevolution","author":"R.D.M. Page","year":"2002","unstructured":"Page, R.D.M.: Tangled Trees: Phylogeny, Cospeciation, and Coevolution. University of Chicago Press, Chicago (2002)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-540-72792-7_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"F. Rendl","year":"2007","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: A branch and bound algorithm for max-cut based on combining semidefinite and polyhedral relaxations. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 295\u2013309. Springer, Heidelberg (2007)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Venkatachalam, B., Apple, J., St. John, K., Gusfield, D.: Untangling tanglegrams: Comparing trees by their drawings. In: M\u0103ndoiu, I., Narasimhan, G., Zhang, Y. (eds.) ISBRA 2009. LNCS, vol.\u00a05542, pp. 88\u201399. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-01551-9_10"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:31Z","timestamp":1606186951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}