{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:18:09Z","timestamp":1648948689141},"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":[[2016]]},"DOI":"10.1587\/transinf.2015fcp0013","type":"journal-article","created":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T17:11:19Z","timestamp":1456765879000},"page":"624-629","source":"Crossref","is-referenced-by-count":0,"title":["Uniformly Random Generation of Floorplans"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Katsuhisa","family":"YAMANAKA","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Iwate University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"NAKANO","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Gunma University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] E. Ackerman, G. Barequet, and R.Y. Pinter, \u201cA bijection between permutations and floorplans, and its applications,\u201d Discrete Applied Mathematics, vol.154, pp.1674-1684, 2006.","DOI":"10.1016\/j.dam.2006.03.018"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] L. Alonso and R. Schott, Random Generation of Trees: Random Generators in Computer Science, Kluwer Academic Publishers, 1995.","DOI":"10.1007\/978-1-4757-6353-9"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] D. Avis and K. Fukuda, \u201cReverse search for enumeration,\u201d Discrete Applied Mathematics, vol.65, no.1-3, pp.21-46, 1996.","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] N. Bonichon and M. Mosbah, \u201cWatermelon uniform random generation with applications,\u201d Theoretical Computer Science, vol.307, pp.241-256, 2003.","DOI":"10.1016\/S0304-3975(03)00218-4"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] S. Dulucq and O. Guibert, Baxter permutations, Discrete Mathematics, vol.180, pp.143-156, 1998.","DOI":"10.1016\/S0012-365X(97)00112-X"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S. Felsner, \u00c9. Fusy, M. Noy, and D. Orden, Bijections for baxter families and related objects, J. Combinatorial Theory, Series A, vol.118, no.3, pp.993-1020, 2011.","DOI":"10.1016\/j.jcta.2010.03.017"},{"key":"7","unstructured":"[7] B.D. He, \u201cOptimal binary representation of mosaic floorplans and baxter permutations,\u201d Proc. 6th International Frontiers in Algorithmics, and The 8th International Conference on Algorithmic Aspects in Information and Management (FAW-AAIM 2012), vol.7285 of Lecture Notes in Computer Science, pp.1-12, 2012."},{"key":"8","unstructured":"[8] X. Hong, G. Huang, Y. Cai, J. Gu, S. Dong, C.-K. Cheng, and J. Gu, \u201cCorner block list: An effective and efficient topological representation of non-slicing floorplan,\u201d Proc. IEEE\/ACM International Conference on Computer-Aided Design, pp.8-12, 2000."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] S. Nakano, \u201cEnumerating floorplans with <i>n<\/i> rooms,&quot; Proc. 12th International Symposium on Algorithms and Computation, (ISAAC 2001), volume 2223 of Lecture Notes in Computer Science, pp.107-115, 2001.","DOI":"10.1007\/3-540-45678-3_10"},{"key":"10","unstructured":"[10] D. Poulalhon and G. Schaeffer, \u201cOptimal coding and sampling of triangulations,\u201d Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), volume 2719 of Lecture Notes in Computer Science, pp.1080-1094, 2003."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] T. Saitoh, Y. Otachi, K. Yamanaka, and R. Uehara, \u201cRandom generation and enumeration of bipartite permutation graphs,\u201d J. Discrete Algorithms, vol.10, pp.84-97, 2012.","DOI":"10.1016\/j.jda.2011.11.001"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Z.C. Shen and C.C.N. Chu, \u201cBounds on the number of slicing, mosaic, and general floorplans,\u201d IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol.22, no.10, pp.1354-1361, 2003.","DOI":"10.1109\/TCAD.2003.818136"},{"key":"13","unstructured":"[13] K. Yamanaka and S. Nakano, \u201cUniformly random generation of floorplans (extended abstract),\u201d Proc. 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, pp.188-195, 2015."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/3\/E99.D_2015FCP0013\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T23:55:07Z","timestamp":1567641307000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/3\/E99.D_2015FCP0013\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015fcp0013","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}