{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:38:11Z","timestamp":1766378291559,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030687656"},{"type":"electronic","value":"9783030687663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-68766-3_17","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"205-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Planar L-Drawings of Bimodal Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7602-1524","authenticated-orcid":false,"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3501-4608","authenticated-orcid":false,"given":"Steven","family":"Chaplick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1688-394X","authenticated-orcid":false,"given":"Sabine","family":"Cornelsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-5174","authenticated-orcid":false,"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,14]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G.: Planar L-drawings of bimodal graphs. Technical report arXiv:2008.07834v1, Cornell University Library (2020)","DOI":"10.1007\/978-3-030-68766-3_17"},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1142\/S0129054118410010","volume":"29","author":"P Angelini","year":"2018","unstructured":"Angelini, P., et al.: Algorithms and bounds for L-drawings of directed graphs. Int. J. Found. Comput. Sci. 29(4), 461\u2013480 (2018). https:\/\/doi.org\/10.1142\/S0129054118410010","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-70904-6_33","volume-title":"Graph Drawing","author":"W Barth","year":"2007","unstructured":"Barth, W., Mutzel, P., Y\u0131ld\u0131z, C.: A new approximation algorithm for bend minimization in the Kandinsky model. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 343\u2013354. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_33"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Besa Vial, J.J., Da Lozzo, G., Goodrich, M.T.: Computing k-modal embeddings of planar digraphs. In: Bender, M.A., Svensson, O., Herman, G. (eds.) ESA 2019. LIPIcs, vol. 144, pp. 19:1\u201319:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.19","DOI":"10.4230\/LIPIcs.ESA.2019.19"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01762117","volume":"3","author":"J Bhasker","year":"1988","unstructured":"Bhasker, J., Sahni, S.: A linear algorithm to find a rectangular dual of a planar triangulated graph. Algorithmica 3, 247\u2013278 (1988). https:\/\/doi.org\/10.1007\/BF01762117","journal-title":"Algorithmica"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.7155\/jgaa.00396","volume":"20","author":"TC Biedl","year":"2016","unstructured":"Biedl, T.C., Derka, M.: The (3,1)-ordering for 4-connected planar triangulations. JGAA 20(2), 347\u2013362 (2016). https:\/\/doi.org\/10.7155\/jgaa.00396","journal-title":"JGAA"},{"key":"17_CR7","unstructured":"Biedl, T.C., Mondal, D.: A note on plus-contacts, rectangular duals, and box-orthogonal drawings. Technical report arXiv:1708.09560v1, Cornell University Library (2017)"},{"key":"17_CR8","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. Theoret. Comput. Sci. 526, 75\u201389 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.01.015","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-662-44777-2_14","volume-title":"Algorithms - ESA 2014","author":"T Bl\u00e4sius","year":"2014","unstructured":"Bl\u00e4sius, T., Br\u00fcckner, G., Rutter, I.: Complexity of higher-degree orthogonal graph embedding in the Kandinsky model. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 161\u2013172. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_14"},{"key":"17_CR10","unstructured":"Br\u00fcckner, G.: Higher-degree orthogonal graph drawing with flexibility constraints. Bachelor thesis, Department of Informatics, Karlsruhe Institute of Technology (2013). https:\/\/i11www.iti.kit.edu\/_media\/teaching\/theses\/ba-brueckner-13.pdf"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-319-73915-1_36","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2018","unstructured":"Chaplick, S., et al.: Planar L-drawings of directed graphs. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 465\u2013478. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_36"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: On triangle contact graphs. Comb. Probab. Comput. 3(2), 233\u2013246 (1994). https:\/\/doi.org\/10.1016\/j.comgeo.2017.11.001","DOI":"10.1016\/j.comgeo.2017.11.001"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/3-540-45848-4_11","volume-title":"Graph Drawing","author":"M Eiglsperger","year":"2002","unstructured":"Eiglsperger, M., Kaufmann, M.: Fast compaction for orthogonal drawings with vertices of prescribed size. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 124\u2013138. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45848-4_11"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing","author":"U F\u00f6\u00dfmeier","year":"1996","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 254\u2013266. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021809"},{"issue":"6","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1137\/0222072","volume":"22","author":"X He","year":"1993","unstructured":"He, X.: On finding the rectangular duals of planar triangular graphs. SIAM J. Comput. 22(6), 1218\u20131226 (1993). https:\/\/doi.org\/10.1137\/0222072","journal-title":"SIAM J. Comput."},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1142\/S0218195997000132","volume":"7","author":"G Kant","year":"1997","unstructured":"Kant, G.: A more compact visibility representation. Int. J. Comput. Geometry Appl. 7(3), 197\u2013210 (1997). https:\/\/doi.org\/10.1142\/S0218195997000132","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-57899-4_69","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G Kant","year":"1994","unstructured":"Kant, G., He, X.: Two algorithms for finding rectangular duals of planar graphs. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol. 790, pp. 396\u2013410. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57899-4_69"},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"K Ko\u017ami\u0144ski","year":"1985","unstructured":"Ko\u017ami\u0144ski, K., Kinnen, E.: Rectangular duals of planar graphs. Networks 15(2), 145\u2013157 (1985). https:\/\/doi.org\/10.1002\/net.3230150202","journal-title":"Networks"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16, 421\u2013444 (1987). https:\/\/doi.org\/10.1137\/0216030","journal-title":"SIAM J. Comput."}],"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-68766-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:03:32Z","timestamp":1739401412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 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":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2020.cs.ubc.ca\/","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":"82","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":"29","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":"9","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":"35% - 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":"3","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":"The conference was held virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}