{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:30:23Z","timestamp":1725489023213},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433095"},{"type":"electronic","value":"9783540458487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45848-4_8","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:47:53Z","timestamp":1186829273000},"page":"96-101","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Lower Bound for Crossing Numbers"],"prefix":"10.1007","author":[{"given":"Hristo","family":"Djidjev","sequence":"first","affiliation":[]},{"given":"Imrich","family":"Vrt\u2019o","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"8_CR1","first-page":"157","volume-title":"Graph Theory and Combinatorial Biology. Bolyai Soc. Mathematical Studies 7","author":"S.L. Bezrukov","year":"1999","unstructured":"Bezrukov, S.L.,: Edge Isoperimetric Problems on Graphs. In: Lov\u00e0sz, L., Gyarf\u00e0s, A., Katona, G.O.H., Recski, A., Sz\u00e9kely, L. (eds.): Graph Theory and Combinatorial Biology. Bolyai Soc. Mathematical Studies 7. Akad\u00e9mia Kiad\u00f3, Budapest (1999) 157\u2013197"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0012-365X(99)00162-4","volume":"213","author":"S. Bezrukov","year":"2000","unstructured":"Bezrukov, S., Chavez, J.D., Harper, L.H., R\u00f6ttger, M., Schroeder, U.-P.: The Congestion of n-Cube Layout on a Rectangular Grid. Discrete Mathematics 213 (2000) 13\u201319","journal-title":"Discrete Mathematics"},{"key":"8_CR3","unstructured":"Cimikowski, R.: Algorithms for the Fixed Linear Crossing Number Problem. Submitted to Discrete Applied Mathematics"},{"key":"8_CR4","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for Visualization of Graphs. Prentice Hall (1999)"},{"key":"8_CR5","unstructured":"Even, G., Guha, S., Schieber, B.: Improved Approximations of Crossings in Graph Drawing and VLSILa yout Area. In: 32th Annual Symposium on Theory of Computing. ACM Press (2000) 296\u2013305"},{"key":"8_CR6","first-page":"271","volume":"50","author":"L. Faria","year":"2000","unstructured":"Faria, L., Herrera de Figuerado, C.M.: On Eggleton and Guy conjectured upper bounds for the crossing number of the n-cube. Mathematica Slovaca 50 (2000) 271\u2013287","journal-title":"Mathematica Slovaca"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M. R. Garey","year":"1983","unstructured":"Garey, M. R., and Johnson, D. S.: Crossing Number is NP-complete. SIAM J. Algebraic and Discrete Methods 4 (1983) 312\u2013316","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"8_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-52921-7_83","volume-title":"Planar Separators and the Euclidean Norm","author":"H. Gazit","year":"1990","unstructured":"Gazit, H., Miller, G.L.: Planar Separators and the Euclidean Norm. In: SIGAL Intl. Symposium on Algorithms. Lecture Notes in Computer Science, Vol. 450. Springer Verlag, Berlin (1990) 338\u2013347"},{"key":"8_CR9","unstructured":"Geelen, J. F., Richter, R.B., Salazar, G.: Embedding Graphs on Surfaces. Submitted to J. Combinatorial Theory-B"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Grohe, M.: Computing Crossing Numbers in Quadratic Time. In: 33rd Annual ACM Symposium on Theory of Computing. ACM Press (2001)","DOI":"10.1145\/380752.380805"},{"key":"8_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Crossing-Critical Graphs and Path-Width","author":"P. Hlin\u011bn\u00ed","year":"2002","unstructured":"Hlin\u011bn\u00ed, P.: Crossing-Critical Graphs and Path-Width. In: 9th Intl. Symposium on Graph Drawing. Lecture Notes in Computer Science, Springer Verlag, Berlin (2001)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"142","author":"N. Kinnersley","year":"1992","unstructured":"Kinnersley, N.: The Vertex Separation Number of a Graph Equals its Path-Width. Information Processing Letters 142 (1992) 345\u2013350","journal-title":"Information Processing Letters"},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00032","volume":"5","author":"A. Liebers","year":"2001","unstructured":"Liebers, A.: Methods for Planarizing Graphs-a Survey and Annotated Bibliography. J. of Graph Algorithms and Applications 5 (2001) 1\u201374","journal-title":"J. of Graph Algorithms and Applications"},{"key":"8_CR14","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":"8_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02086610","volume":"16","author":"J. Pach","year":"1996","unstructured":"Pach, J., Shahrokhi, F., Szegedy, M.: Applications of Crossing Number. Algorithmica 16 (1996) 111\u2013117","journal-title":"Algorithmica"},{"key":"8_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Which Aestethic has the Greatest Effect on Human Understanding?","author":"H. Purchase","year":"1997","unstructured":"Purchase, H.: Which Aestethic has the Greatest Effect on Human Understanding? In: 5th Intl. Symposium on Draph Drawing. Lecture Notes in Computer Science, Vol. 1353. Springer Verlag, Berlin, (1997) 248\u2013261"},{"key":"8_CR17","first-page":"179","volume-title":"Intuitive Geometry. Bolyai Society Mathematical Studies 6","author":"F. Shahrokhi","year":"1997","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: Crossing Numbers: Bounds and Applications. In: B\u00e1r\u00e1ny, I., Boroczky, K. (eds.): Intuitive Geometry. Bolyai Society Mathematical Studies 6. Akad\u00e9mia Kiad\u00f3, Budapest (1997) 179\u2013206"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01989746","volume":"33","author":"O. S\u00fdkora","year":"1993","unstructured":"S\u00fdkora, O., Vrt\u2019o, I.: On the Crossing Number of the Hypercube and the Cube Connected Cycles. BIT 33 (1993) 232\u2013237","journal-title":"BIT"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0167-9260(94)90021-3","volume":"17","author":"O. S\u00fdkora","year":"1994","unstructured":"S\u00fdkora, O., Vrt\u2019o, I.: On VLSI Layouts of the Star Graph and Related Networks. Integration, The VLSI Journal 17 (1994) 83\u201393","journal-title":"Integration, The VLSI Journal"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1137\/S0097539796335480","volume":"29","author":"L. Wei-Liang","year":"2000","unstructured":"Wei-Liang Lin, Amir H. Farrahi, A. H., Sarrafzadeh, M.: On the Power of Logic Resynthesis. SIAM J. Computing 29 (2000) 1257\u20131289","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45848-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T07:12:46Z","timestamp":1550733166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45848-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433095","9783540458487"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45848-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}