{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:33Z","timestamp":1771036353877,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"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":7382,"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":[[1993,5]]},"DOI":"10.1016\/0166-218x(93)90171-j","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"97-101","source":"Crossref","is-referenced-by-count":54,"title":["Tree-width, path-width, and cutwidth"],"prefix":"10.1016","volume":"43","author":[{"given":"Ephraim","family":"Korach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nir","family":"Solel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90171-J_BIB1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a K-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(93)90171-J_BIB2","first-page":"116","article-title":"Classes of graphs with bounded tree-width","author":"Bodlaender","year":"1988","journal-title":"Bulletin of EATCS"},{"key":"10.1016\/0166-218X(93)90171-J_BIB3","article-title":"Dynamic programming on graphs with bounded tree-width","volume":"317","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0166-218X(93)90171-J_BIB4","article-title":"Improved self-reduction algorithms for graphs with bounded tree-width","volume":"411","author":"Bodlaender","year":"1989"},{"key":"10.1016\/0166-218X(93)90171-J_BIB5","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/0214013","article-title":"Polynomial algorithms for the min-cut linear arrangement problem on degree restricted trees","volume":"14","author":"Chung","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)90171-J_BIB6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0012-365X(89)90083-6","article-title":"Graphs with small bandwidth and cutwidth","volume":"75","author":"Chung","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(93)90171-J_BIB7","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(93)90171-J_BIB8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0603010","article-title":"Upper and lower bounds on the complexity of the min cut linear arrangement problem on trees","volume":"3","author":"Lengauer","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(93)90171-J_BIB9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(89)90016-4","article-title":"On minimizing width in linear layouts","volume":"23","author":"Makedon","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(93)90171-J_BIB10","article-title":"On the complexity of finding iso- and other morphisms for partial k-trees","author":"Matousek","year":"1988","journal-title":"Manuscript"},{"key":"10.1016\/0166-218X(93)90171-J_BIB11","article-title":"Min-cut is NP-complete for edge weighted trees","volume":"226","author":"Monien","year":"1986"},{"key":"10.1016\/0166-218X(93)90171-J_BIB12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors I. Excluding a forest","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(93)90171-J_BIB13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors II. Algorithmic aspects of tree width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)90171-J_BIB14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0095-8956(90)90120-O","article-title":"Graph minors IV. Tree-width and well-quasi-ordering","volume":"48","author":"Robertson","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(93)90171-J_BIB15","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1145\/4221.4228","article-title":"A polynomial algorithm for the min cut linear arrangement of trees","volume":"32","author":"Yannakakis","year":"1985","journal-title":"J. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390171J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390171J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:25:02Z","timestamp":1555136702000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390171J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["0166218X9390171J"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90171-j","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}