{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:18:50Z","timestamp":1726409930306},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_8","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T01:16:57Z","timestamp":1283563017000},"page":"81-92","source":"Crossref","is-referenced-by-count":3,"title":["Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Hanusse","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BF02522824","volume":"17","author":"L. Alonso","year":"1997","unstructured":"Alonso, L., R\u00e9my, J.L., Schott, R.: A linear-time algorithm for the generation of trees. Algorithmica\u00a017(2), 162\u2013182 (1997)","journal-title":"Algorithmica"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1145\/357084.357091","volume":"2","author":"D.B. Arnold","year":"1980","unstructured":"Arnold, D.B., Sleep, M.R.: Uniform random generation of balanced parenthesis strings. ACM Trans. Programming Languages and Systems\u00a02(1), 122\u2013128 (1980)","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0304-3975(98)00322-3","volume":"218","author":"E. Barcucci","year":"1999","unstructured":"Barcucci, E., del Lungo, A., Pergola, E.: Random generation of trees and other combinatorial objects. Theoretical Computer Science\u00a0218(2), 219\u2013232 (1999)","journal-title":"Theoretical Computer Science"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-36494-3_44","volume-title":"STACS 2003","author":"N. Bonichon","year":"2003","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N.: An information theoretic upper bound of planar graphs using triangulation. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 499\u2013510. Springer, Heidelberg (2003)"},{"issue":"2","key":"8_CR5","first-page":"134","volume":"139","author":"T. Bilski","year":"1992","unstructured":"Bilski, T.: Embedding graphs in books: A survey. IEE Proceedings-E\u00a0139(2), 134\u2013138 (1992)","journal-title":"IEE Proceedings-E"},{"key":"8_CR6","unstructured":"Bodirsky, M., Kang, M.: Generating random outerplanar graphs. In: 1st Workshop on Algorithms for Listing, Counting, and Enumeration (ALICE) (January 2003)"},{"key":"8_CR7","unstructured":"Chartrand, G., Harary, F.: Planar permutation graphs. Ann. Inst. Henry Poincare, Sec. B3, 433\u2013438 (1967)"},{"key":"8_CR8","unstructured":"Chiang, Y.-T., Lin, C.-C., Lu, H.-I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: 12th Symposium on Discrete Algorithms (SODA), January 2001, pp. 506\u2013515. ACM-SIAM (2001)"},{"key":"8_CR9","first-page":"403","volume":"10","author":"R. Cori","year":"1992","unstructured":"Cori, R., Machi, A.: Maps, hypermaps and their automorphisms: a survey i, ii, iii. Expo. Math.\u00a010, 403\u2013467 (1992)","journal-title":"Expo. Math."},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","volume":"30","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T., Abe, S., Ozawa, T.: A linear algorithm for embedding planar graphs using pq-trees. Journal of Computer and System Sciences\u00a030(1), 54\u201376 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR11","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2000)","edition":"2"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(98)00323-5","volume":"218","author":"A. Denise","year":"1999","unstructured":"Denise, A., Zimmermann, P.: Uniform random generation of decomposable structures using floating-point arithmetic. Theoretical Computer Science\u00a0218, 233\u2013248 (1999)","journal-title":"Theoretical Computer Science"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/189443.189446","volume":"4","author":"P. Epstein","year":"1994","unstructured":"Epstein, P., Sack, J.-R.: Generating triangulations at random. ACM Trans. Model. and Comput. Simul.\u00a04, 267\u2013278 (1994)","journal-title":"ACM Trans. Model. and Comput. Simul."},{"key":"8_CR14","volume-title":"An Introduction to Probability Theory and its Applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and its Applications, vol.\u00a01. John Wiley & Sons, Chichester (1968)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0012-365X(98)00372-0","volume":"204","author":"P. Flajolet","year":"1999","unstructured":"Flajolet, P., Noy, M.: Analytic combinatorics of non-crossing configurations. Discrete Mathematics\u00a0204, 203\u2013229 (1999)","journal-title":"Discrete Mathematics"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(95)00025-8","volume":"54","author":"M. Goldwurm","year":"1995","unstructured":"Goldwurm, M.: Random generation of words in an algebraic language in linear binary space. Information Processing Letters\u00a054, 229\u2013233 (1995)","journal-title":"Information Processing Letters"},{"key":"8_CR17","first-page":"1","volume":"15","author":"G. Kreweras","year":"1970","unstructured":"Kreweras, G.: Sur les \u00e9ventails de segments. Cahiers du Bureau Universitaire de Recherche Op\u00e9rationnelle 15, 1\u201341 (1970)","journal-title":"Cahiers du Bureau Universitaire de Recherche Op\u00e9rationnelle"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Mitchell, S.L.: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inform. Proc. Letters, 229\u2013232 (1979)","DOI":"10.1016\/0020-0190(79)90075-9"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J. Ian Munro","year":"2001","unstructured":"Ian Munro, J., Raman, V.: Succinct representation of balanced parentheses, static trees and planar graphs. SIAM Journal on Computing\u00a031(3), 762\u2013776 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0001-8708(77)90059-7","volume":"24","author":"H.S. Wilf","year":"1977","unstructured":"Wilf, H.S.: A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects. Advances in Mathematics\u00a024, 281\u2013291 (1977)","journal-title":"Advances in Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T13:19:34Z","timestamp":1559567974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}