{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:35:28Z","timestamp":1769571328090,"version":"3.49.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030929305","type":"print"},{"value":"9783030929312","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_14","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"195-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Quasi-upward Planar Drawings with\u00a0Minimum Curve Complexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9110","authenticated-orcid":false,"given":"Carla","family":"Binucci","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9794-1928","authenticated-orcid":false,"given":"Emilio","family":"Di Giacomo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9192-2067","authenticated-orcid":false,"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G.: Planar L-drawings of bimodal graphs. CoRR arXiv:2008.07834 (2020)","DOI":"10.1007\/978-3-030-68766-3_17"},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"709","DOI":"10.7155\/jgaa.00436","volume":"21","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Kaufmann, M., Krug, R.: On the total number of bends for planar octilinear drawings. J. Graph Algorithms Appl. 21(4), 709\u2013730 (2017)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/s00453-001-0083-x","volume":"32","author":"P Bertolazzi","year":"2002","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Quasi-upward planarity. Algorithmica 32(3), 474\u2013506 (2002). https:\/\/doi.org\/10.1007\/s00453-001-0083-x","journal-title":"Algorithmica"},{"issue":"6","key":"14_CR4","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"12","author":"P Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 12(6), 476\u2013497 (1994). https:\/\/doi.org\/10.1007\/BF01188716","journal-title":"Algorithmica"},{"issue":"3","key":"14_CR5","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). https:\/\/doi.org\/10.1016\/S0925-7721(97)00026-6","journal-title":"Comput. Geom."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Binucci, C., Di Giacomo, E., Liotta, G., Tappini, A.: Quasi-upward planar drawings with minimum curve complexity. CoRR arXiv:2108.10784 (2021)","DOI":"10.1007\/978-3-030-92931-2_14"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-319-04657-0_28","volume-title":"Algorithms and Computation","author":"C Binucci","year":"2014","unstructured":"Binucci, C., Didimo, W.: Quasi-upward planar drawings of mixed graphs with few bends: heuristics and exact methods. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 298\u2013309. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04657-0_28"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/comjnl\/bxv082","volume":"59","author":"C Binucci","year":"2016","unstructured":"Binucci, C., Didimo, W.: Computing quasi-upward planar drawings of mixed graphs. Comput. J. 59(1), 133\u2013150 (2016). https:\/\/doi.org\/10.1093\/comjnl\/bxv082","journal-title":"Comput. J."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2014.01.015","volume":"526","author":"C Binucci","year":"2014","unstructured":"Binucci, C., Didimo, W., Patrignani, M.: Upward and quasi-upward planarity testing of embedded mixed graphs. Theor. Comput. Sci. 526, 75\u201389 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.01.015","journal-title":"Theor. Comput. Sci."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-30140-0_16","volume-title":"Algorithms \u2013 ESA 2004","author":"H Chan","year":"2004","unstructured":"Chan, H.: A parameterized algorithm for upward planarity testing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 157\u2013168. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_16"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.comgeo.2019.07.006","volume":"84","author":"S Chaplick","year":"2019","unstructured":"Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact drawings of 1-planar graphs with right-angle crossings and few bends. Comput. Geom. 84, 50\u201368 (2019)","journal-title":"Comput. Geom."},{"key":"14_CR12","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":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-11805-0_4","volume-title":"Graph Drawing","author":"E Di Giacomo","year":"2010","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 15\u201320. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_4"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.tcs.2020.09.027","volume":"846","author":"E Di Giacomo","year":"2020","unstructured":"Di Giacomo, E., Gasieniec, L., Liotta, G., Navarra, A.: On the curve complexity of 3-colored point-set embeddings. Theor. Comput. Sci. 846, 114\u2013140 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1007\/s00453-008-9255-2","volume":"57","author":"E Di Giacomo","year":"2010","unstructured":"Di Giacomo, E., Liotta, G., Trotta, F.: Drawing colored graphs with constrained vertex positions and few bends per edge. Algorithmica 57(4), 796\u2013818 (2010). https:\/\/doi.org\/10.1007\/s00453-008-9255-2","journal-title":"Algorithmica"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Didimo, W.: Upward graph drawing. In: Encyclopedia of Algorithms, pp. 2308\u20132312 (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_653","DOI":"10.1007\/978-1-4939-2864-4_653"},{"issue":"4","key":"14_CR17","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. Discrete Math. 23(4), 1842\u20131899 (2009). https:\/\/doi.org\/10.1137\/070696854","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Didimo, W., Liotta, G., Ortali, G., Patrignani, M.: Optimal orthogonal drawings of planar 3-graphs in linear time. In: Chawla, S. (ed.) Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, pp. 806\u2013825. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.49","DOI":"10.1137\/1.9781611975994.49"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-04414-5_34","volume-title":"Graph Drawing and Network Visualization","author":"W Didimo","year":"2018","unstructured":"Didimo, W., Liotta, G., Patrignani, M.: Bend-minimum orthogonal drawings in quadratic time. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 481\u2013494. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_34"},{"issue":"2","key":"14_CR20","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). https:\/\/doi.org\/10.1137\/S0097539794277123","journal-title":"SIAM J. Comput."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Hall, P.: On representatives of subsets. J. London Math. Soc. s1\u201310(1), 26\u201330 (1935)","DOI":"10.1112\/jlms\/s1-10.37.26"},{"issue":"5","key":"14_CR22","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1142\/S0129054106004285","volume":"17","author":"P Healy","year":"2006","unstructured":"Healy, P., Lynch, K.: Two fixed-parameter tractable algorithms for testing upward planarity. Int. J. Found. Comput. Sci. 17(5), 1095\u20131114 (2006). https:\/\/doi.org\/10.1142\/S0129054106004285","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"14_CR23","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). https:\/\/doi.org\/10.1007\/BF02086606","journal-title":"Algorithmica"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Karczmarz, A., Sankowski, P.: Min-cost flow in unit-capacity planar graphs. In: Bender, M.A., Svensson, O., Herman, G. (eds.) 27th Annual European Symposium on Algorithms, ESA 2019, LIPIcs, vol. 144, pp. 66:1\u201366:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.66","DOI":"10.4230\/LIPIcs.ESA.2019.66"},{"issue":"1","key":"14_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: few bends suffice for planar graphs. J. Graph Algorithms Appl. 6(1), 115\u2013129 (2002). https:\/\/doi.org\/10.7155\/jgaa.00046","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"14_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00547","volume":"25","author":"P Kindermann","year":"2021","unstructured":"Kindermann, P., Montecchiani, F., Schlipf, L., Schulz, A.: Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles. J. Graph Algorithms Appl. 25(1), 1\u201328 (2021). https:\/\/doi.org\/10.7155\/jgaa.00547","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"14_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.7155\/jgaa.00017","volume":"3","author":"MS Rahman","year":"1999","unstructured":"Rahman, M.S., Nakano, S., Nishizeki, T.: A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs. J. Graph Algorithms Appl. 3(4), 31\u201362 (1999). https:\/\/doi.org\/10.7155\/jgaa.00017","journal-title":"J. Graph Algorithms Appl."},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Tamassia, R., Tollis, I.G., Vitter, J.S.: Lower bounds and parallel algorithms for planar orthogonal grid drawings. In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, Dallas, Texas, USA, 2\u20135 December 1991, pp. 386\u2013393. IEEE Computer Society (1991). https:\/\/doi.org\/10.1109\/SPDP.1991.218215","DOI":"10.1109\/SPDP.1991.218215"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92931-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:54Z","timestamp":1766365314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 December 2021","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.02","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8.6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}