{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:47:03Z","timestamp":1770972423604,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":[[1991,6]]},"DOI":"10.1016\/0196-6774(91)90003-h","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"239-245","source":"Crossref","is-referenced-by-count":183,"title":["Monotonicity in graph searching"],"prefix":"10.1016","volume":"12","author":[{"given":"D","family":"Bienstock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(91)90003-H_BIB1","doi-asserted-by":"crossref","unstructured":"D. Bienstock, N. Robertson, P. D. Seymour, and R. Thomas, Quickly excluding a forest, J. Combin. Theory Ser. B, to appear.","DOI":"10.1016\/0095-8956(91)90068-U"},{"issue":"No. 5","key":"10.1016\/0196-6774(91)90003-H_BIB2","first-page":"72","article-title":"An intuitive approach to speleotopology","volume":"6","author":"Breisch","year":"1967","journal-title":"Southwestern Cavers"},{"key":"10.1016\/0196-6774(91)90003-H_BIB3","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":"J. Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(91)90003-H_BIB4","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\/0196-6774(91)90003-H_BIB5","article-title":"Recontamination Does Not Help to Search a Graph","author":"LaPaugh","year":"1982"},{"key":"10.1016\/0196-6774(91)90003-H_BIB6","series-title":"Theory and Application of Graphs","first-page":"426","article-title":"Pursuit-evasion in a graph","author":"Parsons","year":"1976"},{"key":"10.1016\/0196-6774(91)90003-H_BIB7","doi-asserted-by":"crossref","unstructured":"N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, to appear.","DOI":"10.1016\/0095-8956(91)90061-N"},{"key":"10.1016\/0196-6774(91)90003-H_BIB8","series-title":"Graph searching, and a minimax theorem for tree-width","author":"Seymour","year":"1988"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190003H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190003H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:53:53Z","timestamp":1548744833000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749190003H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["019667749190003H"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(91)90003-h","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}