{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:49:33Z","timestamp":1743025773448,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"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_21","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"265-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Extending Partial Orthogonal Drawings"],"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-0002-3794-4406","authenticated-orcid":false,"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7745-3935","authenticated-orcid":false,"given":"T. P.","family":"Sandhya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,14]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-319-50106-2_41","volume-title":"Graph Drawing and Network Visualization","author":"P Angelini","year":"2016","unstructured":"Angelini, P., et al.: Simultaneous orthogonal planarity. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 532\u2013545. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_41"},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"32:1","DOI":"10.1145\/2629341","volume":"11","author":"P Angelini","year":"2015","unstructured":"Angelini, P., et al.: Testing planarity of partially embedded graphs. ACM Trans. Algorithm. 11(4), 32:1\u201332:42 (2015). https:\/\/doi.org\/10.1145\/2629341","journal-title":"ACM Trans. Algorithm."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Angelini, P., Rutter, I., T.P., S.: Extending partial orthogonal drawings (2020). https:\/\/arxiv.org\/abs\/2008.10280","DOI":"10.1007\/978-3-030-68766-3_21"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.comgeo.2016.03.001","volume":"55","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Lehmann, S., Rutter, I.: Orthogonal graph drawing with inflexible edges. Comput. Geom. 55, 26\u201340 (2016). https:\/\/doi.org\/10.1016\/j.comgeo.2016.03.001","journal-title":"Comput. Geom."},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"33:1","DOI":"10.1145\/2838736","volume":"12","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Rutter, I., Wagner, D.: Optimal orthogonal graph drawing with convex bend costs. ACM Trans. Algorithm. 12(3), 33:1\u201333:32 (2016). https:\/\/doi.org\/10.1145\/2838736","journal-title":"ACM Trans. Algorithm."},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"681","DOI":"10.7155\/jgaa.00375","volume":"19","author":"TM Chan","year":"2015","unstructured":"Chan, T.M., Frati, F., Gutwenger, C., Lubiw, A., Mutzel, P., Schaefer, M.: Drawing partially embedded and simultaneously planar graphs. J. Graph Algorithm. Appl. 19(2), 681\u2013706 (2015). https:\/\/doi.org\/10.7155\/jgaa.00375","journal-title":"J. Graph Algorithm. Appl."},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-12340-0_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaplick","year":"2014","unstructured":"Chaplick, S., Dorbec, P., Kratochv\u00edl, J., Montassier, M., Stacho, J.: Contact representations of planar graphs: extending a partial representation is hard. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 139\u2013151. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12340-0_12"},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1002\/jgt.22436","volume":"91","author":"S Chaplick","year":"2019","unstructured":"Chaplick, S., Fulek, R., Klav\u00edk, P.: Extending partial representations of circle graphs. J. Graph Theory 91(4), 365\u2013394 (2019). https:\/\/doi.org\/10.1002\/jgt.22436","journal-title":"J. Graph Theory"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M de Berg","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the place. Int. J. Comput. Geom. Appl. 22(3), 187\u2013205 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"6","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G Di Battista","year":"1998","unstructured":"Di Battista, G., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM J. Comput. 27(6), 1764\u20131811 (1998). https:\/\/doi.org\/10.1137\/S0097539794262847","journal-title":"SIAM J. Comput."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-49381-6_10","volume-title":"Algorithms and Computation","author":"W Didimo","year":"1998","unstructured":"Didimo, W., Liotta, G.: Computing orthogonal drawings in a variable embedding setting. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 80\u201389. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49381-6_10"},{"key":"21_CR12","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 30th ACM-SIAM Symposium on Discrete Algorithms (SODA\u201920), pp. 806\u2013825. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.49","DOI":"10.1137\/1.9781611975994.49"},{"key":"21_CR13","unstructured":"Duncan, C.A., Goodrich, M.T.: Planar orthogonal and polyline drawing algorithms. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 223\u2013246. Chapman and Hall\/CRC (2013)"},{"key":"21_CR14","doi-asserted-by":"publisher","unstructured":"Eiben, E., Ganian, R., Hamm, T., Klute, F., N\u00f6llenburg, M.: Extending partial 1-planar drawings. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 168, pp. 43:1\u201343:19. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.43, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2020\/12450","DOI":"10.4230\/LIPIcs.ICALP.2020.43"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-11409-0_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D.: Graph-theoretic solutions to computational geometry problems. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 1\u201316. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11409-0_1"},{"key":"21_CR16","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":"2","key":"21_CR17","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."},{"issue":"4","key":"21_CR18","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.comgeo.2012.07.005","volume":"46","author":"V Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. 46(4), 466\u2013492 (2013). https:\/\/doi.org\/10.1016\/j.comgeo.2012.07.005","journal-title":"Comput. Geom."},{"issue":"4","key":"21_CR19","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/s00453-016-0133-z","volume":"77","author":"P Klav\u00edk","year":"2016","unstructured":"Klav\u00edk, P., et al.: Extending partial representations of proper and unit interval graphs. Algorithmica 77(4), 1071\u20131104 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0133-z","journal-title":"Algorithmica"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2015.02.007","volume":"576","author":"P Klav\u00edk","year":"2015","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Saitoh, T.: Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. 576, 85\u2013101 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.02.007","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"21_CR21","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s00453-016-0186-z","volume":"78","author":"P Klav\u00edk","year":"2016","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Saitoh, T., Vysko\u010dil, T.: Extending partial representations of interval graphs. Algorithmica 78(3), 945\u2013967 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0186-z","journal-title":"Algorithmica"},{"issue":"3","key":"21_CR22","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"DE Knuth","year":"1992","unstructured":"Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discret. Math. 5(3), 422\u2013427 (1992). https:\/\/doi.org\/10.1137\/0405033","journal-title":"SIAM J. Discret. Math."},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-319-68705-6_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Krawczyk","year":"2017","unstructured":"Krawczyk, T., Walczak, B.: Extending partial representations of trapezoid graphs. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 358\u2013371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_27"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs Comb. 17, 717\u2013728 (2001)","journal-title":"Graphs Comb."},{"issue":"5","key":"21_CR25","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1142\/S0129054106004261","volume":"17","author":"M Patrignani","year":"2006","unstructured":"Patrignani, M.: On extending a partial straight-line drawing. Int. J. Found. Comput. Sci. 17(5), 1061\u20131070 (2006). https:\/\/doi.org\/10.1142\/S0129054106004261","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"21_CR26","first-page":"421","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. J. Comput. 16(3), 421\u2013444 (1987)","journal-title":"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:03:26Z","timestamp":1739401406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_21","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)"}}]}}