{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:08Z","timestamp":1725548948239},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118043"},{"type":"electronic","value":"9783642118050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11805-0_7","type":"book-chapter","created":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T02:45:33Z","timestamp":1267757133000},"page":"45-56","source":"Crossref","is-referenced-by-count":1,"title":["Planar Drawings of Higher-Genus Graphs"],"prefix":"10.1007","author":[{"given":"Christian A.","family":"Duncan","sequence":"first","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"7_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0020-0190(97)00203-2","volume":"61","author":"J. Chen","year":"1997","unstructured":"Chen, J., Kanchi, S.P., Kanevsky, A.: A note on approximating graph genus. Information Processing Letters\u00a061(6), 317\u2013322 (1997)","journal-title":"Information Processing Letters"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"7_CR3","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Planar drawings of higher-genus graphs. Technical report (August 2009), http:\/\/arxiv.org\/abs\/0908.1608"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-00219-9_9","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2009","unstructured":"Eppstein, D.: The topology of bendless three-dimensional orthogonal graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 78\u201389. Springer, Heidelberg (2009)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Erickson, J., Har-Peled, S.: Optimally cutting a surface into a disk. In: Proc. of the 18th ACM Symp. on Computational Geometry (SCG), pp. 244\u2013253 (2002)","DOI":"10.1145\/513400.513430"},{"issue":"3","key":"7_CR6","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. SIAM J. Algebraic Discrete Methods\u00a04(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"7_CR7","first-page":"259","volume":"59","author":"W. Kocay","year":"2001","unstructured":"Kocay, W., Neilson, D., Szypowski, R.: Drawing graphs on the torus. Ars Combinatoria\u00a059, 259\u2013277 (2001)","journal-title":"Ars Combinatoria"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Lazarus, F., Pocchiola, M., Vegter, G., Verroust, A.: Computing a canonical polygonal schema of an orientable triangulated surface. In: Proc. of the 17th ACM Symp. on Computational Geometry (SCG), pp. 80\u201389 (2001)","DOI":"10.1145\/378583.378630"},{"issue":"1","key":"7_CR9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s00454-001-0004-4","volume":"26","author":"K. Miura","year":"2001","unstructured":"Miura, K., Nakano, S.-I., Nishizeki, T.: Grid drawings of 4-connected plane graphs. Discrete and Computational Geometry\u00a026(1), 73\u201387 (2001)","journal-title":"Discrete and Computational Geometry"},{"key":"7_CR10","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 U. Press, Baltimore (2001)"},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/0196-6774(89)90006-0","volume":"10","author":"C. Thomassen","year":"1989","unstructured":"Thomassen, C.: The graph genus problem is NP-complete. J. Algorithms\u00a010(4), 568\u2013576 (1989)","journal-title":"J. Algorithms"},{"issue":"38","key":"7_CR12","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"W.T. Tutte","year":"1960","unstructured":"Tutte, W.T.: Convex representations of graphs. Proceedings London Mathematical Society\u00a010(38), 304\u2013320 (1960)","journal-title":"Proceedings London Mathematical Society"},{"issue":"52","key":"7_CR13","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lon. Math. Soc.\u00a013(52), 743\u2013768 (1963)","journal-title":"Proc. Lon. Math. Soc."},{"issue":"10","key":"7_CR14","doi-asserted-by":"publisher","first-page":"1847","DOI":"10.1016\/j.disc.2006.09.051","volume":"308","author":"A. Vodopivec","year":"2008","unstructured":"Vodopivec, A.: On embeddings of snarks in the torus. Discrete Mathematics\u00a0308(10), 1847\u20131849 (2008)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1137\/S0895480192242006","volume":"7","author":"A. Zitnik","year":"1994","unstructured":"Zitnik, A.: Drawing graphs on surfaces. SIAM J. Disc. Math.\u00a07(4), 593\u2013597 (1994)","journal-title":"SIAM J. Disc. Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11805-0_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T15:35:56Z","timestamp":1685460956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11805-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118043","9783642118050"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11805-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}