{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T09:08:20Z","timestamp":1786525700354,"version":"3.56.0"},"reference-count":3,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":5556,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0012-365x(97)00239-2","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"289-293","source":"Crossref","is-referenced-by-count":11,"title":["On embedding complete graphs into hypercubes"],"prefix":"10.1016","volume":"186","author":[{"given":"Michael","family":"Klugerman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Russell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ravi","family":"Sundaram","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00239-2_BIB1","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0095-8956(92)90024-R","article-title":"An \u2018average distance\u2019 inequality for large subsets of the cube","volume":"56","author":"Althofer","year":"1992","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(97)00239-2_BIB2_1","series-title":"Proc. 24th Ann. ACM Symp. on the Theory of Computing","first-page":"241","article-title":"The complexity of multiway cuts","author":"Dahlhaus","year":"1992"},{"issue":"4","key":"10.1016\/S0012-365X(97)00239-2_BIB2_2","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539792225297","article-title":"Journal version The complexity of multiterminal cuts","volume":"23","author":"Dahlhaus","year":"1994","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002392?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002392?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:28:03Z","timestamp":1555982883000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97002392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":3,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0012365X97002392"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00239-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}