{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T11:05:36Z","timestamp":1756811136089,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030271947"},{"type":"electronic","value":"9783030271954"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-27195-4_2","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:03:14Z","timestamp":1564650194000},"page":"16-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Algorithms for Ranking and Unranking (k,\u00a0m)-Ary Trees"],"prefix":"10.1007","author":[{"given":"Yu-Hsuan","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ro-Yu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruay-Shiung","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"key":"2_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.: Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees. AKCE Int. J. Graphs Comb. 15, 14\u201321 (2018)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Amani, M., Nowzari-Dalini, A.: Efficient generation, ranking, and unranking of $$(k,m)$$-ary trees in B-order. Bull. Iranian Math. Soc. (2019). https:\/\/doi.org\/10.1007\/s41980-018-0190-y","DOI":"10.1007\/s41980-018-0190-y"},{"key":"2_CR3","first-page":"19","volume":"20","author":"M Amani","year":"2015","unstructured":"Amani, M., Nowzari-Dalini, A.: Ranking and unranking algorithm for neuronal trees in B-order. J. Phys. Sci. 20, 19\u201334 (2015)","journal-title":"J. Phys. Sci."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.4204\/EPTCS.204.4","volume":"204","author":"Mahdi Amani","year":"2016","unstructured":"Amani, M., Nowzari-Dalini, A.: 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 (2015)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"2_CR5","first-page":"1428","volume":"33","author":"M Amani","year":"2014","unstructured":"Amani, M., Nowzari-Dalini, A., Ahrabian, H.: Generation of neuronal trees by a new three letters encoding. Comput. Inform. J. 33, 1428\u20131450 (2014)","journal-title":"Comput. Inform. J."},{"key":"2_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, R.R.X., Liu, F.: $$(k, m)$$-Catalan numbers and hook length polynomials for plane trees. Euro. J. Combin. 28, 1312\u20131321 (2007)","journal-title":"Euro. J. Combin."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/0215073","volume":"15","author":"L Li","year":"1986","unstructured":"Li, L.: Ranking and unranking AVL trees. SIAM J. Comput. 15, 1025\u20131035 (1986)","journal-title":"SIAM J. Comput."},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Pai, K.-J., Chang, J.-M., Wu, R.-Y., Chang, S.-C.: Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order. Discrete Appl. Math. (2018). https:\/\/doi.org\/10.1016\/j.dam.2018.09.035","DOI":"10.1016\/j.dam.2018.09.035"},{"key":"2_CR9","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. Int. J. Comput. Math. 21, 133\u2013144 (1987)","journal-title":"Int. J. Comput. Math."},{"key":"2_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.: A new algorithm for generation of different types of RNA. Int. J. Comput. Math. 87, 1197\u20131207 (2010)","journal-title":"Int. J. Comput. Math."},{"key":"2_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative Combinatorics","author":"RP Stanley","year":"1999","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol. 2. Cambridge University Press, Cambridge (1999)"},{"key":"2_CR12","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.: A loopless algorithm for generating multiple binary tree sequences simultaneously. Theor. Comput. Sci. 556, 25\u201333 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR13","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.: Ranking and unranking of non-regular trees with a prescribed branching sequence. Math. Comput. Model. 53, 1331\u20131335 (2011)","journal-title":"Math. Comput. Model."},{"key":"2_CR14","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.: Ranking and unranking $$t$$-ary trees in a Gray-code order. Comput. J. 56, 1388\u20131395 (2013)","journal-title":"Comput. J."},{"key":"2_CR15","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.: A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations. Theor. Comput. Sci. 355, 303\u2013314 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR16","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.: Loopless generation of non-regular trees with a prescribed branching sequence. Comput. J. 53, 661\u2013666 (2010)","journal-title":"Comput. J."},{"key":"2_CR17","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.: Ranking and unranking of $$t$$-ary trees using RD-sequences. IEICE Trans. Inform. Syst. E94\u2013D, 226\u2013232 (2011)","journal-title":"IEICE Trans. Inform. Syst."},{"key":"2_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.: Lexicographic generation of ordered trees. Theor. Comput. Sci. 10, 63\u201382 (1980)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27195-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:15:44Z","timestamp":1709824544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27195-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271947","9783030271954"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27195-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/theory.ict.ac.cn\/aaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}