{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:05:51Z","timestamp":1648667151606},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00363-2","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"109-114","source":"Crossref","is-referenced-by-count":1,"title":["Minimal enumerations of subsets of a finite set and the middle level problem"],"prefix":"10.1016","volume":"114","author":[{"given":"A.A.","family":"Evdokimov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.L.","family":"Perezhogin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00363-2_BIB1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF00337620","article-title":"Lexicographic matchings cannot form Hamilton cycles","volume":"5\/2","author":"Duffus","year":"1988","journal-title":"Order"},{"key":"10.1016\/S0166-218X(00)00363-2_BIB2","unstructured":"A.A. Evdokimov, Maximal length of circuit in a unitary n-dimensional cube, Math. Notes 6 (1970) 642\u2013648 (translation from Math. Zametki 6 (1969) 309\u2013319)."},{"key":"10.1016\/S0166-218X(00)00363-2_BIB3","unstructured":"A.A. Evdokimov, On the enumeration of subsets of a finite set, Metody Diskretn. Anal. Novosibirsk 34 (1980) 8\u201326 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00363-2_BIB4","unstructured":"A.A. Evdokimov, Metric properties of embeddings and codes preserving distances, Tr. Inst. Mat. Novosibirsk 10 (1980) 116\u2013132 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00363-2_BIB5","unstructured":"A.A. Evdokimov, Embedding of chains and cycles in a hypercube, Metody Diskretn. Anal. Novosibirsk 50 (1990) 10\u201325 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00363-2_BIB6","unstructured":"A.A. Evdokimov, V.A. Krajnev, Problems of the completeness of words with prohibitions, Proceedings of XXII Regional Scientific and Technical Conference, Novosibirsk, 1979, pp. 105\u2013107 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00363-2_BIB7","unstructured":"A.A. Evdokimov, S.A. Malyugin, The code \u201cthe snake in a box\u201d and ways in a lattice on a torus, Math. Today Kiev (1987) 108\u2013116 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00363-2_BIB8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00337621","article-title":"Explicit matchings in the middle levels of the Boolean lattice","volume":"5\/2","author":"Kierstead","year":"1988","journal-title":"Order"},{"key":"10.1016\/S0166-218X(00)00363-2_BIB9","unstructured":"W. Lipski, Kombinatoryka dla programistow, Warsawa, Wydawnictwa naukowo-techniczne, 1982 (in Polish)."},{"key":"10.1016\/S0166-218X(00)00363-2_BIB10","unstructured":"A.L. Perezhogin, On locally isometric coding of natural numbers, Discrete Anal. Oper. Res. 3\/4 (1996) 69\u201376 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00363-2_BIB11","unstructured":"E.M. Reincold, J. Nienergelt, N. Deo, Combinatorial algorithms, Theory and Practice, Prentice-Hall, Inc., Englewood Cliffs, NJ 07632, 1977."},{"key":"10.1016\/S0166-218X(00)00363-2_BIB12","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0097-3165(95)90091-8","article-title":"Monotone Gray codes and the middle levels problem","volume":"70\/2","author":"Savage","year":"1995","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0166-218X(00)00363-2_BIB13","first-page":"257","article-title":"The ranking problem of a Gray code for compositions","volume":"11","author":"van Zanten","year":"1995","journal-title":"Ars Combin."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003632?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003632?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T20:25:44Z","timestamp":1556223944000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00003632"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00363-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}