{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T11:47:07Z","timestamp":1772020027990,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"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":[[1998,3]]},"DOI":"10.1016\/s0166-218x(97)00101-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:07:02Z","timestamp":1027624022000},"page":"21-29","source":"Crossref","is-referenced-by-count":28,"title":["Embedding ladders and caterpillars into the hypercube"],"prefix":"10.1016","volume":"83","author":[{"given":"Sergei","family":"Bezrukov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Unger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerd","family":"Wechsung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00101-7_BIB1","unstructured":"S.L. Bezrukov, B. Monien, W. Unger, G. Wechsung, Dense subsets and their use in embedding problems, Technical Report, University of Paderborn, to appear."},{"issue":"1","key":"10.1016\/S0166-218X(97)00101-7_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0221012","article-title":"Efficient embedding of trees in hypercube","volume":"21","author":"Bhatt","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00101-7_BIB3","article-title":"Spanning caterpillars of the hypercube","author":"Dvor\u0306\u00e1k","year":"1995"},{"key":"10.1016\/S0166-218X(97)00101-7_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(97)00101-7_BIB5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02090396","article-title":"Bandwidth minimization: an approximation algorithm for caterpillars","volume":"24","author":"Haralambides","year":"1991","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0166-218X(97)00101-7_BIB6","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0166-218X(97)00101-7_BIB7","first-page":"633","article-title":"Spanning subgraphs of a hypercube VI: survey and unsolved problems","volume":"vol. 2","author":"Harary","year":"1988"},{"key":"10.1016\/S0166-218X(97)00101-7_BIB8","first-page":"103","article-title":"On two-legged caterpillars which span hypercubes","volume":"66","author":"Harary","year":"1988"},{"key":"10.1016\/S0166-218X(97)00101-7_BIB9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(73)90067-8","article-title":"The number of caterpillars","volume":"6","author":"Harary","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(97)00101-7_BIB10","first-page":"135","article-title":"On hamiltonian circles and spanning trees of hypercube graphs","volume":"109","author":"Havel","year":"1984","journal-title":"C\u0306as. P\u00e9st. Mat."},{"key":"10.1016\/S0166-218X(97)00101-7_BIB11","series-title":"Topics in Combinatorics and Graph Theory","first-page":"353","article-title":"On certain trees in hypercube","author":"Havel","year":"1990"},{"key":"10.1016\/S0166-218X(97)00101-7_BIB12","unstructured":"I. Havel, J.-M. Laborde, P. Liebl, Caterpillar-like trees spanning hypercubes, C\u0306as. P\u00e9st. Mat., to appear."},{"key":"10.1016\/S0166-218X(97)00101-7_BIB13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/jgt.3190100110","article-title":"One-legged caterpillars span hypercubes","volume":"10","author":"Havel","year":"1986","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/S0166-218X(97)00101-7_BIB14","first-page":"50","article-title":"A determination of the number of caterpillars","volume":"9","author":"Lifschitz","year":"1985","journal-title":"Southeast Asian Bull. Math."},{"issue":"4","key":"10.1016\/S0166-218X(97)00101-7_BIB15","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0607057","article-title":"The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete","volume":"7","author":"Monien","year":"1986","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"10.1016\/S0166-218X(97)00101-7_BIB16","first-page":"170","article-title":"Simulating binary trees on hypercubes","volume":"vol. 319","author":"Monien","year":"1988"},{"key":"10.1016\/S0166-218X(97)00101-7_BIB17","first-page":"257","article-title":"Embedding one Interconnection Network in Another","volume":"7","author":"Monien","year":"1990","journal-title":"Computing"},{"key":"10.1016\/S0166-218X(97)00101-7_BIB18","article-title":"Embedding Trees into the Hypercube","author":"Wagner","year":"1987"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001017?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001017?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:50:09Z","timestamp":1555984209000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X97001017"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00101-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}