{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:09:17Z","timestamp":1725455357402},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540607236"},{"type":"electronic","value":"9783540493518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0021830","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:56:38Z","timestamp":1131846998000},"page":"463-471","source":"Crossref","is-referenced-by-count":0,"title":["Crossing numbers of meshes"],"prefix":"10.1007","author":[{"given":"Farhad","family":"Shahrokhi","sequence":"first","affiliation":[]},{"given":"Ondrej","family":"S\u00fdkora","sequence":"additional","affiliation":[]},{"given":"L\u00e1szl\u00f3 A.","family":"Sz\u00e9kely","sequence":"additional","affiliation":[]},{"given":"Imrich","family":"Vrt'o","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/jgt.3190040203","volume":"4","author":"L. W. Beineke","year":"1980","unstructured":"L. W. Beineke, R. D. Ringeisen, On the crossing number of product of cycles and graphs of order four, J. Graph Theory 4 (1980), 145\u2013155.","journal-title":"J. Graph Theory"},{"key":"47_CR2","volume-title":"Combinatorial Theory","author":"M. Hall Jr.","year":"1967","unstructured":"M. Hall, Jr., Combinatorial Theory, Blaisdell Publ. Co., Waltham, 1967."},{"key":"47_CR3","first-page":"58","volume":"6","author":"F. Harary","year":"1973","unstructured":"F. Harary, P. C. Kainen, A. Schwenk, Toroidal graphs with arbitrary high crossing numbers, Nanta Mathematica 6 (1973), 58\u201367.","journal-title":"Nanta Mathematica"},{"key":"47_CR4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.21136\/CPM.1982.118128","volume":"107","author":"S. Jendrol'","year":"1982","unstructured":"S. Jendrol', M. \u0160\u010derbov\u00e1, On the crossing numbers of S m \u00d7 Pn and S m \u00d7 Cn, \u010casopis pro Pestov\u00e1n\u00ed Matematiky 107 (1982), 225\u2013230.","journal-title":"\u010casopis pro Pestov\u00e1n\u00ed Matematiky"},{"key":"47_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0095-8956(72)90042-1","volume":"12","author":"P. C. Kainen","year":"1972","unstructured":"P. C. Kainen, A lower bound for crossing number of graphs with applications to K n, Kp,q, and Q(d), J. Combinatorial Theory, Series B 12 (1972), 287\u2013298.","journal-title":"J. Combinatorial Theory, Series B"},{"key":"47_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0021-9800(70)80087-4","volume":"9","author":"D. J. Kleitman","year":"1970","unstructured":"D. J. Kleitman, The crossing number of K 5,n, J. Combinatorial Theory 9 (1970), 315\u2013323.","journal-title":"J. Combinatorial Theory"},{"key":"47_CR7","first-page":"113","volume":"41","author":"M. Kle\u0161\u010d","year":"1991","unstructured":"M. Kle\u0161\u010d, On the crossing number of the cartesian product of stars and paths or cycles, Mathematica Slovaca 41 (1991), 113\u2013120.","journal-title":"Mathematica Slovaca"},{"key":"47_CR8","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1002\/jgt.3190180608","volume":"18","author":"M. Kle\u0161\u010d","year":"1994","unstructured":"M. Kle\u0161\u010d, The crossing number of product of path and stars with 4-vertex graphs, J. Graph Theory 18 (1994), 605\u2013614.","journal-title":"J. Graph Theory"},{"key":"47_CR9","unstructured":"M. Kle\u0161\u010d, On the crossing numbers of products of cycles, preprint."},{"key":"47_CR10","unstructured":"D. Larman, J. Matou\u0161ek, J. Pach, J. T\u00f6r\u00f6csik, A Ramsey-type result for planar convex sets, to appear."},{"key":"47_CR11","volume-title":"Complexity Issues in VLSI","author":"F. T. Leighton","year":"1983","unstructured":"F. T. Leighton, Complexity Issues in VLSI, MIT Press, Cambridge, 1983."},{"key":"47_CR12","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays.Trees.Hypercubes","author":"F. T. Leighton","year":"1992","unstructured":"F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays.Trees.Hypercubes, Morgan Kaufmann, San Mateo, 1992."},{"key":"47_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02574361","volume":"21","author":"J. Pach","year":"1994","unstructured":"J. Pach, J. T\u00f6r\u00f6csik, Some geometric applications of Dilworth' theorem, Discrete Computational Geometry, 21(1994), 1\u20137.","journal-title":"Discrete Computational Geometry"},{"key":"47_CR14","unstructured":"R. B. Richter, I. Stobert, The crossing number of C5\u00d7Cn, preprint."},{"key":"47_CR15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF02574034","volume":"13","author":"R. B. Richter","year":"1995","unstructured":"R. B. Richter, C. Thomassen, Intersection of curve systems and the crossing number of C 5\u00d7C5, Discrete and Computational Geometry 13 (1995), 149\u2013159.","journal-title":"Discrete and Computational Geometry"},{"key":"47_CR16","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0095-8956(78)90014-X","volume":"24","author":"R. D. Ringeisen","year":"1978","unstructured":"R. D. Ringeisen, L. W. Beineke, The crossing number of C 3 \u00d7 Cn, J. Combinatorial Theory, Series B 24 (1978), 134\u2013144.","journal-title":"J. Combinatorial Theory, Series B"},{"key":"47_CR17","volume-title":"Technical Report CRPDC-91-4","author":"F. Shahrokhi","year":"1991","unstructured":"F. Shahrokhi, L. A. Sz\u00e9kely, An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications, Technical Report CRPDC-91-4, Department of Computer Science, University of North Texas, Denton, 1991."},{"key":"47_CR18","doi-asserted-by":"crossref","unstructured":"F. Shahrokhi, L. A. Sz\u00e9kely, Effective lower bounds for crossing number, bisection width and balanced vertex separators in terms of symmetry, in: Proc. 2-nd IPCO Conference, Pittsburgh, 1992, 102\u2013113, also in Combinatorics, Probability and Computing 3 (1994), 523\u2013543.","DOI":"10.1017\/S0963548300001383"},{"key":"47_CR19","first-page":"131","volume-title":"Lecture Notes in Computer Science 894","author":"F. Shahrokhi","year":"1995","unstructured":"F. Shahrokhi, L. A. Sz\u00e9kely, I. Vrt'o, Crossing numbers of graphs, lower bound techniques and algorithms: a survey, in: Proc. DIMACS Workshop on Graph Drawing'94, Lecture Notes in Computer Science 894, Springer Verlag, Berlin, 1995, 131\u2013142."},{"key":"47_CR20","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01989746","volume":"33","author":"O. S\u00fdkora","year":"1993","unstructured":"O. S\u00fdkora and I. Vrt'o, On the crossing number of hypercubes and cube connected cycles, BIT 33 (1993), 232\u2013237.","journal-title":"BIT"},{"key":"47_CR21","first-page":"15","volume-title":"Selected Topics in Graph Theory","author":"A. T. White","year":"1978","unstructured":"A. T. White, L. W. Beineke, Topological graph theory, in: Selected Topics in Graph Theory, (L.W. Beineke R.J. Wilson, eds.), Academic Press, N.Y., 1978, 15\u201350."},{"key":"47_CR22","unstructured":"K. Wada, K. Kawaguchi, H. Suzuki, Optimal bounds of the crossing number and the bisection width for generalized hypercube graphs, in: Proc. 16th Biennial Symposium on Communications, 1992, 323\u2013326."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0021830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T12:19:23Z","timestamp":1626697163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0021830"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540607236","9783540493518"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0021830","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}