{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:25Z","timestamp":1725543085521},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_52","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"497-506","source":"Crossref","is-referenced-by-count":3,"title":["Bimodal Crossing Minimization"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Buchheim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annette","family":"Menze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Merijam","family":"Percan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/s00453-001-0083-x","volume":"32","author":"P. Bertolazzi","year":"2002","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Quasi-upward planarity. Algorithmica\u00a032, 474\u2013506 (2002)","journal-title":"Algorithmica"},{"key":"52_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11618058_4","volume-title":"Graph Drawing","author":"C. Buchheim","year":"2006","unstructured":"Buchheim, C., Ebner, D., J\u00fcnger, M., Klau, G.W., Mutzel, P., Weiskircher, R.: Exact Crossing Minimization. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 37\u201348. Springer, Heidelberg (2006)"},{"key":"52_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-60220-8_77","volume-title":"Algorithms and Data Structures","author":"H.N. Djidjev","year":"1995","unstructured":"Djidjev, H.N.: A linear algorithm for the maximal planar subgraph problem. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol.\u00a0955, pp. 369\u2013380. Springer, Heidelberg (1995)"},{"issue":"1\u20132","key":"52_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0166-218X(00)00220-1","volume":"108","author":"L. Faria","year":"2001","unstructured":"Faria, L., de Figueiredo, C.M.H., de Mendon\u00e7a, N.C.F.X.: Splitting number is NP-complete. Discrete Applied Mathematics\u00a0108(1\u20132), 65\u201383 (2001)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"52_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(3), 312\u2013316 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"4","key":"52_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00453-004-1128-8","volume":"41","author":"C. Gutwenger","year":"2005","unstructured":"Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. Algorithmica\u00a041(4), 289\u2013308 (2005)","journal-title":"Algorithmica"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Hlin\u011bn\u00fd, P.: Crossing number is hard for cubic graphs. In: MCFS 2004, pp. 772\u2013782 (2003)","DOI":"10.1007\/978-3-540-28629-5_60"},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/43.21845","volume":"8","author":"R. Jayakumar","year":"1989","unstructured":"Jayakumar, R., Thulasiraman, K., Swamy, M.N.S.: O(n 2) algorithms for graph planarization. IEEE Transactions on Computer-Aided Design\u00a08, 257\u2013267 (1989)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"1","key":"52_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M. J\u00fcnger","year":"1996","unstructured":"J\u00fcnger, M., Mutzel, P.: Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica\u00a016(1), 33\u201359 (1996)","journal-title":"Algorithmica"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"La Poutr\u00e9, J.A.: Alpha-algorithms for incremental planarity testing. In: STOC 1994, pp. 706\u2013715 (1994)","DOI":"10.1145\/195058.195439"},{"issue":"1","key":"52_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00032","volume":"5","author":"A. Liebers","year":"2001","unstructured":"Liebers, A.: Planarizing graphs \u2013 a survey and annotated bibliography. Journal of Graph Algorithms and Applications\u00a05(1), 1\u201374 (2001)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"52_CR12","unstructured":"Menze, A.: Darstellung von Nebenmetaboliten in automatisch erzeugten Zeichnungen metabolischer Netzwerke. Master\u2019s thesis, Institute of Biochemistry, University of Cologne (June 2004)"},{"key":"52_CR13","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Crossing number of graphs with rotation systems. Technical report, Department of Computer Science, DePaul University (2005)"},{"key":"52_CR14","unstructured":"Rome library of directed graphs, http:\/\/www.inf.uniroma3.it\/people\/gdb\/wp12\/directed-acyclic-1.tar.gz"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:45Z","timestamp":1605644025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11809678_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}