{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:23:28Z","timestamp":1743049408552,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_1","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations"],"prefix":"10.1007","author":[{"given":"Bryan","family":"He","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_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 Applied Mathematics\u00a0154, 1674\u20131684 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR2","unstructured":"Amano, K., Nakano, S., Yamanaka, K.: On the number of rectangular drawings: Exact counting and lower and upper bounds. IPSJ SIG Notes 2007-AL-115-5C, 33\u201340 (2007)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1090\/S0002-9939-1964-0184217-8","volume":"15","author":"G. Baxter","year":"1964","unstructured":"Baxter, G.: On fixed points of the composite of commuting functions. Proceedings American Mathematics Society\u00a015, 851\u2013855 (1964)","journal-title":"Proceedings American Mathematics Society"},{"key":"1_CR4","unstructured":"Bonichon, N., Bousquet-M\u00e9lou, M., Fusy, \u00c9.: Baxter permutations and plane bipolar orientations. S\u00e9minaire Lotharingien de Combinatoire\u00a061A (2010)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Canary, H.: Aztec diamonds and baxter permutations. The Electronic Journal of Combinatorics\u00a017 (2010)","DOI":"10.37236\/377"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0012-365X(97)00112-X","volume":"180","author":"S. Dulucq","year":"1998","unstructured":"Dulucq, S., Guibert, O.: Baxter permutations. Discrete Mathematics\u00a0180, 143\u2013156 (1998)","journal-title":"Discrete Mathematics"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Fujimaki, R., Inoue, Y., Takahashi, T.: An asymptotic estimate of the numbers of rectangular drawings or floorplans. In: Proceedings 2009 IEEE International Symposium on Circuits and Systems, pp. 856\u2013859 (2009)","DOI":"10.1109\/ISCAS.2009.5117891"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Giraudo, S.: Algebraic and combinatorial structures on baxter permutations. Discrete Mathematics and Theoretical Computer Science, DMTCS (2011)","DOI":"10.46298\/dmtcs.2919"},{"key":"1_CR9","unstructured":"Hong, X., Huang, G., Cai, Y., Gu, J., Dong, S., Cheng, C.-K., Gu, J.: Corner-block list: An effective and efficient topological representation of non-slicing floorplan. In: Proceedings of the International Conference on Computer Aided Design (ICCAD 2000), pp. 8\u201312 (2000)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons (1990)","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Murata, H., Fujiyoshi, K.: Rectangle-packing-based module placement. In: Proceedings of the International Conference on Computer Aided Design (ICCAD 1995), pp. 472\u2013479 (1995)","DOI":"10.1109\/ICCAD.1995.480159"},{"key":"1_CR12","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.\u00a02223, pp. 107\u2013115. Springer, Heidelberg (2001)"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/TCSI.2003.809442","volume":"50","author":"K. Sakanushi","year":"2003","unstructured":"Sakanushi, K., Kajitani, Y., Mehta, D.P.: The quarter-state-sequence floorplan representation. IEEE Transactions on Circuits and Systems - I: Fundamental Theory and Applications\u00a050(3), 376\u2013386 (2003)","journal-title":"IEEE Transactions on Circuits and Systems - I: Fundamental Theory and Applications"},{"issue":"10","key":"1_CR14","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/TCAD.2003.818136","volume":"22","author":"Z.C. Shen","year":"2003","unstructured":"Shen, Z.C., Chu, C.C.N.: Bounds on the number of slicing, mosaic, and general floorplans. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a022(10), 1354\u20131361 (2003)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Speckmann, B., van Kreveld, M., Florisson, S.: A linear programming approach to rectangular cartograms. In: Proceedings 12th International Symposium on Spatial Data Handling (SDH), pp. 527\u2013546 (2006)","DOI":"10.1007\/3-540-35589-8_34"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-02882-3_6","volume-title":"Computing and Combinatorics","author":"T. Takahashi","year":"2009","unstructured":"Takahashi, T., Fujimaki, R., Inoue, Y.: A (4n \u2212 4)-Bit Representation of a Rectangular Drawing or Floorplan. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol.\u00a05609, pp. 47\u201355. Springer, Heidelberg (2009)"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.comgeo.2006.06.002","volume":"37","author":"M. Kreveld van","year":"2007","unstructured":"van Kreveld, M., Speckmann, B.: On rectangular cartograms. Computational Geometry: Theory and Applications\u00a037(3), 175\u2013187 (2007)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"5","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1093\/ietfec\/e89-a.5.1181","volume":"E89","author":"K. Yamanaka","year":"2006","unstructured":"Yamanaka, K., Nakano, S.: Coding floorplans with fewer bits. IEICE Transactions Fundamentals\u00a0E89(5), 1181\u20131185 (2006)","journal-title":"IEICE Transactions Fundamentals"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-72870-2_7","volume-title":"Algorithmic Aspects in Information and Management","author":"K. Yamanaka","year":"2007","unstructured":"Yamanaka, K., Nakano, S.: A Compact Encoding of Rectangular Drawings with Efficient Query Supports. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol.\u00a04508, pp. 68\u201381. Springer, Heidelberg (2007)"},{"issue":"1","key":"1_CR20","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.-K., Graham, R.: Floorplan representation: Complexity and connections. ACM Transactions on Design Automation of Electronic Systems\u00a08(1), 55\u201380 (2003)","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"issue":"4","key":"1_CR21","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1109\/TCAD.2003.809651","volume":"22","author":"E.F.Y. Young","year":"2003","unstructured":"Young, E.F.Y., Chu, C.C.N., Shen, Z.C.: Twin binary sequences: A nonredundant representation for general nonslicing floorplan. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a022(4), 457\u2013469 (2003)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:54:33Z","timestamp":1743026073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}