{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:28:46Z","timestamp":1760441326066},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_41","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"549-561","source":"Crossref","is-referenced-by-count":5,"title":["Graph Drawings with One Bend and Few Slopes"],"prefix":"10.1007","author":[{"given":"Kolja","family":"Knauer","sequence":"first","affiliation":[]},{"given":"Bartosz","family":"Walczak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Bar\u00e1t, J., Matou\u0161ek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electron. J. Combin. 13(1), #R3, 14 pp. (2006)","DOI":"10.37236\/1029"},{"issue":"3","key":"41_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T Biedl","year":"1994","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159\u2013180 (1994)","journal-title":"Comput. Geom."},{"issue":"1","key":"41_CR3","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0097-3165(91)90025-C","volume":"56","author":"J Czyzowicz","year":"1991","unstructured":"Czyzowicz, J.: Lattice diagrams with few slopes. J. Combin. Theory, Ser. A 56(1), 96\u2013108 (1991)","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"2","key":"41_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00383762","volume":"7","author":"J Czyzowicz","year":"1990","unstructured":"Czyzowicz, J., Pelc, A., Rival, I., Urrutia, J.: Crooked diagrams with few slopes. Order 7(2), 133\u2013143 (1990)","journal-title":"Order"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-54423-1_12","volume-title":"LATIN 2014: Theoretical Informatics","author":"E Giacomo Di","year":"2014","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: The planar slope number of subcubic graphs. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 132\u2013143. Springer, Heidelberg (2014)"},{"issue":"3","key":"41_CR6","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. 38(3), 194\u2013212 (2007)","journal-title":"Comput. Geom."},{"issue":"3","key":"41_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.comgeo.2006.08.002","volume":"38","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Suderman, M., Wood, D.R.: Graph drawings with few slopes. Comput. Geom. 38(3), 181\u2013193 (2007)","journal-title":"Comput. Geom."},{"issue":"2","key":"41_CR8","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. 6(2), 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"3","key":"41_CR9","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.comgeo.2013.03.002","volume":"47","author":"S Felsner","year":"2014","unstructured":"Felsner, S., Kaufmann, M., Valtr, P.: Bend-optimal orthogonal graph drawing in the general position model. Comput. Geom. 47(3), 460\u2013468 (2014)","journal-title":"Comput. Geom."},{"issue":"3\u20134","key":"41_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF02574056","volume":"13","author":"H Fraysseix de","year":"1995","unstructured":"de Fraysseix, H., de Mendez, P.O., Pach, J.: A left-first search algorithm for planar graphs. Discrete Comput. Geom. 13(3\u20134), 459\u2013468 (1995)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"41_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Combin. Prob. Comput. 3(2), 233\u2013246 (1994)","journal-title":"Combin. Prob. Comput."},{"issue":"4","key":"41_CR12","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., Tesa\u0159, M., Vysko\u010dil, T.: The planar slope number of planar partial $$3$$ 3 -trees of bounded degree. Graphs Combin. 29(4), 981\u20131005 (2013)","journal-title":"Graphs Combin."},{"issue":"1","key":"41_CR13","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 16(1), 4\u201332 (1996)","journal-title":"Algorithmica"},{"issue":"2","key":"41_CR14","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. 27(2), 1171\u20131183 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"41_CR15","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. 40(2), 138\u2013147 (2008)","journal-title":"Comput. Geom."},{"issue":"5","key":"41_CR16","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.comgeo.2014.01.003","volume":"47","author":"K Knauer","year":"2014","unstructured":"Knauer, K., Micek, P., Walczak, B.: Outerplanar graph drawings with few slopes. Comput. Geom. 47(5), 614\u2013624 (2014)","journal-title":"Comput. Geom."},{"key":"41_CR17","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.I.: Planar and plane slope number of partial 2-trees. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 412\u2013423. Springer, Heidelberg (2013)"},{"issue":"1\u20133","key":"41_CR18","first-page":"69","volume":"81","author":"Y Liu","year":"1998","unstructured":"Liu, Y., Morgana, A., Simeone, B.: A linear algorithm for $$2$$ 2 -bend embeddings of planar graphs in the two-dimensional grid. Discrete Appl. Math. 81(1\u20133), 69\u201391 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"41_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(92)90041-S","volume":"41","author":"J Misra","year":"1992","unstructured":"Misra, J., Gries, D.: A constructive proof of Vizing\u2019s theorem. Inform. Process. Lett. 41(3), 131\u2013133 (1992)","journal-title":"Inform. Process. Lett."},{"key":"41_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-25878-7_25","volume-title":"Graph Drawing","author":"P Mukkamala","year":"2012","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. 7034, pp. 254\u2013265. Springer, Heidelberg (2012)"},{"issue":"9","key":"41_CR21","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. 42(9), 842\u2013851 (2009)","journal-title":"Comput. Geom."},{"key":"41_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-540-27798-9_33","volume-title":"Computing and Combinatorics","author":"K Nomura","year":"2004","unstructured":"Nomura, K., Tayu, S., Ueno, S.: On the orthogonal drawing of outerplanar graphs. In: Chwa, K.-Y., Munro, J.I. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 300\u2013308. Springer, Heidelberg (2004)"},{"key":"41_CR23","doi-asserted-by":"crossref","unstructured":"Pach, J., P\u00e1lv\u00f6lgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electron. J. Combin. 13(1), #N1, 4 pp. (2006)","DOI":"10.37236\/1139"},{"key":"41_CR24","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: Ob otsenke khromaticheskogo klassa $$p$$ p -grafa (On an estimate of the chromatic class of a $$p$$ p -graph). Diskret. Analiz 3, 25\u201330 (1964)","journal-title":"Diskret. Analiz"},{"issue":"2","key":"41_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1093\/comjnl\/37.2.139","volume":"37","author":"GA Wade","year":"1994","unstructured":"Wade, G.A., Chu, J.H.: Drawability of complete graphs using a minimal slope set. Comput. J. 37(2), 139\u2013142 (1994)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T12:47:33Z","timestamp":1600346853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}