{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:45Z","timestamp":1771036365746,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0020-0190(92)90234-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"345-350","source":"Crossref","is-referenced-by-count":158,"title":["The vertex separation number of a graph equals its path-width"],"prefix":"10.1016","volume":"42","author":[{"given":"Nancy G.","family":"Kinnersley","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90234-M_BIB1","first-page":"397","article-title":"On finding obstruction sets and polynomialtime algorithms for gate matrix layout","author":"Bryant","year":"1987","journal-title":"Proc. 25th Allerton Conf. on Communication, Control, and Computing"},{"key":"10.1016\/0020-0190(92)90234-M_BIB2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/TCAD.1987.1270248","article-title":"Exact and approximate solutions for the gate matrix layout problem","volume":"6","author":"Deo","year":"1987","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/0020-0190(92)90234-M_BIB3","series-title":"Tech. Rept. DCS-66-IR","article-title":"Graph separation and search number","author":"Ellis","year":"1987"},{"key":"10.1016\/0020-0190(92)90234-M_BIB4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(87)90054-8","article-title":"Nonconstructive advances in polynomial-time complexity","volume":"26","author":"Fellows","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90234-M_BIB5","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1145\/44483.44491","article-title":"Nonconstructive tools for proving polynomial-time decidability","volume":"35","author":"Fellows","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(92)90234-M_BIB6","first-page":"501","article-title":"On search, decision and the efficiency of polynomial-time algorithms","author":"Fellows","year":"1989","journal-title":"Proc. 21st ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0020-0190(92)90234-M_BIB7","series-title":"Ph.D. Thesis","article-title":"Obstruction set isolation for layout permutation problems","author":"Kinnersley","year":"1989"},{"key":"10.1016\/0020-0190(92)90234-M_BIB8","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\/0020-0190(92)90234-M_BIB9","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."},{"key":"10.1016\/0020-0190(92)90234-M_BIB10","series-title":"Tech. Rept.","article-title":"Recontamination does not help to search a graph","author":"LaPaugh","year":"1983"},{"key":"10.1016\/0020-0190(92)90234-M_BIB11","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF00264496","article-title":"Black-White Pebbles and Graph Separation","volume":"16","author":"Lengauer","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(92)90234-M_BIB12","series-title":"Theory and Application of Graphs","first-page":"426","article-title":"Pursuit-evasion in a graph","author":"Parsons","year":"1976"},{"key":"10.1016\/0020-0190(92)90234-M_BIB13","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0606030","article-title":"Disjoint paths - A survey","volume":"6","author":"Robertson","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0020-0190(92)90234-M_BIB14","series-title":"Surveys in Combinatorics","first-page":"153","article-title":"Graph minors - A survey","author":"Robertson","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290234M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290234M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:48Z","timestamp":1555144068000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290234M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["002001909290234M"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90234-m","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}