{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:18:40Z","timestamp":1781259520729,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":8052,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1016\/0095-8956(91)90068-u","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"274-283","source":"Crossref","is-referenced-by-count":87,"title":["Quickly excluding a forest"],"prefix":"10.1016","volume":"52","author":[{"given":"Dan","family":"Bienstock","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neil","family":"Robertson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robin","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(91)90068-U_BIB1","doi-asserted-by":"crossref","unstructured":"D. Bienstock and P. D. Seymour, Monotonicity in graph searching, J. Algorithms, to appear.","DOI":"10.1016\/0196-6774(91)90003-H"},{"key":"10.1016\/0095-8956(91)90068-U_BIB2","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\/0095-8956(91)90068-U_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\/0095-8956(91)90068-U_BIB4","author":"LaPaugh","year":"1982"},{"key":"10.1016\/0095-8956(91)90068-U_BIB5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors. 1. Excluding a forest","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90068-U_BIB6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","article-title":"Graph minors. X. Obstructions to tree-decomposition","volume":"52","author":"Robertson","year":"1991","journal-title":"J. Comb. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90068-U_BIB7","unstructured":"P. D. Seymour and Robin Thomas, Graph searching, and a minimax theorem for tree-width, submitted for publication."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569190068U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569190068U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:51:27Z","timestamp":1548759087000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589569190068U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["009589569190068U"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(91)90068-u","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}