乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:40:36Z","timestamp":1725838836900},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272603"},{"type":"electronic","value":"9783319272610"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_6","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T06:24:59Z","timestamp":1448519099000},"page":"63-74","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Degenerate Crossing Number and Higher-Genus Embeddings"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Schaefer","sequence":"first","affiliation":[]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00454-013-9493-1","volume":"49","author":"E Ackerman","year":"2013","unstructured":"Ackerman, E., Pinchasi, R.: On the degenerate crossing number. Discrete Comput. Geom. 49(3), 695\u2013702 (2013)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/PL00009495","volume":"23","author":"G Cairns","year":"2000","unstructured":"Cairns, G., Nikolayevsky, Y.: Bounds for generalized thrackles. Discrete Comput. Geom. 23(2), 191\u2013206 (2000)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02570697","volume":"14","author":"TK Dey","year":"1995","unstructured":"Dey, T.K., Schipper, H.: A new technique to compute polygonal schema for $$2$$ -manifolds with application to null-homotopy detection. Discrete Comput. Geom. 14(1), 93\u2013110 (1995)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.7155\/jgaa.00215","volume":"15","author":"CA Duncan","year":"2011","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Planar drawings of higher-genus graphs. J. Graph Algorithms Appl. 15(1), 7\u201332 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00454-003-2948-z","volume":"31","author":"J Erickson","year":"2004","unstructured":"Erickson, J., Har-Peled, S.: Optimally cutting a surface into a disk. Discrete Comput. Geom. 31(1), 37\u201359 (2004). ACM Symposium on Computational Geometry, Barcelona 2002","journal-title":"Discrete Comput. Geom."},{"key":"6_CR6","first-page":"413","volume-title":"Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, Mich., 1984)","author":"H Harborth","year":"1985","unstructured":"Harborth, H.: Drawings of graphs and multiple crossings. In: Alavi, Y., Chartrand, G., Lick, D.R., Wall, C.E., Lesniak, L. (eds.) Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, Mich., 1984), pp. 413\u2013421. Wiley-Interscience Publication, New York (1985)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Lazarus, F., Pocchiola, M., Vegter, G., Verroust, A.: Computing a canonical polygonal schema of an orientable triangulated surface. In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry (SCG-01), pp. 80\u201389. ACM Press, New York, 3\u20135 2001","DOI":"10.1145\/378583.378630"},{"issue":"2","key":"6_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.26493\/1855-3974.21.157","volume":"2","author":"B Mohar","year":"2009","unstructured":"Mohar, B.: The genus crossing number. Ars Math. Contemp. 2(2), 157\u2013162 (2009)","journal-title":"Ars Math. Contemp."},{"key":"6_CR9","series-title":"Johns Hopkins Studies in the Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD (2001)"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/s00454-009-9141-y","volume":"41","author":"J Pach","year":"2009","unstructured":"Pach, J., T\u00f3th, G.: Degenerate crossing numbers. Discrete Comput. Geom. 41(3), 376\u2013384 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"7","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.1016\/j.ejc.2009.03.002","volume":"30","author":"MJ Pelsmajer","year":"2009","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Removing even crossings on surfaces. European J. Combin. 30(7), 1704\u20131717 (2009)","journal-title":"European J. Combin."},{"key":"6_CR12","first-page":"1","volume":"20","author":"M Schaefer","year":"2013","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb. 20, 1\u201390 (2013). Dynamic Survey, #DS21","journal-title":"Electron. J. Comb."},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1006\/jctb.1996.1721","volume":"69","author":"C Thomassen","year":"1997","unstructured":"Thomassen, C.: The genus problem for cubic graphs. J. Comb. Theory Ser. B 69(1), 52\u201358 (1997)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T23:56:35Z","timestamp":1692143795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}