{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:24:29Z","timestamp":1726410269298},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208310"},{"type":"electronic","value":"9783540245957"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24595-7_4","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:46:01Z","timestamp":1280378761000},"page":"37-46","source":"Crossref","is-referenced-by-count":0,"title":["Bounds and Methods for k-Planar Crossing Numbers"],"prefix":"10.1007","author":[{"given":"Farhad","family":"Shahrokhi","sequence":"first","affiliation":[]},{"given":"Ondrej","family":"S\u00fdkora","sequence":"additional","affiliation":[]},{"given":"Laszlo A.","family":"Sz\u00e9kely","sequence":"additional","affiliation":[]},{"given":"Imrich","family":"Vrt\u2019o","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01759038","volume":"6","author":"A. Aggarwal","year":"1991","unstructured":"Aggarwal, A., Klawe, M., Shor, P.: Multi-layer grid embeddings for VLSI. Algorithmica\u00a06, 129\u2013151 (1991)","journal-title":"Algorithmica"},{"key":"4_CR2","series-title":"ch. 7","first-page":"43","volume-title":"A Seminar on Graph Theory, Selected Topics in Mathematics","author":"L.W. Beineke","year":"1967","unstructured":"Beineke, L.W.: Complete bipartite graphs: Decomposition into planar subgraphs. In: Harary, F. (ed.) A Seminar on Graph Theory, Selected Topics in Mathematics. ch. 7, pp. 43\u201353. Holt, Rinehart and Winston (1967)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0898-1221(97)00214-9","volume":"34","author":"L.W. Beineke","year":"1997","unstructured":"Beineke, L.W.: Biplanar graphs: A survey. Computers and Mathematics with Applications\u00a034, 1\u20138 (1997)","journal-title":"Computers and Mathematics with Applications"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Beineke, L.W., Harary, F., Moon, J.W.: On the thickness of the complete bipartite graphs. In: Proc. of the Cambridge Philosophical Society, vol.\u00a060, pp. 1\u20135 (1964)","DOI":"10.1017\/S0305004100037385"},{"key":"4_CR5","unstructured":"Czabarka, \u00c9., S\u00fdkora, O., Sz\u00e9kely, L.A., Vr\u0165o, I.: Biplanar crossing numbers: A survey of results and problems. In: Fleiner, T., Katona, G.O.H. (eds.) Finite and Infinite Combinatorics, Akad\u00e9mia Kiad\u00f3, Budapest. Bolyai Society Mathematical Studies (to appear)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0021-9800(70)80087-4","volume":"9","author":"D.J. Kleitman","year":"1970","unstructured":"Kleitman, D.J.: The crossing number of K.,n. J. Combinatorial Theory\u00a09, 315\u2013323 (1970)","journal-title":"J. Combinatorial Theory"},{"key":"4_CR7","volume-title":"Complexity Issues in VLSI","author":"T.F. Leighton","year":"1983","unstructured":"Leighton, T.F.: Complexity Issues in VLSI. MIT Press, Cambridge (1983)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"J.A. Nash-Williams","year":"1961","unstructured":"Nash-Williams, J.A.: Edge disjoint spanning trees of finite graphs. J. London Math. Soc.\u00a036, 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TCT.1971.1083266","volume":"18","author":"A. Owens","year":"1971","unstructured":"Owens, A.: On the biplanar crossing number. IEEE Transactions on Circuit Theory\u00a018, 277\u2013280 (1971)","journal-title":"IEEE Transactions on Circuit Theory"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/(SICI)1097-0118(199601)21:1<51::AID-JGT7>3.0.CO;2-L","volume":"21","author":"R.B. Richter","year":"1996","unstructured":"Richter, R.B., \u0160ir\u00e1\u0148, J.: The crossing number of K.,n in a surface. J. Graph Theory\u00a021, 51\u201354 (1996)","journal-title":"J. Graph Theory"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<413::AID-JGT7>3.0.CO;2-S","volume":"21","author":"F. Shahrokhi","year":"1996","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vr\u0165o, I.: The book crossing number of graphs. J. Graph Theory\u00a021, 413\u2013424 (1996)","journal-title":"J. Graph Theory"},{"key":"4_CR12","unstructured":"S\u00fdkora, O., Sz\u00e9kely, L.A., Vr\u0165o, I.: Crossing numbers and biplanar crossing numbers: using the probabilistic method (submitted)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vr\u0165o, I.: Bounds for convex crossing numbers. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 487\u2013495. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-45071-8_49"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(91)90377-E","volume":"98","author":"M. Truszczy\u0144ski","year":"1991","unstructured":"Truszczy\u0144ski, M.: Decomposition of graphs into forests with bounded maximum degree. Discrete Mathematics\u00a098, 207\u2013222 (1991)","journal-title":"Discrete Mathematics"},{"key":"4_CR15","first-page":"15","volume-title":"Selected Topics in Graph Theory","author":"A.T. White","year":"1978","unstructured":"White, A.T., Beineke, L.W.: Topological graph theory. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, pp. 15\u201350. Academic Press, New York (1978)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24595-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T19:53:14Z","timestamp":1559332394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24595-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208310","9783540245957"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24595-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}