{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:44:29Z","timestamp":1743075869338,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_21","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"232-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Escape from\u00a0the\u00a0Room"],"prefix":"10.1007","author":[{"given":"Kento","family":"Kimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuyuki","family":"Amano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Nakano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"21_CR1","first-page":"729","volume":"2004","author":"E Ackerman","year":"2004","unstructured":"Ackerman, E., Barequet, G., Pinter, R.Y.: On the number of rectangulations. Proc. SODA 2004, 729\u2013738 (2004)","journal-title":"Proc. SODA"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1016\/j.jcta.2005.10.003","volume":"113","author":"E Ackerman","year":"2006","unstructured":"Ackerman, E., Barequet, G., Pinter, R.Y.: On the number of rectangulations of a planar point set. J. Comb. Theor. Series A 113, 1072\u20131091 (2006)","journal-title":"J. Comb. Theor. Series A"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/BF01944353","volume":"16","author":"D Avis","year":"1996","unstructured":"Avis, D.: Generating rooted triangulations without repetitions. Algorithmica 16, 618\u2013632 (1996)","journal-title":"Algorithmica"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65, 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-48224-5_36","volume-title":"Automata, Languages and Programming","author":"Z Li","year":"2001","unstructured":"Li, Z., Nakano, S.: Efficient generation of plane triangulations without repetitions. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 433\u2013443. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_36"},{"issue":"54","key":"21_CR6","first-page":"1","volume":"2021","author":"AI Merino","year":"2021","unstructured":"Merino, A.I., M\u00fctze, T.: Efficient generation of rectangulations via permutation languages. Proc. SoCG 2021(54), 1\u201318 (2021)","journal-title":"Proc. SoCG"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-45678-3_10","volume-title":"Algorithms and Computation","author":"S Nakano","year":"2001","unstructured":"Nakano, S.: Enumerating floorplans with n rooms. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 107\u2013115. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45678-3_10"},{"key":"21_CR8","unstructured":"Nakano, S.: Enumerating floorplans with n rooms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A, 1746\u20131750 (2002)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0020-0190(02)00240-5","volume":"84","author":"S Nakano","year":"2002","unstructured":"Nakano, S.: Efficient generation of plane trees. Inf. Process. Lett. 84, 167\u2013172 (2002)","journal-title":"Inf. Process. Lett."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.comgeo.2003.06.001","volume":"27","author":"S Nakano","year":"2004","unstructured":"Nakano, S.: Efficient generation of triconnected plane triangulations. Computat. Geom. Theory Appl. 27, 109\u2013122 (2004)","journal-title":"Computat. Geom. Theory Appl."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/scj.10563","volume":"35","author":"M Takagi","year":"2004","unstructured":"Takagi, M., Nakano, S.: Listing all rectangular drawings with certain properties. Syst. Comput. Japan 35, 1\u20138 (2004)","journal-title":"Syst. Comput. Japan"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-71150-8_3","volume-title":"Combinatorial Optimization and Applications","author":"K Yamanaka","year":"2017","unstructured":"Yamanaka, K., Rahman, M.S., Nakano, S.-I.: Floorplans with columns. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10627, pp. 33\u201340. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71150-8_3"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-030-59267-7_5","volume-title":"Theory and Applications of Models of Computation","author":"K Yamanaka","year":"2020","unstructured":"Yamanaka, K., Nakano, S.: Floorplans with walls. In: Chen, J., Feng, Q., Xu, J. (eds.) TAMC 2020. LNCS, vol. 12337, pp. 50\u201359. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59267-7_5"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:04:50Z","timestamp":1680213890000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}