{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:10Z","timestamp":1760202490604},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0196-6774(02)00225-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"40-59","source":"Crossref","is-referenced-by-count":30,"title":["Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time"],"prefix":"10.1016","volume":"47","author":[{"given":"Konstantin","family":"Skodinis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0196-6774(02)00225-0_BIB001","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","article-title":"A linear time algorithm for finding tree-decompositions of small treewidth","volume":"25","author":"Bodlaender","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00225-0_BIB002","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jagm.1996.0049","article-title":"Efficient and constructive algorithms for the pathwidth and treewidth of graphs","volume":"21","author":"Bodlaender","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(02)00225-0_BIB003","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/S089548019223992X","article-title":"Treewidth and pathwidth of permutation graphs","volume":"8","author":"Bodlaender","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0196-6774(02)00225-0_BIB004","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0406014","article-title":"The pathwidth and treewidth of cographs","volume":"6","author":"Bodlaender","year":"1993","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/S0196-6774(02)00225-0_BIB005","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\/S0196-6774(02)00225-0_BIB006","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0022-0000(76)80048-7","article-title":"Storage requirements for deterministic polynomial finite recognizable languages","volume":"13","author":"Cook","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0196-6774(02)00225-0_BIB007","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1006\/inco.1994.1064","article-title":"The vertex separation and search number of a graph","volume":"113","author":"Ellis","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0196-6774(02)00225-0_BIB008","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(93)90012-D","article-title":"On the pathwidth of chordal graphs","volume":"45","author":"Gustedt","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0196-6774(02)00225-0_BIB009","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","article-title":"The vertex separation number of a graph equals its path-width","volume":"142","author":"Kinnersley","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0196-6774(02)00225-0_BIB010","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","article-title":"Interval graphs and searching","volume":"55","author":"Kirousis","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-6774(02)00225-0_BIB011","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","article-title":"Searching and pebbling","volume":"47","author":"Kirousis","year":"1986","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0196-6774(02)00225-0_BIB012","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1145\/151261.151263","article-title":"Recontamination does not help to search a graph","volume":"40","author":"LaPaugh","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0196-6774(02)00225-0_BIB013","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF00264496","article-title":"Black\u2013white pebbles and graph separation","volume":"16","author":"Lengauer","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/S0196-6774(02)00225-0_BIB014","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."},{"issue":"1","key":"10.1016\/S0196-6774(02)00225-0_BIB015","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/42267.42268","article-title":"The complexity of searching a graph","volume":"35","author":"Megiddo","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0196-6774(02)00225-0_BIB016","series-title":"Computational Graph Theory","first-page":"17","article-title":"Graph problems related to gate matrix layout and PLA folding","author":"M\u00f6hring","year":"1990"},{"key":"10.1016\/S0196-6774(02)00225-0_BIB017","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(88)90028-X","article-title":"Min cut is NP-complete for edge weighted trees","volume":"58","author":"Monien","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-6774(02)00225-0_BIB018","series-title":"Theory and Applications of Graphs","first-page":"426","article-title":"Pursuit-evasion in a graph","author":"Parsons","year":"1976"},{"key":"10.1016\/S0196-6774(02)00225-0_BIB019","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\/S0196-6774(02)00225-0_BIB020","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0606030","article-title":"Disjoint paths\u2014A survey","volume":"6","author":"Robertson","year":"1985","journal-title":"SIAM J. Algebra Discrete Methods"},{"issue":"4","key":"10.1016\/S0196-6774(02)00225-0_BIB021","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":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402002250?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402002250?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T19:27:50Z","timestamp":1553196470000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677402002250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0196677402002250"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(02)00225-0","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}