{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T11:01:51Z","timestamp":1780743711046,"version":"3.54.1"},"reference-count":13,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2025,3,1]]},"DOI":"10.1587\/transinf.2024fcp0002","type":"journal-article","created":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T22:12:17Z","timestamp":1720649537000},"page":"186-191","source":"Crossref","is-referenced-by-count":2,"title":["Escape from the Room"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"Kento","family":"KIMURA","sequence":"first","affiliation":[{"name":"Faculty of Science and Technology, Seikei University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomohiro","family":"HARAMIISHI","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Gunma University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazuyuki","family":"AMANO","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Gunma University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shin-ichi","family":"NAKANO","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Gunma University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] E. Ackerman, G. Barequet, and R.Y. Pinter, \u201cOn the number of rectangulations,\u201d Proc. SODA 2004, pp.729-738, 2004."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] E. Ackerman, G. Barequet, and R.Y. Pinter, \u201cOn the number of rectangulations of a planar point set,\u201d Journal of Combinatorial Theory, Series A, vol.113, no.6, pp.1072-1091, 2006. 10.1016\/j.jcta.2005.10.003","DOI":"10.1016\/j.jcta.2005.10.003"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] D. Avis, \u201cGenerating rooted triangulations without repetitions,\u201d Algorithmica, vol.16, no.6, pp.618-632, 1996. 10.1007\/s004539900067","DOI":"10.1007\/s004539900067"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] D. Avis and K. Fukuda, \u201cReverse search for enumeration,\u201d Discrete Applied Mathematics, vol.65, no.1-3, pp.21-46, 1996. 10.1016\/0166-218x(95)00026-n","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Z. Li and S. Nakano, \u201cEfficient generation of plane triangulations without repetitions,\u201d Proc. ICALP 2001, LNCS, vol.2076, pp.433-443, 2001. 10.1007\/3-540-48224-5_36","DOI":"10.1007\/3-540-48224-5_36"},{"key":"6","unstructured":"[6] A.I. Merino and T. M\u00fctze, \u201cEfficient Generation of Rectangulations via Permutation Languages,\u201d Proc. SoCG 2021, vol.189, pp.54:1-54:18, 2021. 10.4230\/LIPIcs.SoCG.2021.54"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] S. Nakano, \u201cEnumerating floorplans with <i>n<\/i> rooms,\u201d Proc. ISAAC 2001, LNCS, vol.2223, pp.107-115, 2001. 10.1007\/3-540-45678-3_10","DOI":"10.1007\/3-540-45678-3_10"},{"key":"8","unstructured":"[8] S. Nakano, \u201cEnumerating Floorplans with n Rooms,\u201d IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 85-A, pp.1746-1750, 2002."},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] S. Nakano, \u201cEfficient generation of plane trees,\u201d Information Processing Letters, vol.84, no.3, pp.167-172, 2002. 10.1016\/s0020-0190(02)00240-5","DOI":"10.1016\/S0020-0190(02)00240-5"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] S. Nakano, \u201cEfficient Generation of Triconnected Plane Triangulations,\u201d Computational Geometry Theory and Applications, vol.27, no.2, pp.109-122, 2004. 10.1016\/j.comgeo.2003.06.001","DOI":"10.1016\/j.comgeo.2003.06.001"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] M. Takagi and S. Nakano, \u201cListing all rectangular drawings with certain properties,\u201d Systems and Computers in Japan, vol.35, no.4, pp.1-8, 2004. 10.1002\/scj.10563","DOI":"10.1002\/scj.10563"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] K. Yamanaka, M.S. Rahman and S. Nakano, \u201cFloorplans with Columns,\u201d Proc. COCOA 2017, LNCS, vol.10627, pp.33-40, 2017. 10.1007\/978-3-319-71150-8_3","DOI":"10.1007\/978-3-319-71150-8_3"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] K. Yamanaka and S. Nakano, \u201cFloorplans with Walls,\u201d Proc. TAMC 2020, LNCS, vol.12337, pp.50-59, 2020. 10.1007\/978-3-030-59267-7_5","DOI":"10.1007\/978-3-030-59267-7_5"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCP0002\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:33:17Z","timestamp":1740799997000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCP0002\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024fcp0002","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"article-number":"2024FCP0002"}}