{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:18Z","timestamp":1725893958169},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_32","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:55:47Z","timestamp":1188316547000},"page":"301-310","source":"Crossref","is-referenced-by-count":2,"title":["A New Exact Algorithm for the Two-Sided Crossing Minimization Problem"],"prefix":"10.1007","author":[{"given":"Lanbo","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Buchheim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"Barahona, F., Mahjoub, A.R.: On the cut polytope. Mathematical Programming\u00a036, 157\u2013173 (1986)","journal-title":"Mathematical Programming"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Biedl, T., Brandenburg, F.J., Deng, X.: Crossings and permutations. In: Healy, P., Nikolov, N.S. (eds.) Proceedings of Graph Drawing\u00a02005, pp. 1\u201312. Limerick, Ireland (2005)","DOI":"10.1007\/11618058_1"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02115753","volume":"33","author":"E. Boros","year":"1991","unstructured":"Boros, E., Hammer, P.L.: The max-cut problems and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. Annals of Operations Research\u00a033, 151\u2013180 (1991)","journal-title":"Annals of Operations Research"},{"key":"32_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":"32_CR5","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods\u00a04, 312\u2013316 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: A cutting plane algorithm for the linear ordering problem. Operations Research\u00a032, 1195\u20131220 (1984)","journal-title":"Operations Research"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1112\/S0025579300008494","volume":"18","author":"F. Harary","year":"1971","unstructured":"Harary, F., Schwenk, A.J.: Trees with hamiltonian square. Mathematika\u00a018, 138\u2013140 (1971)","journal-title":"Mathematika"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Mutzel, P.: 2-layer straight line crossing minimization: performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications 1\u201325 (1997)","DOI":"10.7155\/jgaa.00001"},{"key":"32_CR9","unstructured":"Knuth, D.: The Stanford GraphBase: A platform for combinatorial computing (1993)"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz, X., Unger, W., Vrt\u2019o, I.: One sided crossing minimization is NP-hard for sparse graphs. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) Proceedings of Graph Drawing\u00a02001, Vienna, Austria, pp. 115\u2013123 (2001)","DOI":"10.1007\/3-540-45848-4_10"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Nagamochi, H.: An improved approximation to the one-sided bilayer drawing. In: Liotta, G. (ed.) Proceedings of Graph Drawing\u00a02003, Perugia, Italy, pp. 406\u2013418 (2003)","DOI":"10.1007\/978-3-540-24595-7_38"},{"key":"32_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1697-8","volume-title":"VLSI Placement and Global Routing using Simulated Annealing","author":"C. Sechen","year":"1988","unstructured":"Sechen, C.: VLSI Placement and Global Routing using Simulated Annealing. Kluwer Academic Publishers, Boston (1988)"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C. Simone De","year":"1990","unstructured":"De Simone, C.: The cut polytope and the boolean quadric polytope. Discrete Mathematics\u00a079, 71\u201375 (1990)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"32_CR14","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 systems. IEEE Transactions on Systems, Man, and Cybernetics (SMC)\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics (SMC)"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Yamaguchi, A., Sugimoto, A.: An approximation algorithm for the two-layered graph drawing problem. In: 5th Annual International Conference on Computing and Combinatorics, pp. 81\u201391 (1999)","DOI":"10.1007\/3-540-48686-0_8"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:16:17Z","timestamp":1605762977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}