{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T06:50:22Z","timestamp":1769583022296,"version":"3.49.0"},"publisher-location":"Cham","reference-count":14,"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_22","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"304-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Unit Disk Representations of\u00a0Embedded Trees, Outerplanar and\u00a0Multi-legged Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0104-1659","authenticated-orcid":false,"given":"Sujoy","family":"Bhore","sequence":"first","affiliation":[]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5161-3841","authenticated-orcid":false,"given":"Soeren","family":"Nickel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Bhore, S., L\u00f6ffler, M., Nickel, S., N\u00f6llenburg, M.: Unit disk representations of embedded trees, outerplanar and multi-legged graphs. CoRR abs\/2103.08416 (2021). https:\/\/arxiv.org\/abs\/2103.08416","DOI":"10.1007\/978-3-030-92931-2_22"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-319-27261-0_37","volume-title":"Graph Drawing and Network Visualization","author":"C Bowen","year":"2015","unstructured":"Bowen, C., Durocher, S., L\u00f6ffler, M., Rounds, A., Schulz, A., T\u00f3th, C.D.: Realization of simply connected polygonal linkages and recognition of unit disk contact trees. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 447\u2013459. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_37"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BFb0021793","volume-title":"Graph Drawing","author":"H Breu","year":"1996","unstructured":"Breu, H., Kirkpatrick, D.G.: On the complexity of recognizing intersection and touching graphs of disks. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 88\u201398. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021793"},{"issue":"1\u20132","key":"22_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. Theory Appl. 9(1\u20132), 3\u201324 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(97)00014-X","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s00454-009-9196-9","volume":"43","author":"J Chalopin","year":"2009","unstructured":"Chalopin, J., Gon\u00e7alves, D., Ochem, P.: Planar graphs have 1-string representations. Discrete Comput. Geom. 43(3), 626\u2013647 (2009). https:\/\/doi.org\/10.1007\/s00454-009-9196-9","journal-title":"Discrete Comput. Geom."},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-36763-2_16","volume-title":"Graph Drawing","author":"S Chaplick","year":"2013","unstructured":"Chaplick, S., Ueckerdt, T.: Planar graphs as VPG-graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 174\u2013186. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_16"},{"key":"22_CR7","unstructured":"Chiu, M., Cleve, J., N\u00f6llenburg, M.: Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard. CoRR abs\/2010.01881 (2020)"},{"key":"22_CR8","unstructured":"Cleve, J.: Weak unit disk contact representations for graphs without embedding. CoRR abs\/2010.01886 (2020)"},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"Felsner, S.: Rectangle and square representations of planar graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 213\u2013248. Springer (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_12","DOI":"10.1007\/978-1-4614-0110-0_12"},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Gon\u00e7alves, D., Isenmann, L., Pennarun, C.: Planar graphs as L-intersection or L-contact graphs. In: Discrete Algorithms (SODA 2018), pp. 172\u2013184. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.12","DOI":"10.1137\/1.9781611975031.12"},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jctb.1998.1846","volume":"74","author":"P Hlin\u011bn\u00fd","year":"1998","unstructured":"Hlin\u011bn\u00fd, P.: Classes and recognition of curve contact graphs. J. Comb. Theor. Ser. B 74(1), 87\u2013103 (1998). https:\/\/doi.org\/10.1006\/jctb.1998.1846","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P Hlin\u011bn\u00fd","year":"2001","unstructured":"Hlin\u011bn\u00fd, P., Kratochv\u00edl, J.: Representing graphs by disks and balls (a survey of recognition-complexity results). Discrete Math. 229(1), 101\u2013124 (2001). https:\/\/doi.org\/10.1016\/S0012-365X(00)00204-1","journal-title":"Discrete Math."},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-319-27261-0_36","volume-title":"Graph Drawing and Network Visualization","author":"B Klemz","year":"2015","unstructured":"Klemz, B., N\u00f6llenburg, M., Prutkin, R.: Recognizing weighted disk contact graphs. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 433\u2013446. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_36"},{"key":"22_CR14","unstructured":"Koebe, P.: Kontaktprobleme der konformen abbildung. Ber. S\u00e4chs. Akad. Wiss. Leipzig, Math. Phys. Klasse 88, 141\u2013164 (1936)"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:43Z","timestamp":1766365303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_22","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"}]}}