{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:57:49Z","timestamp":1742929069946,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_13","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"160-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Drawing Clustered Graphs on Disk Arrangements"],"prefix":"10.1007","author":[{"given":"Tamara","family":"Mchedlidze","sequence":"first","affiliation":[]},{"given":"Marcel","family":"Radermacher","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"given":"Nina","family":"Zimbel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is $$\\exists \\mathbb{R}$$-complete. In: STOC 2018, pp. 65\u201373. ACM (2018)","DOI":"10.1145\/3188745.3188868"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Akitaya, H.A., Fulek, R., T\u00f3th, C.D.: Recognizing weak embeddings of graphs. In: Czumaj, A. (ed.) SODA 2018, pp. 274\u2013292. SIAM (2018)","DOI":"10.1137\/1.9781611975031.20"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.7155\/jgaa.00367","volume":"19","author":"M Alam","year":"2015","unstructured":"Alam, M., Kaufmann, M., Kobourov, S.G., Mchedlidze, T.: Fitting planar graphs on planar maps. J. Graph Alg. Appl. 19(1), 413\u2013440 (2015)","journal-title":"J. Graph Alg. Appl."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-662-45803-7_34","volume-title":"Graph Drawing","author":"P Angelini","year":"2014","unstructured":"Angelini, P., et al.: Anchored drawings of planar graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 404\u2013415. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_34"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/s00454-010-9302-z","volume":"45","author":"P Angelini","year":"2011","unstructured":"Angelini, P., Frati, F., Kaufmann, M.: Straight-line rectangular drawings of clustered graphs. Disc. Comput. Geom. 45(1), 88\u2013140 (2011)","journal-title":"Disc. Comput. Geom."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-62127-2_7","volume-title":"Algorithms and Data Structures","author":"B Banyassady","year":"2017","unstructured":"Banyassady, B., Hoffmann, M., Klemz, B., L\u00f6ffler, M., Miltzow, T.: Obedient plane drawings for disk intersection graphs. In: Ellen, F., Kolokolova, A., Sack, J.R. (eds.) Algorithms and Data Structures. LNCS, vol. 10389, pp. 73\u201384. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_7"},{"issue":"3","key":"13_CR7","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 plane. Int. J. Comput. Geom. Appl. 22(3), 187\u2013206 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.tcs.2015.10.011","volume":"609","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Rutter, I.: A new perspective on clustered planarity as a combinatorial embedding problem. Theor. Comput. Sci. 609(2), 306\u2013315 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1856","DOI":"10.1016\/j.disc.2007.12.090","volume":"309","author":"PF Cortese","year":"2009","unstructured":"Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: On embedding a cycle in a plane graph. Disc. Math. 309(7), 1856\u20131869 (2009)","journal-title":"Disc. Math."},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-004-1144-8","volume":"44","author":"P Eades","year":"2006","unstructured":"Eades, P., Feng, Q., Lin, X., Nagamochi, H.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica 44(1), 1\u201332 (2006)","journal-title":"Algorithmica"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms \u2014 ESA \u201995","author":"Q-W Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P. (ed.) ESA 1995. LNCS, vol. 979, pp. 213\u2013226. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60313-1_145"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-58950-3_377","volume-title":"Graph Drawing","author":"M Godau","year":"1995","unstructured":"Godau, M.: On the difficulty of embedding planar graphs with inaccuracies. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 254\u2013261. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-58950-3_377"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Mchedlidze, T., Radermacher, M., Rutter, I., Zimbel, N.: Drawing Clustered Graphs on Disk Arrangements (2018). https:\/\/arxiv.org\/abs\/1811.00785","DOI":"10.1007\/978-3-030-10564-8_13"},{"key":"13_CR14","unstructured":"Rib\u00f3 Mor, A.: Realization and Counting Problems for Planar Structures. Ph.D. thesis, FU Berlin (2006). https:\/\/refubium.fu-berlin.de\/handle\/fub188\/10243"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:50:53Z","timestamp":1709823053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","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":"100","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":"30","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":"0","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":"30% - 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","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":"9.8","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)"}}]}}