{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:23Z","timestamp":1773376943080,"version":"3.50.1"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195481","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Hamiltonian Decompositions of Complete $\\$\\mathrm{K}{\\$}$-Uniform Hypergraphs"],"prefix":"10.1109","author":[{"given":"Javad","family":"Maheri","sequence":"first","affiliation":[{"name":"Communication Systems Department Eurecom,Sophia Antipolis,France,06410"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petros","family":"Elia","sequence":"additional","affiliation":[{"name":"Communication Systems Department Eurecom,Sophia Antipolis,France,06410"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127905"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262760"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206719"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3355234"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2967753"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053372"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619106"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.23919\/WIOPT.2017.7959863"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3015348"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437333"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3373128"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3283967"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/e26060448"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC60668.2024.10694316"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02026-1_21"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626498000389"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.830937"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934919"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.81"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536465"},{"key":"ref21","first-page":"217","article-title":"A fault-tolerant hamiltonian-based odd-even routing algorithm for network-on-chip","volume-title":"2020 35th International Technical Conference on Circuits\/Systems, Computers and Communications (ITC-CSCC)","author":"Hu","year":"2020"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70494-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.03.047"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.114197"},{"key":"ref25","first-page":"39","article-title":"Hy-pergraphes hamiltoniens","volume":"260","author":"Bermond","year":"1978","journal-title":"Problemes combinatoires et theorie des graphes, Colloque International CNRS, 260"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)00572-9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2014.04.010"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90044-1"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1525\/9780520319875-014"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4842-8_27"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-37.121.1"},{"issue":"52","key":"ref32","first-page":"7","article-title":"The wonderful walecki construction","volume":"52","author":"Alspach","year":"2008","journal-title":"Bull. Inst. Combin. Appl"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.07.043"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511734885.004"},{"key":"ref35","first-page":"291","article-title":"Decomposing complete 3-uniform hyper-graphs into hamiltonian cycles","volume":"45","author":"Meszka","year":"2009","journal-title":"Australas. J Comb."},{"key":"ref36","first-page":"965","article-title":"Jirimutu: Decomposing the complete 3-uniform hypergraphs k3n into hamiltonian cycles","volume":"58","author":"Huo","year":"2015","journal-title":"Acta Math. Sin. (Chin. Ser.)"},{"key":"ref37","article-title":"Graphes et hypergraphes, volume 37 of monographie univer-sitaire de mathematique","author":"Berge","year":"1970","journal-title":"Dunod, Paris"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195481.pdf?arnumber=11195481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:29Z","timestamp":1773347369000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195481\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195481","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}