{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:29:35Z","timestamp":1760441375357,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_10","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"123-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["1-Bend Upward Planar Drawings of SP-Digraphs"],"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","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"TC Biedl","year":"1998","unstructured":"Biedl, T.C., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.comgeo.2008.02.001","volume":"41","author":"C Binucci","year":"2008","unstructured":"Binucci, C., Didimo, W., Giordano, F.: Maximum upward planar subgraphs of embedded planar digraphs. Comput. Geom. 41(3), 230\u2013246 (2008)","journal-title":"Comput. Geom."},{"issue":"1","key":"10_CR4","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. Comb. Theory Ser. A 56(1), 96\u2013108 (1991). \n                      http:\/\/dx.doi.org\/10.1016\/0097-3165(91)90025-C","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0012-365X(90)90201-R","volume":"82","author":"J Czyzowicz","year":"1990","unstructured":"Czyzowicz, J., Pelc, A., Rival, I.: Drawing orders with few slopes. Discret. Math. 82(3), 233\u2013250 (1990). \n                      http:\/\/dx.doi.org\/10.1016\/0012-365X(90)90201-R","journal-title":"Discret. Math."},{"key":"10_CR6","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, Upper Saddle River (1999)"},{"key":"10_CR7","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: 1-Bend Upward Planar Drawings of SP-Digraphs. ArXiv e-prints abs\/1608.08425 (2016). \n                      http:\/\/arxiv.org\/abs\/1608.08425v1"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-24595-7_22","volume-title":"Graph Drawing","author":"E Di Giacomo","year":"2004","unstructured":"Di Giacomo, E.: Drawing series-parallel graphs on restricted integer 3D grids. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 238\u2013246. Springer, Heidelberg (2004). doi:\n                      10.1007\/978-3-540-24595-7_22"},{"key":"10_CR9","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 Di Giacomo","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). doi:\n                      10.1007\/978-3-642-54423-1_12"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"707","DOI":"10.7155\/jgaa.00376","volume":"19","author":"E Di Giacomo","year":"2015","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: Drawing outer 1-planar graphs with few slopes. J. Graph. Algorithms Appl. 19(2), 707\u2013741 (2015). \n                      http:\/\/dx.doi.org\/10.7155\/jgaa.00376","journal-title":"J. Graph. Algorithms Appl."},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.7155\/jgaa.00127","volume":"10","author":"W Didimo","year":"2006","unstructured":"Didimo, W.: Upward planar drawings and switch-regularity heuristics. J. Graph Algorithms Appl. 10(2), 259\u2013285 (2006)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/070696854","volume":"23","author":"W Didimo","year":"2009","unstructured":"Didimo, W., Giordano, F., Liotta, G.: Upward spirality and upward planarity testing. SIAM J. Discret. Math. 23(4), 1842\u20131899 (2009)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"10_CR13","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. 31(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10_CR14","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. Gr. Combin. 29(4), 981\u20131005 (2013)","journal-title":"Gr. Combin."},{"issue":"2","key":"10_CR15","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. Discret. Math. 27(2), 1171\u20131183 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-662-49529-2_41","volume-title":"LATIN 2016: Theoretical Informatics","author":"K Knauer","year":"2016","unstructured":"Knauer, K., Walczak, B.: Graph drawings with one bend and few slopes. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 549\u2013561. Springer, Heidelberg (2016). doi:\n                      10.1007\/978-3-662-49529-2_41"},{"issue":"5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.comgeo.2014.01.003","volume":"47","author":"KB Knauer","year":"2014","unstructured":"Knauer, K.B., Micek, P., Walczak, B.: Outerplanar graph drawings with few slopes. Comput. Geom. 47(5), 614\u2013624 (2014)","journal-title":"Comput. Geom."},{"key":"10_CR18","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). doi:\n                      10.1007\/978-3-319-03841-4_36"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discr. Comput. Geom. 1, 343\u2013353 (1986)","journal-title":"Discr. Comput. Geom."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach a visibility representation of planar graphs. Discr. Comput. Geom. 1, 321\u2013341 (1986)","journal-title":"Discr. Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:39:54Z","timestamp":1600475994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}