{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:07Z","timestamp":1740122467615,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["108-2115-M-262-001","107-2221-E-141-002"],"award-info":[{"award-number":["108-2115-M-262-001","107-2221-E-141-002"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["107-2221-E-141-001-MY3"],"award-info":[{"award-number":["107-2221-E-141-001-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-019-00469-z","type":"journal-article","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T22:02:45Z","timestamp":1573509765000},"page":"1495-1510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved algorithms for ranking and unranking (k,\u00a0m)-ary trees in B-order"],"prefix":"10.1007","volume":"44","author":[{"given":"Yu-Hsuan","family":"Chang","sequence":"first","affiliation":[]},{"given":"Ro-Yu","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Ruay-Shiung","family":"Chang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9542-7968","authenticated-orcid":false,"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"469_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.akcej.2018.01.019","volume":"15","author":"M Amani","year":"2018","unstructured":"Amani M (2018) Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees. AKCE Int J Graphs Comb 15:14\u201321","journal-title":"AKCE Int J Graphs Comb"},{"key":"469_CR2","first-page":"19","volume":"20","author":"M Amani","year":"2015","unstructured":"Amani M, Nowzari-Dalini A (2015a) Ranking and unranking algorithm for neuronal trees in B-order. J Phys Sci 20:19\u201334","journal-title":"J Phys Sci"},{"key":"469_CR3","doi-asserted-by":"crossref","unstructured":"Amani M, Nowzari-Dalini A (2015b) Generation, ranking and unranking of ordered trees with degree bounds. In: Proceedings of DCM 2015, Electronic proceedings in theoretical computer science, vol 204, pp 31\u201345","DOI":"10.4204\/EPTCS.204.4"},{"issue":"4","key":"469_CR4","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1007\/s41980-018-0190-y","volume":"45","author":"M Amani","year":"2019","unstructured":"Amani M, Nowzari-Dalini A (2019) Efficient generation, ranking, and unranking of $$(k, m)$$-ary trees in B-order. Bull Iranian Math Soc 45(4):1145\u20131158","journal-title":"Bull Iranian Math Soc"},{"key":"469_CR5","first-page":"1428","volume":"33","author":"M Amani","year":"2014","unstructured":"Amani M, Nowzari-Dalini A, Ahrabian H (2014) Generation of neuronal trees by a new three letters encoding. Comput Inf J 33:1428\u20131450","journal-title":"Comput Inf J"},{"key":"469_CR6","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1016\/j.ejc.2006.01.011","volume":"28","author":"RRX Du","year":"2007","unstructured":"Du RRX, Liu F (2007) $$(k, m)$$-Catalan numbers and hook length polynomials for plane trees. Eur J Comb 28:1312\u20131321","journal-title":"Eur J Comb"},{"key":"469_CR7","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/0215073","volume":"15","author":"L Li","year":"1986","unstructured":"Li L (1986) Ranking and unranking AVL trees. SIAM J Comput 15:1025\u20131035","journal-title":"SIAM J Comput"},{"key":"469_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.dam.2018.09.035","volume":"268","author":"K-J Pai","year":"2019","unstructured":"Pai K-J, Chang J-M, Wu R-Y, Chang S-C (2019) Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order. Discrete Appl Math 268:223\u2013236","journal-title":"Discrete Appl Math"},{"key":"469_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1080\/00207168708803562","volume":"21","author":"J Pallo","year":"1987","unstructured":"Pallo J (1987) Generating trees with $$n$$ nodes and $$m$$ leaves. Int J Comput Math 21:133\u2013144","journal-title":"Int J Comput Math"},{"key":"469_CR10","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1080\/00207160802140049","volume":"87","author":"E Seyedi-Tabari","year":"2010","unstructured":"Seyedi-Tabari E, Ahrabian H, Nowzari-Dalini A (2010) A new algorithm for generation of different types of RNA. Int J Comput Math 87:1197\u20131207","journal-title":"Int J Comput Math"},{"key":"469_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative combinatorics","author":"RP Stanley","year":"1999","unstructured":"Stanley RP (1999) Enumerative combinatorics, vol 2. Cambridge University Press, Cambridge"},{"key":"469_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.tcs.2006.01.022","volume":"355","author":"R-Y Wu","year":"2006","unstructured":"Wu R-Y, Chang J-M, Wang Y-L (2006) A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations. Theor Comput Sci 355:303\u2013314","journal-title":"Theor Comput Sci"},{"key":"469_CR13","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1093\/comjnl\/bxp015","volume":"53","author":"R-Y Wu","year":"2010","unstructured":"Wu R-Y, Chang J-M, Wang Y-L (2010) Loopless generation of non-regular trees with a prescribed branching sequence. Comput J 53:661\u2013666","journal-title":"Comput J"},{"key":"469_CR14","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1016\/j.mcm.2010.12.019","volume":"53","author":"R-Y Wu","year":"2011","unstructured":"Wu R-Y, Chang J-M, Chang C-H (2011a) Ranking and unranking of non-regular trees with a prescribed branching sequence. Math Comput Model 53:1331\u20131335","journal-title":"Math Comput Model"},{"key":"469_CR15","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1587\/transinf.E94.D.226","volume":"E94\u2013D","author":"R-Y Wu","year":"2011","unstructured":"Wu R-Y, Chang J-M, Wang Y-L (2011b) Ranking and unranking of $$t$$-ary trees using RD-sequences. IEICE Trans Inf Syst E94\u2013D:226\u2013232","journal-title":"IEICE Trans Inf Syst"},{"key":"469_CR16","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1093\/comjnl\/bxs143","volume":"56","author":"R-Y Wu","year":"2013","unstructured":"Wu R-Y, Chang J-M, Chen A-H, Liu C-L (2013) Ranking and unranking $$t$$-ary trees in a Gray-code order. Comput J 56:1388\u20131395","journal-title":"Comput J"},{"key":"469_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2014.07.030","volume":"556","author":"R-Y Wu","year":"2014","unstructured":"Wu R-Y, Chang J-M, Chan H-C, Pai K-J (2014) A loopless algorithm for generating multiple binary tree sequences simultaneously. Theor Comput Sci 556:25\u201333","journal-title":"Theor Comput Sci"},{"key":"469_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S Zaks","year":"1980","unstructured":"Zaks S (1980) Lexicographic generation of ordered trees. Theor Comput Sci 10:63\u201382","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00469-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-019-00469-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00469-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:43:45Z","timestamp":1664354625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-019-00469-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["469"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00469-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"11 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}