{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T08:46:46Z","timestamp":1771145206975,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":6772,"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":[[1995,1]]},"DOI":"10.1016\/0304-3975(94)00160-k","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"253-268","source":"Crossref","is-referenced-by-count":39,"title":["Mixed searching and proper-path-width"],"prefix":"10.1016","volume":"137","author":[{"given":"Atsushi","family":"Takahashi","sequence":"first","affiliation":[]},{"given":"Shuichi","family":"Ueno","sequence":"additional","affiliation":[]},{"given":"Yoji","family":"Kajitani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00160-K_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\/0304-3975(94)00160-K_BIB2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","article-title":"Monotonicity in graph searching","volume":"12","author":"Bienstock","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)00160-K_BIB3","series-title":"Proc. Workshop on Graph-Theoretic Concepts in Computer Science WG '89","first-page":"232","article-title":"Improved self-reduction algorithms for graphs with bounded treewidth","volume":"Vol. 411","author":"Bodlaender","year":"1989"},{"key":"10.1016\/0304-3975(94)00160-K_BIB4","series-title":"Proc. 18th Internat. coll. on Automata, Languages and Programming","first-page":"544","article-title":"Better algorithm for the pathwidth and treewidth of graphs","volume":"Vol. 510","author":"Bodlaender","year":"1991"},{"key":"10.1016\/0304-3975(94)00160-K_BIB5","first-page":"72","article-title":"An intuitive approach to speleotopology","volume":"6","author":"Breisch","year":"1967"},{"key":"10.1016\/0304-3975(94)00160-K_BIB6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0196-6774(87)90043-5","article-title":"The NP-completeness column: an ongoing guide","volume":"8","author":"Johnson","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)00160-K_BIB7","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\/0304-3975(94)00160-K_BIB8","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\/0304-3975(94)00160-K_BIB9","doi-asserted-by":"crossref","first-page":"224","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\/0304-3975(94)00160-K_BIB10","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\/0304-3975(94)00160-K_BIB11","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\/0304-3975(94)00160-K_BIB12","series-title":"Proc. Internat. Conf. on Theory and Applications of Graphs","first-page":"426","article-title":"Pursuit-evasion in a graph","volume":"Vol. 642","author":"Parsons","year":"1976"},{"key":"10.1016\/0304-3975(94)00160-K_BIB13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors. I. Excluding a forest","volume":"B35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/0304-3975(94)00160-K_BIB14","series-title":"Graph minors. XIII. The disjoint paths problem","author":"Robertson","year":"1986"},{"key":"10.1016\/0304-3975(94)00160-K_BIB15","series-title":"Graph minors. XVI. Wagner's conjecture","author":"Robertson","year":"1987"},{"key":"10.1016\/0304-3975(94)00160-K_BIB16","series-title":"Topics in Combinatorics and Graph Theory","first-page":"613","article-title":"A linear algorithm for the pathwidth of trees","author":"Scheffer","year":"1990"},{"key":"10.1016\/0304-3975(94)00160-K_BIB17","series-title":"Proc. 2nd Karuizawa Workshop on Circuits and Systems","first-page":"414","article-title":"On some problems of graphs \u2014 including Kajitani's conjecture and its solution","author":"Shinoda","year":"1989"},{"key":"10.1016\/0304-3975(94)00160-K_BIB18","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(94)90092-2","article-title":"Minimal acyclic forbidden minors for the family of graphs with bounded path-width","volume":"127","author":"Takahashi","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(94)00160-K_BIB19","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54945-5_50","article-title":"Mixed-searching and proper-path-width","author":"Takahashi","year":"1991"},{"key":"10.1016\/0304-3975(94)00160-K_BIB20","series-title":"Proc. 2nd Internat. Symp. on Algorithms","first-page":"61","article-title":"Mixed-searching and proper-path-width","volume":"Vol. 557","author":"Takahashi","year":"1991"},{"key":"10.1016\/0304-3975(94)00160-K_BIB21","article-title":"On the proper-path-decomposition of trees","author":"Takahashi","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400160K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400160K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:27:08Z","timestamp":1555403228000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400160K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["030439759400160K"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00160-k","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}