{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:34Z","timestamp":1725664054173},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_68","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:41:07Z","timestamp":1330263667000},"page":"388-395","source":"Crossref","is-referenced-by-count":2,"title":["Improved bounds for the crossing numbers on surfaces of genus g"],"prefix":"10.1007","author":[{"given":"Faxhad","family":"Shahrokhi","sequence":"first","affiliation":[]},{"given":"Laszl\u00f3 A.","family":"Sz\u00e9kely","sequence":"additional","affiliation":[]},{"given":"Ondrej","family":"S\u00fdkora","sequence":"additional","affiliation":[]},{"given":"Imrich","family":"Vrt'o","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"33_CR1","unstructured":"Chartrand, G. and Lesniak, L., Graphs and Digraphs, Wadsworth and Books\/Cole Mathematics Series, 1986."},{"key":"33_CR2","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1080\/00029890.1973.11993230","volume":"80","author":"P. Erd\u00f6s","year":"1973","unstructured":"Erd\u00f6s, P., Guy, R.P., Crossing number problems, American Mathematical Monthly\n80 (1973), 52\u201358.","journal-title":"American Mathematical Monthly"},{"key":"33_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/jgt.3190020211","volume":"2","author":"J. L. Gross","year":"1978","unstructured":"Gross, J.L., On infinite family of octahedral crossing numbers, J. Graph Theory\n2(1978), 171\u2013178.","journal-title":"J. Graph Theory"},{"key":"33_CR4","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0021-9800(68)80063-8","volume":"4","author":"R. K. Guy","year":"1968","unstructured":"Guy, R. K., Jenkins, T., Schaer, J., The toroidal crossing number of the complete graph, J. Combinatorial Theory\n4(1968), 376\u2013390.","journal-title":"J. Combinatorial Theory"},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0021-9800(69)80084-0","volume":"6","author":"R. K. Guy","year":"1969","unstructured":"Guy, R. K., Jenkins, T., Schaer, J., The toroidal crossing number of K\nm,n, J. Combinatorial Theory\n6(1969), 235\u2013250.","journal-title":"J. Combinatorial Theory"},{"key":"33_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0095-8956(72)90042-1","volume":"12","author":"P. C. Kainen","year":"1972","unstructured":"Kainen, P. C., A lower bound for crossing number of graphs with applications to K\n\n                  n\n                , K\n\n                  p,q\n                 and Q(d), J. Combinatorial Theory (B)\n12(1972), 287\u2013298.","journal-title":"J. Combinatorial Theory (B)"},{"key":"33_CR7","volume-title":"Complexity Issues in VLSI","author":"F. T. Leighton","year":"1983","unstructured":"Leighton, F. T., Complexity Issues in VLSI, M.I.T. Press, Cambridge, 1983."},{"key":"33_CR8","volume-title":"Technical Report CRPDC-91-4","author":"F. Shahrokhi","year":"1991","unstructured":"Shahrokhi, F., and Sz\u00e9kely, L. A., An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications, Technical Report CRPDC-91-4, Dept. Computer Science, Univ. of North Texas., Denton, 1991."},{"key":"33_CR9","unstructured":"Shahrokhi, F., and Sz\u00e9kely, L. A., Effective lower bounds for crossing number, bisection width and balanced vertex separators in terms of symmetry, in: Proc. Integer Programming and Combinatorial Optimization, Proceedings of a Conference held at Carnegie Mellon University, May 25\u201327, 1992, by the Mathematical Programming Society, eds. E. Balas, G. Cournejols, R. Kannan, 102\u2013113, CMU Press, 1992."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt'o, I.: The crossing number of a graph on a compact 2-manifold, Advances in Mathematics, to appear.","DOI":"10.1006\/aima.1996.0069"},{"key":"33_CR11","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01989746","volume":"33","author":"O. S\u00fdkora","year":"1993","unstructured":"S\u00fdkora, O., Vrt'o, I., On the crossing number of hypercubes and cube connected cycles, BIT\n33(1993), 232\u2013237.","journal-title":"BIT"},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0304-3975(93)90031-N","volume":"112","author":"O. S\u00fdkora","year":"1993","unstructured":"S\u00fdkora, O., Vrt'o, I., Edge separators for graphs of bounded genus with applications, Theoretical Computer Science\n112(1993), 419\u2013429.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:40Z","timestamp":1619572180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}