{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:42Z","timestamp":1759639062178,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222023"},{"type":"electronic","value":"9783031222030"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-22203-0_31","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"432-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Outside-Obstacle Representations with\u00a0All Vertices on\u00a0the\u00a0Outer Face"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9450-7640","authenticated-orcid":false,"given":"Oksana","family":"Firman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8917-5269","authenticated-orcid":false,"given":"Jonathan","family":"Klawitter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3765","authenticated-orcid":false,"given":"Boris","family":"Klemz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1136-5673","authenticated-orcid":false,"given":"Felix","family":"Klesen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00454-009-9233-8","volume":"44","author":"H Alpert","year":"2009","unstructured":"Alpert, H., Koch, C., Laison, J.D.: Obstacle numbers of Graphs. Discrete Comput. Geom. 44(1), 223\u2013244 (2009). https:\/\/doi.org\/10.1007\/s00454-009-9233-8","journal-title":"Discrete Comput. Geom."},{"key":"31_CR2","doi-asserted-by":"publisher","unstructured":"Balko, M., Chaplick, S., Gupta, S., Hoffmann, M., Valtr, P., Wolff, A.: Bounding and computing obstacle numbers of graphs. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) Proceedings of 30th Annual European Symposium on Algorithms (ESA 2022). LIPIcs, vol. 244, pp. 11:1\u201311:13. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.11","DOI":"10.4230\/LIPIcs.ESA.2022.11"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00454-017-9919-2","volume":"59","author":"M Balko","year":"2018","unstructured":"Balko, M., Cibulka, J., Valtr, P.: Drawing graphs using a small number of obstacles. Discrete Comput. Geom. 59(1), 143\u2013164 (2018)","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.7155\/jgaa.00452","volume":"21","author":"LW Berman","year":"2017","unstructured":"Berman, L.W., Chappell, G.G., Faudree, J.R., Gimbel, J., Hartman, C., Williams, G.I.: Graphs with obstacle number greater than one. J. Graph Algorithms Appl. 21(6), 1107\u20131119 (2017). https:\/\/doi.org\/10.7155\/jgaa.00452","journal-title":"J. Graph Algorithms Appl."},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-50106-2_23","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2016","unstructured":"Chaplick, S., Lipp, F., Park, J., Wolff, A.: Obstructing visibilities with one obstacle. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 295\u2013308. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_23"},{"key":"31_CR6","doi-asserted-by":"publisher","unstructured":"Dujmovi\u0107, V., Morin, P.: On obstacle numbers. Electr. J. Combin. 22(3), 3.1\u20137 (2015). https:\/\/doi.org\/10.37236\/4373","DOI":"10.37236\/4373"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Firman, O., Kindermann, P., Klawitter, J., Klemz, B., Klesen, F., Wolff, A.: Outside-obstacle representations with all vertices on the outer face. Arxiv report (2022). http:\/\/arxiv.org\/abs\/2202.13015","DOI":"10.1007\/978-3-031-22203-0_31"},{"key":"31_CR8","unstructured":"Goldschmied, C.: 1-Hindernis-Sichtbarkeitsgraphen von kubischen Graphen. Bachelor\u2019s thesis, Institut f\u00fcr Informatik, Univ. W\u00fcrzburg (2021). http:\/\/www1.pub.informatik.uni-wuerzburg.de\/theses\/2021-goldschmied-bachelor.pdf"},{"key":"31_CR9","unstructured":"Lang, L.: Regelm\u00e4\u00dfige Au\u00dfenhindernisrepr\u00e4sentation von kleinen planaren Graphen. Bachelor\u2019s thesis, Inst. f\u00fcr Informatik, Univ. W\u00fcrzburg (2022). http:\/\/www1.pub.informatik.uni-wuerzburg.de\/theses\/2022-lang-bachelor.pdf"},{"issue":"3","key":"31_CR10","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00373-011-1027-0","volume":"27","author":"J Pach","year":"2011","unstructured":"Pach, J., Sar\u0131\u00f6z, D.: On the structure of graphs with low obstacle number. Graphs Combin. 27(3), 465\u2013473 (2011). https:\/\/doi.org\/10.1007\/s00373-011-1027-0","journal-title":"Graphs Combin."}],"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-031-22203-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:05:58Z","timestamp":1704351958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 January 2023","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":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"70","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":"25","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":"7","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":"36% - 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.01","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":"7.03","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)"}}]}}