{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T10:21:59Z","timestamp":1769077319101,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0304-3975(94)00036-i","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"507-526","source":"Crossref","is-referenced-by-count":3,"title":["Two results on linear embeddings of complete binary trees"],"prefix":"10.1016","volume":"136","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00036-I_BIB1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(92)90252-B","article-title":"Fast geometric approximation techniques and geometric embedding problems","volume":"106","author":"Bern","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00036-I_BIB2","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/1020084","article-title":"A conjectured minimum valuation tree","volume":"20","author":"Chung","year":"1978","journal-title":"SIAM Rev."},{"key":"10.1016\/0304-3975(94)00036-I_BIB3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0898-1221(84)90085-3","article-title":"On optimal linear arrangements of trees","volume":"10","author":"Chung","year":"1984","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0304-3975(94)00036-I_BIB4","article-title":"NP-completeness of several arrangement problems","author":"Even","year":"1975"},{"key":"10.1016\/0304-3975(94)00036-I_BIB5","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(94)00036-I_BIB6","article-title":"Minimal placing of trees on a line","author":"Goldberg","year":"1976"},{"key":"10.1016\/0304-3975(94)00036-I_BIB7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/0208002","article-title":"A minimum linear arrangement algorithm for undirected trees","volume":"8","author":"Shiloach","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400036I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400036I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:52:23Z","timestamp":1555113143000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400036I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["030439759400036I"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00036-i","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}