{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:15Z","timestamp":1725472035952},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_37","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"419-430","source":"Crossref","is-referenced-by-count":4,"title":["Planar Crossing Numbers of Genus g Graphs"],"prefix":"10.1007","author":[{"given":"Hristo","family":"Djidjev","sequence":"first","affiliation":[]},{"given":"Imrich","family":"Vrt\u2019o","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","first-page":"9","volume-title":"Theory and Practice of Combinatorics, North Holland Mathematical Studies 60, Annals of Discrete Mathematics 12","author":"M. Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M.M., Szemer\u00e9dy, E.: Crossing-free subgraphs. In: Theory and Practice of Combinatorics, North Holland Mathematical Studies 60, Annals of Discrete Mathematics 12, pp. 9\u201312. North-Holland, Amsterdam (1982)"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"13th Intl. Symposium on Graph Drawing","author":"C. Buchheim","year":"2006","unstructured":"Buchheim, C., Ebner, D., J\u00fcnger, M., Klau, G.W., Mutzel, P., Weiskircher, R.: Exact crossing minimization. In: 13th Intl. Symposium on Graph Drawing. LNCS, Springer, Berlin (2006)"},{"key":"37_CR3","volume-title":"Graph Drawing: Algorithms for Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0166-218X(01)00314-6","volume":"122","author":"R. Cimikowski","year":"2002","unstructured":"Cimikowski, R.: Algorithms for the fixed linear crossing number problem. Discrete Applied Mathematics\u00a0122, 93\u2013115 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR5","first-page":"643","volume":"34","author":"H.N. Djidjev","year":"1981","unstructured":"Djidjev, H.N.: A separator theorem. Compt. rend. Acad. bulg. Sci.\u00a034, 643\u2013645 (1981)","journal-title":"Compt. rend. Acad. bulg. Sci."},{"issue":"1","key":"37_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s004530010031","volume":"28","author":"H.N. Djidjev","year":"2000","unstructured":"Djidjev, H.N.: Partitioning planar graphs with vertex costs: Algorithms and applications. Algorithmica\u00a028(1), 51\u201375 (2000)","journal-title":"Algorithmica"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Djidjev, H.N., Venkatesan, S.: Planarization of graphs embedded on surfaces. In: 21st International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 62\u201372 (1995)","DOI":"10.1007\/3-540-60618-1_66"},{"issue":"1","key":"37_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1137\/S0097539700373520","volume":"32","author":"G. Even","year":"2002","unstructured":"Even, G., Guha, S., Schieber, B.: Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas. SIAM J. Computing\u00a032(1), 231\u2013252 (2002)","journal-title":"SIAM J. Computing"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. Algeraic and Discrete Methods\u00a04, 312\u2013316 (1983)","journal-title":"Algeraic and Discrete Methods"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","volume":"5","author":"J.R. Gilbert","year":"1984","unstructured":"Gilbert, J.R., Hutchinson, J.P., Tarjan, R.E.: A separator theorem for graphs of bounded genus. J. Algorithms\u00a05, 391\u2013407 (1984)","journal-title":"J. Algorithms"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/jgt.20016","volume":"47","author":"L.Y. Glebsky","year":"2004","unstructured":"Glebsky, L.Y., Salazar, G.: The crossing numbert of cr(C\n                           \n                    m\n                  \u00d7C\n                           \n                    n\n                  ) is as conjectured for n\u2009\u2265\u2009m(m\u2009+\u20091). J. Graph Theory\u00a047, 53\u201372 (2004)","journal-title":"J. Graph Theory"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1007\/978-3-540-28629-5_60","volume-title":"Mathematical Foundations of Computer Science 2004","author":"P. Hlin\u011bn\u00fd","year":"2004","unstructured":"Hlin\u011bn\u00fd, P.: Crossing number is hard for cubic graphs. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 772\u2013782. Springer, Heidelberg (2004)"},{"key":"37_CR13","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":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11618058_30","volume-title":"Graph Drawing","author":"J. Pach","year":"2006","unstructured":"Pach, J., T\u00f3th, G.: Crossing number of toroidal graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 334\u2013342. Springer, Heidelberg (2006)"},{"key":"37_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 the crossing number. Algorithmica\u00a016, 111\u2013117 (1996)","journal-title":"Algorithmica"},{"key":"37_CR16","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.: Optimal VLSI Layouts of the star graph and related networks. Integration the VLSI Journal\u00a017, 83\u201394 (1994)","journal-title":"Integration the VLSI Journal"},{"key":"37_CR17","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/0304-3975(93)90031-N","volume":"112","author":"O. S\u00fdkora","year":"1993","unstructured":"S\u00fdkora, O., Vrt\u2019o, I.: Edge separators for graphs of bounded genus with applications. Theoretical Computer Science\u00a0112, 419\u2013429 (1993)","journal-title":"Theoretical Computer Science"},{"key":"37_CR18","first-page":"137","volume":"41","author":"K. Zarankievicz","year":"1954","unstructured":"Zarankievicz, K.: On a problem of P. Tur\u00e1n concerning graphs\u00a041, 137\u2013145 (1954)","journal-title":"Tur\u00e1n concerning graphs"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:49Z","timestamp":1619507989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11786986_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}