{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:27:03Z","timestamp":1760441223762},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_12","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T03:02:27Z","timestamp":1395716547000},"page":"132-143","source":"Crossref","is-referenced-by-count":7,"title":["The Planar Slope Number of Subcubic Graphs"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Bar\u00e1t, J., Matousek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electr. J. Comb. 13(1) (2006)","DOI":"10.37236\/1029"},{"issue":"5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput.\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"12_CR3","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. Comput. Geom.\u00a038(3), 194\u2013212 (2007)","journal-title":"Comput. Geom."},{"issue":"5","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/0222063","volume":"22","author":"M. Formann","year":"1993","unstructured":"Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F.T., Symvonis, A., Welzl, E., Woeginger, G.J.: Drawing graphs in the plane with high resolution. SIAM J. Comput.\u00a022(5), 1035\u20131052 (1993)","journal-title":"SIAM J. Comput."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-642-11805-0_29","volume-title":"Graph Drawing","author":"V. Jel\u00ednek","year":"2010","unstructured":"Jel\u00ednek, V., Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J., Lidick\u00fd, B., Tesa\u0159, M., Vysko\u010dil, T.: The planar slope number of planar partial 3-trees of bounded degree. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 304\u2013315. Springer, Heidelberg (2010)"},{"issue":"4","key":"12_CR6","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":"12_CR7","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":"1","key":"12_CR8","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":"2","key":"12_CR9","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."},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.comgeo.2007.05.003","volume":"40","author":"B. Keszegh","year":"2008","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D., T\u00f3th, G.: Drawing cubic graphs with at most five slopes. Comput. Geom.\u00a040(2), 138\u2013147 (2008)","journal-title":"Comput. Geom."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00196","volume":"14","author":"B. Keszegh","year":"2010","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D., T\u00f3th, G.: Cubic graphs have bounded slope parameter. J. Graph Algorithms Appl.\u00a014(1), 5\u201317 (2010)","journal-title":"J. Graph Algorithms Appl."},{"key":"12_CR12","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)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-319-03841-4_36","volume-title":"Graph Drawing","author":"W. Lenhart","year":"2013","unstructured":"Lenhart, W., Liotta, G., Mondal, D., Nishat, R.: Planar and plane slope number of partial 2-trees. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 412\u2013423. Springer, Heidelberg (2013)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","first-page":"254","volume-title":"GD 2012","author":"P. Mukkamala","year":"2011","unstructured":"Mukkamala, P., P\u00e1lv\u00f6lgyi, D.: Drawing cubic graphs with the four basic slopes. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 254\u2013265. Springer, Heidelberg (2011)"},{"issue":"9","key":"12_CR15","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.comgeo.2009.01.005","volume":"42","author":"P. Mukkamala","year":"2009","unstructured":"Mukkamala, P., Szegedy, M.: Geometric representation of cubic graphs with four directions. Comput. Geom.\u00a042(9), 842\u2013851 (2009)","journal-title":"Comput. Geom."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Pach, J., P\u00e1lv\u00f6lgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electr. J. Comb.\u00a013(1) (2006)","DOI":"10.37236\/1139"},{"issue":"2","key":"12_CR17","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","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,16]],"date-time":"2020-08-16T19:14:58Z","timestamp":1597605298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}