{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:22:48Z","timestamp":1742912568080,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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"}],"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_8","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T06:24:59Z","timestamp":1448519099000},"page":"87-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Genus, Treewidth, and Local Crossing Number"],"prefix":"10.1007","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"unstructured":"Dvor\u00e1k, Z., Norin, S.: Treewidth of graphs with balanced separations. Electronic preprint arXiv:\u00a0 1408.3869 (2014)","key":"8_CR1"},{"key":"8_CR2","series-title":"London Mathematical Society Lecture Note Series","first-page":"87","volume-title":"Surveys in Combinatorics","author":"BA Reed","year":"1997","unstructured":"Reed, B.A.: Tree width and tangles: a new connectivity measure and some applications. In: Bailey, R.A. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 241, pp. 87\u2013162. Cambridge University Press, Cambridge (1997)"},{"doi-asserted-by":"crossref","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Combin. DS21 (2014)","key":"8_CR3","DOI":"10.37236\/2713"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"A Grigoriev","year":"2007","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1\u201311 (2007)","journal-title":"Algorithmica"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0021-9800(68)80063-8","volume":"4","author":"RK Guy","year":"1968","unstructured":"Guy, R.K., Jenkyns, T., Schaer, J.: The toroidal crossing number of the complete graph. J. Comb. Theor. 4, 376\u2013390 (1968)","journal-title":"J. Comb. Theor."},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","volume":"5","author":"JR Gilbert","year":"1984","unstructured":"Gilbert, J.R., Hutchinson, J.P., Tarjan, R.E.: A separator theorem for graphs of bounded genus. J. Algorithms 5(3), 391\u2013407 (1984)","journal-title":"J. Algorithms"},{"unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layered separators in minor-closed families with applications. Electronic preprint arXiv:\u00a0 1306.1595 (2013)","key":"8_CR7"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BF02086611","volume":"16","author":"F Shahrokhi","year":"1996","unstructured":"Shahrokhi, F., Sz\u00e9kely, L.A., S\u00fdkora, O., Vrt\u2019o, I.: Drawings of graphs on surfaces with few crossings. Algorithmica 16(1), 118\u2013131 (1996)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"8_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01917434","volume":"8","author":"R Halin","year":"1976","unstructured":"Halin, R.: $$S$$ -functions for graphs. J. Geometry 8(1\u20132), 171\u2013186 (1976)","journal-title":"J. Geometry"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275\u2013291 (2000)","journal-title":"Algorithmica"},{"issue":"4","key":"8_CR12","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.jctb.2008.06.004","volume":"99","author":"M Grohe","year":"2009","unstructured":"Grohe, M., Marx, D.: On tree width, bramble size, and expansion. J. Combin. Theory Ser. B 99(1), 218\u2013228 (2009)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"6","key":"8_CR14","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787\u2013832 (1999)","journal-title":"J. ACM"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T22:48:44Z","timestamp":1599864524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_8","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"}}]}}