{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T17:37:39Z","timestamp":1781804259398,"version":"3.54.5"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030967307","type":"print"},{"value":"9783030967314","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_7","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"73-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Aspect Ratio Universal Rectangular Layouts"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Nathenson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"issue":"12","key":"7_CR1","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1016\/j.dam.2006.03.018","volume":"154","author":"E Ackerman","year":"2006","unstructured":"Ackerman, E., Barequet, G., Pinter, R.Y.: A bijection between permutations and floorplans, and its applications. Discrete Appl. Math. 154(12), 1674\u20131684 (2006)","journal-title":"Discrete Appl. Math."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00026-010-0043-8","volume":"14","author":"A Asinowski","year":"2010","unstructured":"Asinowski, A., Mansour, T.: Separable $$d$$-permutations and guillotine partitions. Ann. Comb. 14, 17\u201343 (2010)","journal-title":"Ann. Comb."},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Binary space partitions. In: Computational Geometry: Algorithms and Applications, Chap. 12, pp. 259\u2013281. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2_12","DOI":"10.1007\/978-3-540-77974-2_12"},{"issue":"1","key":"7_CR4","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)","journal-title":"Duke Math. J."},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1145\/502175.502176","volume":"6","author":"P Dasgupta","year":"2001","unstructured":"Dasgupta, P., Sur-Kolay, S.: Slicible rectangular graphs and their optimal floorplans. ACM Trans. Design Autom. Electr. Syst. 6(4), 447\u2013470 (2001)","journal-title":"ACM Trans. Design Autom. Electr. Syst."},{"issue":"3","key":"7_CR6","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)","journal-title":"SIAM J. Comput."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Felsner, S.: Lattice structures from planar graphs. Electron. J. Comb. 11(1) (2004)","DOI":"10.37236\/1768"},{"key":"7_CR8","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":"7_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7155\/jgaa.00320","volume":"18","author":"S Felsner","year":"2014","unstructured":"Felsner, S.: Exploiting air-pressure to map floorplans on point sets. J. Graph Algorithms Appl. 18(2), 233\u2013252 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"7_CR10","unstructured":"Felsner, S., Nathenson, A., T\u00f3th, C.D.: Aspect ratio universal rectangular layouts. Preprint (2021). https:\/\/arxiv.org\/abs\/2112.03242"},{"issue":"7","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.1016\/j.disc.2007.12.093","volume":"309","author":"\u00c9 Fusy","year":"2009","unstructured":"Fusy, \u00c9.: Transversal structures on triangulations: a combinatorial study and straight-line drawings. Discrete Math. 309(7), 1870\u20131894 (2009)","journal-title":"Discrete Math."},{"issue":"6","key":"7_CR12","doi-asserted-by":"publisher","first-page":"629","DOI":"10.7155\/jgaa.00309","volume":"17","author":"MM Hasan","year":"2013","unstructured":"Hasan, M.M., Rahman, M.S., Karim, M.R.: Box-rectangular drawings of planar graphs. J. Graph Algorithms Appl. 17(6), 629\u2013646 (2013)","journal-title":"J. Graph Algorithms Appl."},{"issue":"6","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1137\/0222072","volume":"22","author":"X He","year":"1993","unstructured":"He, X.: On finding the rectangular duals of planar triangular graphs. SIAM J. Comput. 22(6), 1218\u20131226 (1993)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/00029890.2008.11920491","volume":"115","author":"FV Henle","year":"2008","unstructured":"Henle, F.V., Henle, J.M.: Squaring the plane. Am. Math. Mon. 115(1), 3\u201312 (2008)","journal-title":"Am. Math. Mon."},{"issue":"1\u20132","key":"7_CR15","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. Theor. Comput. Sci. 172(1\u20132), 175\u2013193 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"7_CR16","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)","journal-title":"Networks"},{"issue":"3","key":"7_CR17","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)","journal-title":"Comput. Geom."},{"key":"7_CR18","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":"7_CR19","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Graphs and Geometry, Colloquium Publications, vol. 65. AMS, Providence, RI (2019)","DOI":"10.1090\/coll\/065"},{"key":"7_CR20","unstructured":"Merino, A.I., M\u00fctze, T.: Efficient generation of rectangulations via permutation languages. In: 37th International Symposium on Computational Geometry (SoCG). LIPIcs, vol. 189, pp. 54:1\u201354:18. Schloss Dagstuhl (2021)"},{"issue":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1068\/b030037","volume":"3","author":"WJ Mitchell","year":"1976","unstructured":"Mitchell, W.J., Steadman, J.P., Liggett, R.S.: Synthesis and optimization of small rectangular floor plans. Environ. Plann. B Plann. Des. 3(1), 37\u201370 (1976)","journal-title":"Environ. Plann. B Plann. Des."},{"key":"7_CR22","unstructured":"Nishizeki, T., Rahman, M.S.: Rectangular drawing algorithms. In: Handbook on Graph Drawing and Visualization, pp. 317\u2013348. Chapman and Hall\/CRC (2013)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Otten, R.H.J.M.: Automatic floorplan design. In: Proceedings of the 19th Design Automation Conference (DAC), pp. 261\u2013267. ACM\/IEEE (1982)","DOI":"10.1109\/DAC.1982.1585510"},{"issue":"3","key":"7_CR24","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0925-7721(98)00003-0","volume":"10","author":"MS Rahman","year":"1998","unstructured":"Rahman, M.S., Nakano, S., Nishizeki, T.: Rectangular grid drawings of plane graphs. Comput. Geom. 10(3), 203\u2013220 (1998)","journal-title":"Comput. Geom."},{"issue":"3","key":"7_CR25","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0925-7721(01)00061-X","volume":"21","author":"MS Rahman","year":"2002","unstructured":"Rahman, M.S., Nakano, S., Nishizeki, T.: Rectangular drawings of plane graphs without designated corners. Comput. Geom. 21(3), 121\u2013138 (2002)","journal-title":"Comput. Geom."},{"issue":"2","key":"7_CR26","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)","journal-title":"Geogr. Rev."},{"issue":"4","key":"7_CR27","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.ejc.2011.11.004","volume":"33","author":"N Reading","year":"2012","unstructured":"Reading, N.: Generic rectangulations. Eur. J. Comb. 33(4), 610\u2013623 (2012)","journal-title":"Eur. J. Comb."},{"key":"7_CR28","unstructured":"Rinsma, I.: Existence theorems for floorplans. Ph.D. thesis, University of Canterbury, Christchurch, New Zealand (1987)"},{"issue":"2","key":"7_CR29","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1068\/b140163","volume":"14","author":"I Rinsma","year":"1987","unstructured":"Rinsma, I.: Nonexistence of a certain rectangular floorplan with specified areas and adjacency. Environ. Plann. B Plann. Des. 14(2), 163\u2013166 (1987)","journal-title":"Environ. Plann. B Plann. Des."},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF02761693","volume":"84","author":"O Schramm","year":"1993","unstructured":"Schramm, O.: Square tilings with prescribed combinatorics. Isr. J. Math. 84, 97\u2013118 (1993)","journal-title":"Isr. J. Math."},{"key":"7_CR31","unstructured":"Thomassen, C.: Plane representations of graphs. In: Progress in Graph Theory, pp. 43\u201369. Academic Press Canada (1984)"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: Squaring the square. Scientific American 199, 136\u2013142 (1958), in Gardner\u2019s \u2018Mathematical Games\u2019 column. Reprinted with addendum and bibliography in the US in M. Gardner. In: The 2nd Scientific American Book of Mathematical Puzzles & Diversions, Simon and Schuster, New York, pp. 186\u2013209 (1961)","DOI":"10.1038\/scientificamerican1158-136"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Ungar, P.: On diagrams representing maps. J. Lond. Math. Soc. s1-28(3), 336\u2013342 (1953)","DOI":"10.1112\/jlms\/s1-28.3.336"},{"issue":"3","key":"7_CR34","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/31.1739","volume":"35","author":"S Wimer","year":"1988","unstructured":"Wimer, S., Koren, I., Cederbaum, I.: Floorplans, planar graphs, and layouts. IEEE Trans. Circuits Syst. 35(3), 267\u2013278 (1988)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"1","key":"7_CR35","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/606603.606607","volume":"8","author":"B Yao","year":"2003","unstructured":"Yao, B., Chen, H., Cheng, C., Graham, R.L.: Floorplan representations: complexity and connections. ACM Trans. Des. Autom. Electr. Syst. 8(1), 55\u201380 (2003)","journal-title":"ACM Trans. Des. Autom. Electr. Syst."},{"issue":"2","key":"7_CR36","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)","journal-title":"SIAM J. Discrete Math."}],"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-96731-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:04:33Z","timestamp":1647389073000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","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 Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","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":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","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":"89","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":"34% - 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":"2-9","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":"The proceedings also include 3 invited papers.","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)"}}]}}