{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:35:53Z","timestamp":1725525353257},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_13","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"141-150","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Katsuhisa","family":"Yamanaka","sequence":"first","affiliation":[]},{"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[]},{"given":"Shin-ichi","family":"Nakano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math.\u00a065(1-3), 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/0209055","volume":"9","author":"T. Beyer","year":"1980","unstructured":"Beyer, T., Hedetniemi, S.M.: Constant time generation of rooted trees. SIAM J. Comput.\u00a09(4), 706\u2013712 (1980)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1093\/comjnl\/23.4.332","volume":"23","author":"T.I. Fenner","year":"1980","unstructured":"Fenner, T.I., Loizou, G.: A binary tree representation and related algorithms for generating integer partitions. The Computer J.\u00a023(4), 332\u2013337 (1980)","journal-title":"The Computer J."},{"key":"13_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569913","volume-title":"Efficient algorithms for listing combinatorial structures","author":"L. Goldberg","year":"1993","unstructured":"Goldberg, L.: Efficient algorithms for listing combinatorial structures. Cambridge University Press, New York (1993)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45071-8_34","volume-title":"Computing and Combinatorics","author":"Y. Kikuchi","year":"2003","unstructured":"Kikuchi, Y., Tanaka, H., Nakano, S., Shibata, Y.: How to obtain the complete list of caterpillars. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 329\u2013338. Springer, Heidelberg (2003)"},{"key":"13_CR6","series-title":"Generating all tuples and permutations","volume-title":"The art of computer programming","author":"D. Knuth","year":"2005","unstructured":"Knuth, D.: The art of computer programming. Generating all tuples and permutations, vol.\u00a04, fascicle 2. Addison-Wesley, Reading (2005)"},{"key":"13_CR7","series-title":"Generating all trees, history of combinatorial generation","volume-title":"The art of computer programming","author":"D.E. Knuth","year":"2006","unstructured":"Knuth, D.E.: The art of computer programming. Generating all trees, history of combinatorial generation, vol.\u00a04, fascicle 4. Addison-Wesley, Reading (2006)"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1006\/jagm.1999.1059","volume":"34","author":"J.F. Korsh","year":"2000","unstructured":"Korsh, J.F., LaFollette, P.: Multiset permutations and loopless generation of ordered trees with specified degree sequence. Journal of Algorithms\u00a034(2), 309\u2013336 (2000)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1093\/comjnl\/45.3.364","volume":"45","author":"J.F. Korsh","year":"2002","unstructured":"Korsh, J.F., LaFollette, P.: Loopless generation of trees with specified degrees. The Computer Journal\u00a045(3), 364\u2013372 (2002)","journal-title":"The Computer Journal"},{"key":"13_CR10","volume-title":"Combinatorial algorithms","author":"D.L. Kreher","year":"1998","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial algorithms. CRC Press, Boca Raton (1998)"},{"unstructured":"Li, G., Ruskey, F.: The advantages of forward thinking in generating rooted and free trees. In: Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 1999), pp. 939\u2013940 (1999)","key":"13_CR11"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-48224-5_36","volume-title":"Automata, Languages and Programming","author":"Z. Li","year":"2001","unstructured":"Li, Z., Nakano, S.: Efficient generation of plane triangulations without repetitions. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 433\u2013443. Springer, Heidelberg (2001)"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"B.D. McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms\u00a026(2), 306\u2013324 (1998)","journal-title":"J. Algorithms"},{"issue":"12","key":"13_CR14","first-page":"940","volume":"J90-A","author":"T. Muramatsu","year":"2007","unstructured":"Muramatsu, T., Nakano, S.: A random generation of plane trees with exactly k leaves. IEICE Transaction on Fundamentals\u00a0J90-A(12), 940\u2013947 (2007) (in Japanese)","journal-title":"IEICE Transaction on Fundamentals"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0020-0190(02)00240-5","volume":"84","author":"S. Nakano","year":"2002","unstructured":"Nakano, S.: Efficient generation of plane trees. Inf. Process. Lett.\u00a084(3), 167\u2013172 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.comgeo.2003.06.001","volume":"27","author":"S. Nakano","year":"2004","unstructured":"Nakano, S.: Efficient generation of triconnected plane triangulations. Comput. Geom. Theory and Appl.\u00a027(2), 109\u2013122 (2004)","journal-title":"Comput. Geom. Theory and Appl."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-30559-0_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Nakano","year":"2004","unstructured":"Nakano, S., Uno, T.: Constant time generation of trees with specified diameter. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 33\u201345. Springer, Heidelberg (2004)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/11604686_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Nakano","year":"2005","unstructured":"Nakano, S., Uno, T.: Generating colored trees. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 249\u2013260. Springer, Heidelberg (2005)"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1080\/00207168708803562","volume":"21","author":"J. Pallo","year":"1987","unstructured":"Pallo, J.: Generating trees with n nodes and m leaves. International Journal of Computer Mathematics\u00a021(2), 133\u2013144 (1987)","journal-title":"International Journal of Computer Mathematics"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"R.C. Read","year":"1978","unstructured":"Read, R.C.: Every one a winner or how to avoid isomorphism search. Annuals of Discrete Mathematics\u00a02, 107\u2013120 (1978)","journal-title":"Annuals of Discrete Mathematics"},{"key":"13_CR21","volume-title":"Combinatorial Algorithms","author":"E.M. Reingold","year":"1977","unstructured":"Reingold, E.M., Nievergelt, J., Deo, N.: Combinatorial Algorithms. Prentice-Hall, Englewood Cliffs (1977)"},{"key":"13_CR22","first-page":"53","volume":"41","author":"F. Ruskey","year":"1984","unstructured":"Ruskey, F., van Baronaigien, D.R.: Fast recursive algorithms for generating combinatorial objects. Congressus Numerantium\u00a041, 53\u201362 (1984)","journal-title":"Congressus Numerantium"},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1125994.1125995","volume":"2","author":"J. Sawada","year":"2006","unstructured":"Sawada, J.: Generating rooted and free plane trees. ACM Transactions on Algorithms\u00a02(1), 1\u201313 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"13_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative combinatorics","author":"R.P. Stanley","year":"1999","unstructured":"Stanley, R.P.: Enumerative combinatorics, vol.\u00a02. Cambridge University Press, Cambridge (1999)"},{"key":"13_CR25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970166","volume-title":"Combinatorial algorithms: An update","author":"H.S. Wilf","year":"1989","unstructured":"Wilf, H.S.: Combinatorial algorithms: An update. SIAM, Philadelphia (1989)"},{"issue":"2","key":"13_CR26","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0215039","volume":"15","author":"R.A. Wright","year":"1986","unstructured":"Wright, R.A., Richmond, B., Odlyzko, A., McKay, B.D.: Constant time generation of free trees. SIAM J. Comput.\u00a015(2), 540\u2013548 (1986)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"13_CR27","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1093\/ietfec\/e90-a.5.888","volume":"E90-A","author":"K. Yamanaka","year":"2007","unstructured":"Yamanaka, K., Kawano, S., Kikuchi, Y., Nakano, S.: Constant time generation of integer partitions. IEICE Trans. Fundamentals\u00a0E90-A(5), 888\u2013895 (2007)","journal-title":"IEICE Trans. Fundamentals"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-77891-2_20","volume-title":"WALCOM: Algorithms and Computation","author":"K. Yamanaka","year":"2008","unstructured":"Yamanaka, K., Nakano, S.: Listing all plane graphs. In: Nakano, S.-i., Rahman, M. S. (eds.) WALCOM 2008. LNCS, vol.\u00a04921, pp. 210\u2013221. Springer, Heidelberg (2008)"},{"issue":"1","key":"13_CR29","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0208006","volume":"8","author":"S. Zaks","year":"1979","unstructured":"Zaks, S., Richards, D.: Generating trees and other combinatorial objects lexicographically. SIAM J. Comput.\u00a08(1), 73\u201381 (1979)","journal-title":"SIAM J. Comput."},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/00207169808804755","volume":"70","author":"A. Zoghbi","year":"1998","unstructured":"Zoghbi, A., Stojmenovi\u0107, I.: Fast algorithms for generating integer partitions. Int. J. Comput. Math.\u00a070, 319\u2013332 (1998)","journal-title":"Int. J. Comput. Math."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T07:41:06Z","timestamp":1551771666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}