{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:23:59Z","timestamp":1787502239171,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540369257","type":"print"},{"value":"9783540369264","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_53","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T09:41:33Z","timestamp":1155634893000},"page":"507-516","source":"Crossref","is-referenced-by-count":10,"title":["Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Buchheim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lanbo","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0166-218X(01)00314-6","volume":"122","author":"R. Cimikowski","year":"2002","unstructured":"Cimikowski, R.: Algorithms for the fixed linear crossing number problem. Disc. Appl. Math.\u00a0122, 93\u2013115 (2002)","journal-title":"Disc. Appl. Math."},{"key":"53_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications\u00a04, 235\u2013282 (1994)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"53_CR3","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/0022-0000(89)90036-6","volume":"38","author":"Z. Galil","year":"1989","unstructured":"Galil, Z., Kannan, R., Szemer\u00e9di, E.: On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines. J. Comput. System Sci.\u00a038(1), 134\u2013149 (1989)","journal-title":"J. Comput. System Sci."},{"key":"53_CR4","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 J. Alg. Disc. Meth.\u00a04, 312\u2013316 (1983)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Gilbert, R.S., Klein\u00f6der, W.K.: CNMgraf \u2013 graphic presentation services for network management. In: Proc. 9th Symposium on Data Communication, pp. 199\u2013206 (1985)","DOI":"10.1145\/318951.319049"},{"key":"53_CR6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-94-015-9634-3_24","volume-title":"Where mathematics, computer science, linguistics and biology meet","author":"T. Harju","year":"2001","unstructured":"Harju, T., Ilie, L.: Forbidden subsequences and permutations sortable on two parallel stacks. In: Where mathematics, computer science, linguistics and biology meet, pp. 267\u2013275. Kluwer, Dordrecht (2001)"},{"key":"53_CR7","volume-title":"Annotated Bibliography in Combinatorial Optimization","author":"M. Laurent","year":"1997","unstructured":"Laurent, M.: The max-cut problem. In: Dell\u2019Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliography in Combinatorial Optimization. Wiley, Chichester (1997)"},{"key":"53_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0927-0507(05)12008-8","volume-title":"Discrete Optimization","author":"M. Laurent","year":"2005","unstructured":"Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In: Discrete Optimization, pp. 393\u2013514. Elsevier, Amsterdam (2005)"},{"key":"53_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1002\/3527603794.ch4","volume-title":"New Optimization Algorithms in Physics","author":"F. Liers","year":"2004","unstructured":"Liers, F., J\u00fcnger, M., Reinelt, G., Rinaldi, G.: Computing exact ground states of hard Ising spin glass problems by branch-and-cut. In: New Optimization Algorithms in Physics, pp. 47\u201369. Wiley-VCH, Chichester (2004)"},{"issue":"1","key":"53_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/12.46286","volume":"39","author":"S. Masuda","year":"1990","unstructured":"Masuda, S., Nakajima, K., Kashiwabara, T., Fujisawa, T.: Crossing minimization in linear embeddings of graphs. IEEE Trans. Comput.\u00a039(1), 124\u2013127 (1990)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"53_CR11","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput.\u00a031(3), 762\u2013776 (2001)","journal-title":"SIAM J. Comput."},{"key":"53_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1049\/piee.1968.0004","volume":"115","author":"T.A.J. Nicholson","year":"1968","unstructured":"Nicholson, T.A.J.: Permutation procedure for minimizing the number of crossings in a network. Proc. IEEE\u00a0115, 21\u201326 (1968)","journal-title":"Proc. IEEE"},{"key":"53_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-16766-8_9","volume-title":"VLSI Algorithms and Architectures","author":"A.L. Rosenberg","year":"1986","unstructured":"Rosenberg, A.L.: DIOGENES, circa 1986. In: Makedon, F., Mehlhorn, K., Papatheodorou, T.S., Spirakis, P.G. (eds.) AWOC 1986. LNCS, vol.\u00a0227, pp. 96\u2013107. Springer, Heidelberg (1986)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:13:46Z","timestamp":1605626026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11809678_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}