{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:10:25Z","timestamp":1758823825981},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_49","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T04:04:43Z","timestamp":1193457883000},"page":"487-495","source":"Crossref","is-referenced-by-count":3,"title":["Bounds for Convex 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","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"S. Bhatt","year":"1984","unstructured":"S. Bhatt, and F.T. Leighton, A framework for solving VLSI layout problems, J. Comput. System Sci., 28 (1984), 300\u2013331.","journal-title":"J. Comput. System Sci."},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1002\/jgt.3190160502","volume":"16","author":"D. Bienstock","year":"1992","unstructured":"D. Bienstock, and N. Dean, New results on the rectilinear crossing number and plane embedding, J. Graph Theory, 16 (1992), 389\u2013398.","journal-title":"J. Graph Theory"},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01275667","volume":"11","author":"B. Bollob\u00e1s","year":"1991","unstructured":"B. Bollob\u00e1s, and I. Leader, Edge-isoperimetric inequalities in the grid, Combinatorica, 11 (1991), 299\u2013314.","journal-title":"Combinatorica"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"T. K. Dey","year":"1998","unstructured":"T. K. Dey, Improved bounds for planar k-sets and related problems, Discrete and Computational Geometry, 19 (1998), 373\u2013382.","journal-title":"Discrete and Computational Geometry"},{"key":"49_CR5","unstructured":"J. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing. Algorithms for the Visualization of Graphs, Prentice Hall, 1999, 432 pp."},{"key":"49_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-52921-7_83","volume-title":"Algorithms, Proc. Int. Symp. SIGAL\u2019 90","author":"H. Gazit","year":"1990","unstructured":"H. Gazit, and G. Miller, Planar separators and Euclidean norm, Algorithms, Proc. Int. Symp. SIGAL\u2019 90, LNCS 450, 1990, 338\u2013347."},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"G. Even, S. Guha, and B. Schieber, Improved approximations of crossings in graph drawings and VLSI layout areas, STOC, 2000, 296\u2013305. (Full version to appear in SICOMP.)","DOI":"10.1145\/335305.335340"},{"key":"49_CR8","first-page":"121","volume":"71","author":"P. C. Kainen","year":"1990","unstructured":"P. C. Kainen, The book thickness of a graph II, Congressus Numerantium, 71 (1990), 121\u2013132.","journal-title":"Congressus Numerantium"},{"key":"49_CR9","unstructured":"F. T. Leighton, Complexity Issues in VLSI, MIT Press, 1983."},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"6","author":"L. A. Sz\u00e9kely","year":"1998","unstructured":"L. A. Sz\u00e9kely, Crossing number problems and hard Erd\u0151s problems in discrete geometry, Combinatorics, Probability, and Computing, 6 (1998), 353\u2013358.","journal-title":"Combinatorics, Probability, and Computing"},{"key":"49_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J. Pach","year":"1995","unstructured":"J. Pach, and P. K. Agarwal, Combinatorial Geometry, Wiley & Sons, NY, 1995."},{"key":"49_CR12","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/s4540010011","volume":"24","author":"J. Pach","year":"2000","unstructured":"J. Pach, J. Spencer, and G. T\u00f3th, New bounds for crossing numbers, Discrete and Computational Geometry, 24 (2000), 623\u2013644.","journal-title":"Discrete and Computational Geometry"},{"key":"49_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Proc. Symposium on Graph Drawing, GD\u201997","author":"H. Purchase","year":"1997","unstructured":"H. Purchase, Which aesthetic has the greatest effect on human understanding?, in: Proc. Symposium on Graph Drawing, GD\u201997, Lecture Notes in Computer Science 1353 (Springer, 1997), 248\u2013261."},{"key":"49_CR14","first-page":"179","volume-title":"Intuitive Geometry, Bolyai Society Mathematical Studies","author":"F. Shahrokhi","year":"1997","unstructured":"F. Shahrokhi, O. S\u00fdkora, L. A. Sz\u00e9kely, and I. Vrt\u2019o, Crossing numbers: bounds and applications, in: Intuitive Geometry, Bolyai Society Mathematical Studies 6, (I. B\u00e1r\u00e1ny and K. B\u00f6r\u00f6czky, eds.), Akad\u00e9mia Kiad\u00f3, Budapest, 1997, 179\u2013206."},{"key":"49_CR15","doi-asserted-by":"publisher","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":"F. Shahrokhi, O. S\u00fdkora, L. A. Sz\u00e9kely, and I. Vrt\u2019o, The book crossing number of graphs, J. Graph Theory, 21 (1996), 413\u2013424.","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:09:17Z","timestamp":1556921357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_49","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}