{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T07:50:56Z","timestamp":1672559456001},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1093\/comjnl\/bxw075","type":"journal-article","created":{"date-parts":[[2016,9,12]],"date-time":"2016-09-12T20:57:54Z","timestamp":1473713874000},"page":"135-142","source":"Crossref","is-referenced-by-count":1,"title":["Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs"],"prefix":"10.1093","volume":"60","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2016,9,12]]},"reference":[{"key":"2017012305400525000_60.1.135.1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122694"},{"key":"2017012305400525000_60.1.135.2","unstructured":"Schnyder, W. (1990) Embedding Planar Graphs on the Grid. In Johnson, D.S. (ed.), Proc. First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1990), San Francisco, CA, 22\u201324 January, pp. 138\u2013148. SIAM."},{"key":"2017012305400525000_60.1.135.3","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90021-J"},{"key":"2017012305400525000_60.1.135.4","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9117-3"},{"key":"2017012305400525000_60.1.135.5","first-page":"139","article-title":"Lower bounds on the area requirements of series-parallel graphs","volume":"12","author":"Frati","year":"2010","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"2017012305400525000_60.1.135.6","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-010-9310-z"},{"key":"2017012305400525000_60.1.135.7","unstructured":"Liotta, G. (2014) Graph drawing beyond planarity: Some results and open problems. In Bistarelli, S. and Formisano, A. (eds.), Proc. 15th Italian Conf. Theoretical Computer Science (ICTCS 2014), Perugia, Italy, September 17\u201319, CEUR Workshop Proceedings, 1231, pp. 3\u20138. CEUR-WS.org."},{"key":"2017012305400525000_60.1.135.8","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.06.001"},{"key":"2017012305400525000_60.1.135.9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2013.03.001"},{"key":"2017012305400525000_60.1.135.10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759038"},{"key":"2017012305400525000_60.1.135.11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02992822"},{"key":"2017012305400525000_60.1.135.12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01196127"},{"key":"2017012305400525000_60.1.135.13","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2015.06.001"},{"key":"2017012305400525000_60.1.135.14","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00023"},{"key":"2017012305400525000_60.1.135.15","doi-asserted-by":"publisher","DOI":"10.1007\/PL00007219"},{"key":"2017012305400525000_60.1.135.16","first-page":"497","article-title":"Track layouts of graphs","volume":"6","author":"Dujmovi\u0107","year":"2004","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"2017012305400525000_60.1.135.17","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00228-4"},{"key":"2017012305400525000_60.1.135.18","first-page":"147","volume-title":"VLSI Theory, Advances in Computing Research","volume":"2","author":"Dolev","year":"1985"},{"key":"2017012305400525000_60.1.135.19","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416141"},{"key":"2017012305400525000_60.1.135.20","doi-asserted-by":"publisher","DOI":"10.1137\/130908051"},{"key":"2017012305400525000_60.1.135.21","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90077-3"},{"key":"2017012305400525000_60.1.135.22","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.11.003"},{"key":"2017012305400525000_60.1.135.23","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00075"},{"key":"2017012305400525000_60.1.135.24","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E. , Didimo, W. , Liotta, G. and Montecchiani, F. (2012) h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. In Golumbic, M. C., Stern, M., Levy, A., and Morgenstern, G. (eds.), Graph-Theoretic Concepts in Computer Science (WG 2012), Jerusalem, Israel, 26\u201328 June, Lecture Notes in Computer Science, 7551, pp. 91\u2013102. Springer-Verlag, Berlin.","DOI":"10.1007\/978-3-642-34611-8_12"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/60\/1\/135\/10329333\/bxw075.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T08:00:45Z","timestamp":1568361645000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,12]]},"references-count":24,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1,23]]},"published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1093\/comjnl\/bxw075"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw075","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,12]]}}}