{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:36:09Z","timestamp":1766378169199,"version":"3.48.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030929305"},{"type":"electronic","value":"9783030929312"}],"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_13","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"184-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["One-Bend Drawings of\u00a0Outerplanar Graphs Inside Simple Polygons"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7602-1524","authenticated-orcid":false,"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[]},{"given":"Andre","family":"L\u00f6ffler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7043-1867","authenticated-orcid":false,"given":"Lena","family":"Schlipf","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0280-741X","authenticated-orcid":false,"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"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. Algorithms 11(4), 1\u201342 (2015). https:\/\/doi.org\/10.1145\/2629341","journal-title":"ACM Trans. Algorithms"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Angelini, P., Kindermann, P., L\u00f6ffler, A., Schlipf, L., Symvonis, A.: One-bend drawings of outerplanar graphs inside simple polygons. Arxiv Report 2108.12321 (2021). https:\/\/arxiv.org\/abs\/2108.12321","DOI":"10.1007\/978-3-030-92931-2_13"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-24595-7_55","volume-title":"Graph Drawing","author":"F Brandenburg","year":"2004","unstructured":"Brandenburg, F., Eppstein, D., Goodrich, M.T., Kobourov, S., Liotta, G., Mutzel, P.: Selected open problems in graph drawing. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 515\u2013539. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_55"},{"issue":"2","key":"13_CR4","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 Algorithms Appl. 19(2), 681\u2013706 (2015). https:\/\/doi.org\/10.7155\/jgaa.00375","journal-title":"J. Graph Algorithms Appl."},{"issue":"6","key":"13_CR5","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1142\/S021819591250015X","volume":"22","author":"HR Dehkordi","year":"2012","unstructured":"Dehkordi, H.R., Eades, P.: Every outer-1-plane graph has a right angle crossing drawing. Int. J. Comput. Geom. Appl. 22(6), 543\u2013558 (2012). https:\/\/doi.org\/10.1142\/S021819591250015X","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/bf02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990). https:\/\/doi.org\/10.1007\/bf02122694","journal-title":"Combinatorica"},{"key":"13_CR7","unstructured":"Gilbers, A.: Visibility domains and complexity. Ph.D. thesis, Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn (2014)"},{"issue":"12","key":"13_CR8","doi-asserted-by":"publisher","first-page":"2368","DOI":"10.1016\/j.dam.2007.10.012","volume":"156","author":"S Hong","year":"2008","unstructured":"Hong, S., Nagamochi, H.: Convex drawings of graphs with non-convex boundary constraints. Discrete Appl. Math. 156(12), 2368\u20132380 (2008). https:\/\/doi.org\/10.1016\/j.dam.2007.10.012","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"13_CR9","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."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-04414-5_28","volume-title":"Graph Drawing and Network Visualization","author":"A Lubiw","year":"2018","unstructured":"Lubiw, A., Miltzow, T., Mondal, D.: The complexity of drawing a graph in a polygonal region. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 387\u2013401. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_28"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-015-0018-6","volume":"76","author":"T Mchedlidze","year":"2016","unstructured":"Mchedlidze, T., N\u00f6llenburg, M., Rutter, I.: Extending convex partial drawings of graphs. Algorithmica 76(1), 47\u201367 (2016)","journal-title":"Algorithmica"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-030-04414-5_30","volume-title":"Graph Drawing and Network Visualization","author":"T Mchedlidze","year":"2018","unstructured":"Mchedlidze, T., Urhausen, J.: $$\\beta $$-stars or on extending a drawing of a connected subgraph. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 416\u2013429. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_30"},{"key":"13_CR13","unstructured":"Ophelders, T., Rutter, I., Speckmann, B., Verbeek, K.: Polygon-universal graphs. In: SoCG. LIPIcs, vol. 189, pp. 55:1\u201355:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"4","key":"13_CR14","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(4), 717\u2013728 (2001). https:\/\/doi.org\/10.1007\/pl00007258","journal-title":"Graphs Comb."},{"issue":"5","key":"13_CR15","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\u20131069 (2006). https:\/\/doi.org\/10.1142\/s0129054106004261","journal-title":"Int. J. Found. Comput. Sci."},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0607016","volume":"7","author":"A Proskurowski","year":"1986","unstructured":"Proskurowski, A., Syslo, M.: Efficient vertex- and edge-coloring of outerplanar graphs. SIAM J. Algebraic Discrete Methods 7, 131\u2013136 (1986). https:\/\/doi.org\/10.1137\/0607016","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Johnson, D.S. (ed.) Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138\u2013148. Society for Industrial and Applied Mathematics (1990). https:\/\/doi.org\/10.5555\/320176.320191, http:\/\/dl.acm.org\/citation.cfm?id=320176.320191","DOI":"10.5555\/320176.320191"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. 13(1), 743\u2013767 (1963). https:\/\/doi.org\/10.1112\/plms\/s3-13.1.743","journal-title":"Proc. Lond. Math. Soc."}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:55Z","timestamp":1766365315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}]}}