{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:43:52Z","timestamp":1725515032898},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728689"},{"type":"electronic","value":"9783540728702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72870-2_7","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:53:10Z","timestamp":1182775990000},"page":"68-81","source":"Crossref","is-referenced-by-count":2,"title":["A Compact Encoding of Rectangular Drawings with Efficient Query Supports"],"prefix":"10.1007","author":[{"given":"Katsuhisa","family":"Yamanaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-Ichi","family":"Nakano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Chiang, Y.-T., Lin, C.-C., Lu, H.-I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: Proc. of SODA 2001, pp. 506\u2013515 (2001)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0055046","volume-title":"Automata, Languages and Programming","author":"R.C.-N. Chuang","year":"1998","unstructured":"Chuang, R.C.-N., Garg, A., He, X., Kao, M.-Y., Lu, H.-I.: Compact encodings of planar graphs via canonical orderings and multiple parentheses. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 118\u2013129. Springer, Heidelberg (1998)"},{"key":"7_CR3","unstructured":"Clark, D.: Compact pat trees. Ph. D., thesis, Department of Computer Science, University of Waterloo (1998)"},{"key":"7_CR4","volume-title":"Concrete mathematics","author":"R.L. Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete mathematics, 2nd edn. Addison-Wesley, Reading (1994)","edition":"2"},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1137\/S0097539796308874","volume":"28","author":"X. He","year":"1999","unstructured":"He, X.: On floor-plan of plane graph. SIAM J. on Comput.\u00a028(6), 2150\u20132167 (1999)","journal-title":"SIAM J. on Comput."},{"key":"7_CR6","unstructured":"Jacobson, G.: Succinct static data structures. Ph. D., thesis CMU-CS-89-112, Carnegie Mellon University (1989)"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0166-218X(93)E0150-W","volume":"58","author":"K. Keeler","year":"1995","unstructured":"Keeler, K., Westbrook, J.: Short encodings of planar graphs and maps. Discrete Applied Math.\u00a058(3), 239\u2013252 (1995)","journal-title":"Discrete Applied Math."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses, static trees and planar graphs. In: Proc. of FOCS 1997, pp. 118\u2013126 (1997)","DOI":"10.1109\/SFCS.1997.646100"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput.\u00a031(3), 762\u2013776 (2001)","journal-title":"SIAM J. Comput."},{"key":"7_CR10","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":"2","key":"7_CR11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.4036\/iis.2002.199","volume":"8","author":"S. Nakano","year":"2002","unstructured":"Nakano, S.: Enumerating floorplans with some properties. Interdisciplinary Information Sciences\u00a08(2), 199\u2013206 (2002)","journal-title":"Interdisciplinary Information Sciences"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0019-9958(86)80009-2","volume":"71","author":"C. Papadimitriou","year":"1986","unstructured":"Papadimitriou, C., Yannakakis, M.: A note on succinct representations of graphs. Information and Control\u00a071, 181\u2013185 (1986)","journal-title":"Information and Control"},{"volume-title":"Handbook of discrete and combinatorial mathematics","year":"2000","key":"7_CR13","unstructured":"Rosen, K.H. (ed.): Handbook of discrete and combinatorial mathematics. CRC Press, Boca Raton (2000)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0166-218X(84)90126-4","volume":"8","author":"G. Turan","year":"1984","unstructured":"Turan, G.: Succinct representations of graphs. Discrete Applied Math.\u00a08, 289\u2013294 (1984)","journal-title":"Discrete Applied Math."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0222035","volume":"22","author":"K.-H. Yeap","year":"1993","unstructured":"Yeap, K.-H., Sarrafzadeh, M.: Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM J. Comput.\u00a022, 500\u2013526 (1993)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72870-2_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:07:23Z","timestamp":1605762443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72870-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728689","9783540728702"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72870-2_7","relation":{},"subject":[]}}