{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T15:50:52Z","timestamp":1782489052477,"version":"3.54.5"},"reference-count":24,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.disc.2026.115294","type":"journal-article","created":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T13:09:37Z","timestamp":1782220177000},"page":"115294","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universal cycle constructions for k-subsets and k-multisets"],"prefix":"10.1016","volume":"349","author":[{"given":"Colin","family":"Campbell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lukas","family":"Janik-Jones","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7364-2993","authenticated-orcid":false,"given":"Joe","family":"Sawada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.disc.2026.115294_br0010","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1137\/100805674","article-title":"On universal cycles for new classes of combinatorial structures","volume":"25","author":"Blanca","year":"2011","journal-title":"SIAM J. Discrete Math."},{"issue":"4\/5","key":"10.1016\/j.disc.2026.115294_br0020","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","article-title":"Lexicographically least circular substrings","volume":"10","author":"Booth","year":"1980","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.disc.2026.115294_br0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.aam.2021.102166","article-title":"Graph universal cycles of combinatorial objects","volume":"127","author":"Cantwell","year":"2021","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/j.disc.2026.115294_br0060","series-title":"Multiset Combinatorial Gray Codes with Application to Proximity Sensor Networks","author":"Chen","year":"2024"},{"issue":"1","key":"10.1016\/j.disc.2026.115294_br0030","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","article-title":"Universal cycles for combinatorial structures","volume":"110","author":"Chung","year":"1992","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.disc.2026.115294_br0050","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1137\/080735795","article-title":"Near-universal cycles for subsets exist","volume":"23","author":"Curtis","year":"2009","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"10.1016\/j.disc.2026.115294_br0090","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1007\/s00373-016-1727-6","article-title":"Universal cycle packings and coverings for k-subsets of an n-set","volume":"32","author":"Debski","year":"2016","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115294_br0080","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejc.2018.03.006","article-title":"Constructing de Bruijn sequences with co-lexicographic order: the k-ary Grandmama sequence","volume":"72","author":"Dragon","year":"2018","journal-title":"Eur. J. Comb."},{"issue":"1","key":"10.1016\/j.disc.2026.115294_br0110","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1109\/TIT.2019.2928292","article-title":"A successor rule framework for constructing k-ary de Bruijn sequences and universal cycles","volume":"66","author":"Gabric","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"10.1016\/j.disc.2026.115294_br0100","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/s00493-020-4046-8","article-title":"Euler tours in hypergraphs","volume":"40","author":"Glock","year":"2020","journal-title":"Combinatorica"},{"issue":"4","key":"10.1016\/j.disc.2026.115294_br0130","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1137\/S0895480191220861","article-title":"On universal cycles for k-subsets of an n-set","volume":"7","author":"Hurlbert","year":"1994","journal-title":"SIAM J. Discrete Math."},{"issue":"17","key":"10.1016\/j.disc.2026.115294_br0120","doi-asserted-by":"crossref","first-page":"5321","DOI":"10.1016\/j.disc.2008.04.050","article-title":"On universal cycles for multisets","volume":"309","author":"Hurlbert","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115294_br0140","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0012-365X(93)90330-V","article-title":"Universal cycles of k-subsets and k-permutations","volume":"117","author":"Jackson","year":"1993","journal-title":"Discrete Math."},{"issue":"17","key":"10.1016\/j.disc.2026.115294_br0150","doi-asserted-by":"crossref","first-page":"5341","DOI":"10.1016\/j.disc.2009.04.002","article-title":"Research problems on Gray codes and universal cycles","volume":"309","author":"Jackson","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115294_br0160","series-title":"Universal Cycles for k-Subsets of an n-Set","author":"Lanius","year":"2012"},{"key":"10.1016\/j.disc.2026.115294_br0180","doi-asserted-by":"crossref","first-page":"P18","DOI":"10.37236\/2852","article-title":"An inductive approach to constructing universal cycles on the k-subsets of [n]","volume":"20","author":"Rudoy","year":"2013","journal-title":"Electron. J. Comb."},{"issue":"2","key":"10.1016\/j.disc.2026.115294_br0170","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/100808782","article-title":"De Bruijn sequences for fixed-weight binary strings","volume":"26","author":"Ruskey","year":"2012","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115294_br0210","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.tcs.2012.01.013","article-title":"A Gray code for fixed-density necklaces and Lyndon words in constant amortized time","volume":"502","author":"Sawada","year":"2013","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"10.1016\/j.disc.2026.115294_br0220","doi-asserted-by":"crossref","first-page":"1754","DOI":"10.1007\/s00453-022-01047-2","article-title":"Constructing the first (and coolest) fixed-content universal cycle","volume":"85","author":"Sawada","year":"2023","journal-title":"Algorithmica"},{"key":"10.1016\/j.disc.2026.115294_br0230","series-title":"Combinatorial Algorithms - 24th International Workshop","first-page":"388","article-title":"Universal cycles for weight-range binary strings","volume":"vol. 8288","author":"Sawada","year":"2013"},{"key":"10.1016\/j.disc.2026.115294_br0240","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.jda.2014.06.003","article-title":"The lexicographically smallest universal cycle for binary strings with minimum specified weight","volume":"28","author":"Sawada","year":"2014","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"10.1016\/j.disc.2026.115294_br0250","article-title":"Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles","volume":"23","author":"Sawada","year":"2016","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2026.115294_br0200","article-title":"Concatenation trees: a framework for efficient universal cycle and de Bruijn sequence constructions","author":"Sawada","year":"2026","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115294_br0190","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0012-365X(02)00298-4","article-title":"Solution of an outstanding conjecture: the non-existence of universal cycles with k=n\u22122","volume":"258","author":"Stevens","year":"2002","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26003183?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26003183?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T15:18:28Z","timestamp":1782487108000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26003183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["S0012365X26003183"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115294","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Universal cycle constructions for k-subsets and k-multisets","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115294","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115294"}}