{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T02:36:35Z","timestamp":1648521395622},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,4]]},"abstract":"<jats:p> Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. This article discusses means by which loopless algorithms can be fused to produce a new loopless algorithm that solves the original problem. It demonstrates this method with two new loopless algorithms. The first generates well-formed parenthesis strings containing two different types of parentheses. The second generates multiset permutations in linear space using only arrays; it is simpler and more efficient than the recent algorithm of Korsh &amp; LaFollette. <\/jats:p>","DOI":"10.1142\/s0129054107004681","type":"journal-article","created":{"date-parts":[[2007,4,10]],"date-time":"2007-04-10T11:26:04Z","timestamp":1176204364000},"page":"263-293","source":"Crossref","is-referenced-by-count":1,"title":["FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION"],"prefix":"10.1142","volume":"18","author":[{"given":"TADAO","family":"TAKAOKA","sequence":"first","affiliation":[{"name":"Department of Computer Science and Software Engineering, University of Canterbury, Private Bag 4800, Christchurch, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"STEPHEN","family":"VIOLICH","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Software Engineering, University of Canterbury, Private Bag 4800, Christchurch, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume-title":"Combinatorial Algorithms","author":"Nijenhuis A.","year":"1975"},{"key":"rf2","volume-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold E. M.","year":"1977"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970166"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144595295272"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1145\/321765.321781"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0889"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00228-7"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/47.5.612"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/44.4.292"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1145\/368637.368660"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1963-0159764-2"},{"key":"rf12","unstructured":"D. H.\u00a0Lehmer, Applied Combinatorial Mathematics, ed. E. F.\u00a0Beckenbach (Wiley, 1964)\u00a0pp. 5\u201331."},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90091-7"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01108590"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791202647"},{"key":"rf17","first-page":"215","volume":"69","author":"Chase P. J.","journal-title":"Congressus Numerantium"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054107004681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:42:19Z","timestamp":1565138539000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107004681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":16,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,4]]}},"alternative-id":["10.1142\/S0129054107004681"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107004681","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4]]}}}