{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:38:57Z","timestamp":1766378337461},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_36","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:28:55Z","timestamp":1385944135000},"page":"412-423","source":"Crossref","is-referenced-by-count":15,"title":["Planar and Plane Slope Number of Partial 2-Trees"],"prefix":"10.1007","author":[{"given":"William","family":"Lenhart","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Rahnuma Islam","family":"Nishat","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","volume-title":"Graph Drawing","author":"G. Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice- Hall, Englewood Cliffs (1999)"},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.comgeo.2006.09.002","volume":"38","author":"V. Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Computational Geometry\u00a038(3), 194\u2013212 (2007)","journal-title":"Computational Geometry"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/BFb0049393","volume-title":"Algorithms - ESA \u201994","author":"A. Garg","year":"1994","unstructured":"Garg, A., Tamassia, R.: Planar drawings and angular resolution: Algorithms and bounds. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 12\u201323. Springer, Heidelberg (1994)"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"issue":"4","key":"36_CR5","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1007\/s00373-012-1157-z","volume":"29","author":"V. Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J., Lidick\u00fd, B., Tesar, M., Vyskocil, T.: The planar slope number of planar partial 3-trees of bounded degree. Graphs and Combinatorics\u00a029(4), 981\u20131005 (2013)","journal-title":"Graphs and Combinatorics"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-56402-0_53","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Kant","year":"1993","unstructured":"Kant, G.: Hexagonal grid drawings. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol.\u00a0657, pp. 263\u2013276. Springer, Heidelberg (1993)"},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/100815001","volume":"27","author":"B. Keszegh","year":"2013","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D.: Drawing planar graphs of bounded degree with few slopes. SIAM J. Discrete Math.\u00a027(2), 1171\u20131183 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-642-32241-9_28","volume-title":"Computing and Combinatorics","author":"K. Knauer","year":"2012","unstructured":"Knauer, K., Micek, P., Walczak, B.: Outerplanar graph drawings with few slopes. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol.\u00a07434, pp. 323\u2013334. Springer, Heidelberg (2012)"},{"issue":"3","key":"36_CR9","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s10878-011-9390-6","volume":"25","author":"D. Mondal","year":"2013","unstructured":"Mondal, D., Nishat, R.I., Biswas, S., Rahman, M.S.: Minimum-segment convex drawings of 3-connected cubic plane graphs. Journal of Combinatorial Optimization\u00a025(3), 460\u2013480 (2013)","journal-title":"Journal of Combinatorial Optimization"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","first-page":"254","volume-title":"GD","author":"P. Mukkamala","year":"2011","unstructured":"Mukkamala, P., P\u00e1lv\u00f6lgyi, D.: Drawing cubic graphs with the four basic slopes. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 254\u2013265. Springer, Heidelberg (2011)"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-58950-3_355","volume-title":"Graph Drawing","author":"A. Papakostas","year":"1995","unstructured":"Papakostas, A., Tollis, I.G.: Improved algorithms and bounds for orthogonal drawings. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 40\u201351. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T21:40:05Z","timestamp":1558734005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}