{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:01:02Z","timestamp":1725897662844},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322402"},{"type":"electronic","value":"9783642322419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32241-9_28","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T15:12:12Z","timestamp":1344870732000},"page":"323-334","source":"Crossref","is-referenced-by-count":5,"title":["Outerplanar Graph Drawings with Few Slopes"],"prefix":"10.1007","author":[{"given":"Kolja","family":"Knauer","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Micek","sequence":"additional","affiliation":[]},{"given":"Bartosz","family":"Walczak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","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"},{"issue":"1","key":"28_CR2","doi-asserted-by":"crossref","first-page":"14","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. Combin.\u00a013(1), #R3, 14 (2006)","journal-title":"Electron. J. Combin."},{"issue":"1","key":"28_CR3","doi-asserted-by":"crossref","first-page":"4","DOI":"10.37236\/1139","volume":"13","author":"J. Pach","year":"2006","unstructured":"Pach, J., P\u00e1lv\u00f6lgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electron. J. Combin.\u00a013(1), #N1, 4 (2006)","journal-title":"Electron. J. Combin."},{"issue":"9","key":"28_CR4","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":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-70904-6_13","volume-title":"Graph Drawing","author":"B. Keszegh","year":"2007","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D., T\u00f3th, G.: Drawing Cubic Graphs with at Most Five Slopes. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 114\u2013125. Springer, Heidelberg (2007)"},{"key":"28_CR6","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representation of planar graphs. Acta Univ. Szeged. Sect. Sci. Math.\u00a011, 229\u2013233 (1948)","journal-title":"Acta Univ. Szeged. Sect. Sci. Math."},{"key":"28_CR7","first-page":"141","volume":"88","author":"P. Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte Verhande. S\u00e4chs. Akad. Wiss. Leipzig, Math.-Phys. Klasse\u00a088, 141\u2013164 (1936)","journal-title":"Berichte Verhande. S\u00e4chs. Akad. Wiss. Leipzig, Math.-Phys. Klasse"},{"key":"28_CR8","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresber. Deutsch. Math. Verein.\u00a046, 26\u201332 (1936)","journal-title":"Jahresber. Deutsch. Math. Verein."},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-18469-7_27","volume-title":"Graph Drawing","author":"B. Keszegh","year":"2011","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D.: Drawing Planar Graphs of Bounded Degree with Few Slopes. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 293\u2013304. Springer, Heidelberg (2011)"},{"key":"28_CR10","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":"3","key":"28_CR11","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."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32241-9_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:58:52Z","timestamp":1620129532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32241-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322402","9783642322419"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32241-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}