{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T13:26:59Z","timestamp":1758634019196},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_14","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"122-132","source":"Crossref","is-referenced-by-count":11,"title":["Really Straight Graph Drawings"],"prefix":"10.1007","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Suderman","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"14_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/jgt.3190200412","volume":"20","author":"G. Ding","year":"1995","unstructured":"Ding, G., Oporowski, B.: Some results on tree decomposition of graphs. J. Graph Theory\u00a020(4), 481\u2013499 (1995)","journal-title":"J. Graph Theory"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Suderman, M., Wood, D.R.: Really straight graph drawings. arXiv.org:cs.DM\/0405112 (2004)","DOI":"10.1007\/978-3-540-31843-9_14"},{"issue":"2","key":"14_CR4","first-page":"339","volume":"6","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci.\u00a06(2), 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"14_CR5","first-page":"340","volume-title":"Proc. 20th ACM Symp. on Computational Geometry (SoCG 2004)","author":"C.A. Duncan","year":"2004","unstructured":"Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: Proc. 20th ACM Symp. on Computational Geometry (SoCG 2004), pp. 340\u2013346. ACM Press, New York (2004)"},{"key":"14_CR6","unstructured":"Eppstein, D.: Dilation-free planar graphs (1997), http:\/\/www.ics.uci.edu\/~eppstein\/junkyard\/dilation-free\/"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Separating thickness from geometric thickness. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol.\u00a0342, pp. 75\u201386. Amer. Math. Soc. (2004)","DOI":"10.1090\/conm\/342\/06132"},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput.\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0012-365X(86)90012-9","volume":"60","author":"R.E. Jamison","year":"1986","unstructured":"Jamison, R.E.: Few slopes without collinearity. Discrete Math.\u00a060, 199\u2013206 (1986)","journal-title":"Discrete Math."},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica\u00a016(1), 4\u201332 (1996)","journal-title":"Algorithmica"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jagm.1994.1027","volume":"17","author":"S.M. Malitz","year":"1994","unstructured":"Malitz, S.M.: Graphs with E edges have pagenumber O( $\\sqrt{E}$ ). J. Algorithms\u00a017(1), 71\u201384 (1994)","journal-title":"J. Algorithms"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/S0196-6774(03)00126-3","volume":"50","author":"M..S. Rahman","year":"2004","unstructured":"Rahman, M.S., Nishizeki, T., Ghosh, S.: Rectangular drawings of planar graphs. J. Algorithms\u00a050, 62\u201378 (2004)","journal-title":"J. Algorithms"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1142\/S0218195904001433","volume":"14","author":"M. Suderman","year":"2004","unstructured":"Suderman, M.: Pathwidth and layered drawings of trees. Internat. J. Comput. Geom. Appl.\u00a014(3), 203\u2013225 (2004)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1112\/jlms\/s1-28.3.336","volume":"28","author":"P. Ungar","year":"1953","unstructured":"Ungar, P.: On diagrams representing maps. J. London Math. Soc.\u00a028, 336\u2013342 (1953)","journal-title":"J. London Math. Soc."},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1093\/comjnl\/37.2.139","volume":"37","author":"G.A. Wade","year":"1994","unstructured":"Wade, G.A., Chu, J.-H.: Drawability of complete graphs using a minimal slope set. The Computer Journal\u00a037(2), 139\u2013142 (1994)","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:28:13Z","timestamp":1605760093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}