{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:00:20Z","timestamp":1743112820212,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030392185"},{"type":"electronic","value":"9783030392192"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-39219-2_36","type":"book-chapter","created":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:09:24Z","timestamp":1579910964000},"page":"453-462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Planar Projections of Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6590-7952","authenticated-orcid":false,"given":"N. R.","family":"Aravind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udit","family":"Maniyar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,24]]},"reference":[{"issue":"3","key":"36_CR1","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02783300","volume":"62","author":"N Alon","year":"1988","unstructured":"Alon, N.: The linear arboricity of graphs. Isr. J. Math. 62(3), 311\u2013325 (1988)","journal-title":"Isr. J. Math."},{"issue":"1","key":"36_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.37236\/1029","volume":"13","author":"J Bar\u00e1t","year":"2006","unstructured":"Bar\u00e1t, J., Matou\u0161ek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electron. J. Comb. 13(1), 3 (2006)","journal-title":"Electron. J. Comb."},{"key":"36_CR3","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Handbook on Graph Drawing and Visualization, pp. 349\u2013381. Chapman and Hall\/CRC (2013)"},{"issue":"3","key":"36_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00023","volume":"4","author":"MB Dillencourt","year":"2000","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. J. Graph Algorithms Appl. 4(3), 5\u201317 (2000)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"36_CR5","first-page":"339","volume":"6","author":"V Dujmovic","year":"2004","unstructured":"Dujmovic, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci. 6(2), 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1","key":"36_CR6","first-page":"155","volume":"7","author":"V Dujmovic","year":"2005","unstructured":"Dujmovic, V., Wood, D.R.: Stacks, queues and tracks: layouts of graph subdivisions. Discrete. Math. Theor. Comput. Sci. 7(1), 155\u2013202 (2005)","journal-title":"Discrete . Math. Theor. Comput. Sci."},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.comgeo.2010.09.005","volume":"44","author":"CA Duncan","year":"2011","unstructured":"Duncan, C.A.: On graph thickness, geometric thickness, and separator theorems. Comput. Geom. 44(2), 95\u201399 (2011)","journal-title":"Comput. Geom."},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, 8\u201311 June 2004, pp. 340\u2013346 (2004)","DOI":"10.1145\/997817.997868"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2016.03.003","volume":"56","author":"S Durocher","year":"2016","unstructured":"Durocher, S., Gethner, E., Mondal, D.: Thickness and colorability of geometric graphs. Comput. Geom. 56, 1\u201318 (2016)","journal-title":"Comput. Geom."},{"issue":"2","key":"36_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190080211","volume":"8","author":"H Enomoto","year":"1984","unstructured":"Enomoto, H., P\u00e9roche, B.: The linear arboricity of some regular graphs. J. Graph Theory 8(2), 309\u2013324 (1984)","journal-title":"J. Graph Theory"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-70904-6_35","volume-title":"Graph Drawing","author":"A Estrella-Balderrama","year":"2007","unstructured":"Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: Characterization of unlabeled level planar trees. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 367\u2013379. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_35"},{"issue":"11","key":"36_CR12","doi-asserted-by":"publisher","first-page":"3694","DOI":"10.1016\/j.disc.2008.01.041","volume":"309","author":"D Gon\u00e7alves","year":"2009","unstructured":"Gon\u00e7alves, D., Ochem, P.: On star and caterpillar arboricity. Discrete Math. 309(11), 3694\u20133702 (2009)","journal-title":"Discrete Math."},{"issue":"3","key":"36_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0255(91)90052-V","volume":"54","author":"JH Halton","year":"1991","unstructured":"Halton, J.H.: On the thickness of graphs of given degree. Inf. Sci. 54(3), 219\u2013238 (1991)","journal-title":"Inf. Sci."},{"issue":"3","key":"36_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0925-7721(99)00018-8","volume":"13","author":"JP Hutchinson","year":"1999","unstructured":"Hutchinson, J.P., Shermer, T.C., Vince, A.: On representations of some thickness-two graphs. Comput. Geom. 13(3), 161\u2013171 (1999)","journal-title":"Comput. Geom."},{"key":"36_CR15","unstructured":"Malviya, P.: Graph visualization. Master\u2019s thesis, Indian Institute of Technology Hyderabad (2016)"},{"issue":"1","key":"36_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/PL00007219","volume":"14","author":"P Mutzel","year":"1998","unstructured":"Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: a survey. Graphs Comb. 14(1), 59\u201373 (1998)","journal-title":"Graphs Comb."},{"key":"36_CR17","unstructured":"Ollmann, T.: On the book thickness of various graphs. In: Proceedings of the 4th SouthEastern Conference on Combinatorics, Graph Theory and Computing, vol. VIII, p. 459 (1973)"},{"key":"36_CR18","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/S1385-7258(63)50055-9","volume":"25","author":"W Tutte","year":"1963","unstructured":"Tutte, W.: The thickness of a graph. Indag. Math. 25, 567\u2013577 (1963)","journal-title":"Indag. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39219-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T17:26:48Z","timestamp":1695662808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39219-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030392185","9783030392192"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39219-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iith.ac.in\/~caldam2020\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}