{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:14Z","timestamp":1759638314478,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752415"},{"type":"electronic","value":"9783030752422"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75242-2_24","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:22:29Z","timestamp":1620141749000},"page":"340-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Extending Partial Representations of\u00a0Rectangular Duals with Given Contact\u00a0Orientations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3501-4608","authenticated-orcid":false,"given":"Steven","family":"Chaplick","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-3794-4406","authenticated-orcid":false,"given":"Ignaz","family":"Rutter","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":[[2021,5,4]]},"reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976). https:\/\/doi.org\/10.1016\/S0022-0000(76)80045-1","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1215\/S0012-7094-40-00718-9","volume":"7","author":"RL Brooks","year":"1940","unstructured":"Brooks, R.L., Smith, C.A.B., Stone, A.H., Tutte, W.T.: The dissection of rectangles into squares. Duke Math. J. 7(1), 312\u2013340 (1940). https:\/\/doi.org\/10.1215\/S0012-7094-40-00718-9","journal-title":"Duke Math. J."},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-33024-7_3","volume-title":"Geographic Information Science","author":"K Buchin","year":"2012","unstructured":"Buchin, K., Speckmann, B., Verdonschot, S.: Evolution strategies for optimizing rectangular cartograms. In: Xiao, N., Kwan, M.-P., Goodchild, M.F., Shekhar, S. (eds.) GIScience 2012. LNCS, vol. 7478, pp. 29\u201342. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33024-7_3"},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Trans. Algorithms 4(1) (2008). https:\/\/doi.org\/10.1145\/1328911.1328919","DOI":"10.1145\/1328911.1328919"},{"key":"24_CR5","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":"24_CR6","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":"8","key":"24_CR7","doi-asserted-by":"publisher","first-page":"2286","DOI":"10.1007\/s00453-017-0322-4","volume":"80","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., Gu\u015bpiel, G., Gutowski, G., Krawczyk, T., Liotta, G.: The partial visibility representation extension problem. Algorithmica 80(8), 2286\u20132323 (2017). https:\/\/doi.org\/10.1007\/s00453-017-0322-4","journal-title":"Algorithmica"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/s00453-011-9525-2","volume":"63","author":"CA Duncan","year":"2012","unstructured":"Duncan, C.A., Gansner, E.R., Hu, Y., Kaufmann, M., Kobourov, S.G.: Optimal polygonal representation of planar graphs. Algorithmica 63(3), 672\u2013691 (2012). https:\/\/doi.org\/10.1007\/s00453-011-9525-2","journal-title":"Algorithmica"},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/110834032","volume":"41","author":"D Eppstein","year":"2012","unstructured":"Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal and constrained rectangular layouts. SIAM J. Comput. 41(3), 537\u2013564 (2012). https:\/\/doi.org\/10.1137\/110834032","journal-title":"SIAM J. Comput."},{"key":"24_CR10","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, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_12","DOI":"10.1007\/978-1-4614-0110-0_12"},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H de Fraysseix","year":"1994","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Comb. Probab. Comput. 3(2), 233\u2013246 (1994). https:\/\/doi.org\/10.1017\/S0963548300001139","journal-title":"Comb. Probab. Comput."},{"key":"24_CR12","doi-asserted-by":"publisher","unstructured":"Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis. Syst. Biol. 18(3), 259\u2013278 (1969). https:\/\/doi.org\/10.2307\/2412323","DOI":"10.2307\/2412323"},{"key":"24_CR13","doi-asserted-by":"publisher","unstructured":"Heilmann, R., Keim, D.A., Panse, C., Sips, M.: RecMap: rectangular map approximations. In: Ward, M.O., Munzner, T. (eds.) IEEE Symposium on Information Visualization. pp. 33\u201340. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/INFVIS.2004.57","DOI":"10.1109\/INFVIS.2004.57"},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoret. Comput. Sci. 172(1), 175\u2013193 (1997). https:\/\/doi.org\/10.1016\/S0304-3975(95)00257-X","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"24_CR15","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"},{"issue":"3","key":"24_CR16","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"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-319-27261-0_20","volume-title":"Graph Drawing and Network Visualization","author":"J Klawitter","year":"2015","unstructured":"Klawitter, J., N\u00f6llenburg, M., Ueckerdt, T.: Combinatorial properties of triangle-free rectangle arrangements and the squarability problem. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 231\u2013244. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_20"},{"key":"24_CR18","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig. Math. Phys. Klasse 88, 141\u2013164 (1936)"},{"issue":"2","key":"24_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"K Ko\u017ami\u0144ski","year":"1985","unstructured":"Ko\u017ami\u0144ski, K., Kinnen, E.: Rectangular duals of planar graphs. Networks 15(2), 145\u2013157 (1985). https:\/\/doi.org\/10.1002\/net.3230150202","journal-title":"Networks"},{"key":"24_CR20","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"},{"issue":"3","key":"24_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.comgeo.2006.06.002","volume":"37","author":"MJ van Kreveld","year":"2007","unstructured":"van Kreveld, M.J., Speckmann, B.: On rectangular cartograms. Comput. Geom. 37(3), 175\u2013187 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.06.002","journal-title":"Comput. Geom."},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-319-27261-0_38","volume-title":"Graph Drawing and Network Visualization","author":"V Kusters","year":"2015","unstructured":"Kusters, V., Speckmann, B.: Towards characterizing graphs with a sliceable rectangular dual. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 460\u2013471. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_38"},{"key":"24_CR23","doi-asserted-by":"publisher","unstructured":"Leinwand, S.M., Lai, Y.-T.: An algorithm for building rectangular floor-plans. In: 21st Design Automation Conference Proceedings, pp. 663\u2013664 (1984). https:\/\/doi.org\/10.1109\/DAC.1984.1585874","DOI":"10.1109\/DAC.1984.1585874"},{"issue":"3","key":"24_CR24","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1111\/cgf.12932","volume":"35","author":"S Nusrat","year":"2016","unstructured":"Nusrat, S., Kobourov, S.G.: The state of the art in cartograms. Comput. Graph. Forum 35(3), 619\u2013642 (2016). https:\/\/doi.org\/10.1111\/cgf.12932","journal-title":"Comput. Graph. Forum"},{"issue":"2","key":"24_CR25","doi-asserted-by":"publisher","first-page":"292","DOI":"10.2307\/208794","volume":"24","author":"E Raisz","year":"1934","unstructured":"Raisz, E.: The rectangular statistical cartogram. Geogr. Rev. 24(2), 292\u2013296 (1934). https:\/\/doi.org\/10.2307\/208794","journal-title":"Geogr. Rev."},{"key":"24_CR26","unstructured":"Steadman, P.: Graph theoretic representation of architectural arrangement. In: Architectural Research and Teaching, pp. 161\u2013172 (1973)"},{"issue":"2","key":"24_CR27","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/S0895480191266700","volume":"8","author":"GKH Yeap","year":"1995","unstructured":"Yeap, G.K.H., Sarrafzadeh, M.: Sliceable floorplanning by graph dualization. SIAM J. Discrete Math. 8(2), 258\u2013280 (1995). https:\/\/doi.org\/10.1137\/S0895480191266700","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75242-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:29:04Z","timestamp":1620142144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75242-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752415","9783030752422"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75242-2_24","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":"4 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2021\/","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":"78","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":"27","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":"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","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":"10","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":"Due to the Corona pandemic the conference was held virtually.","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)"}}]}}