{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T20:36:06Z","timestamp":1774730166485,"version":"3.50.1"},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"DOI":"10.1093\/comjnl\/bxm037","type":"journal-article","created":{"date-parts":[[2007,7,19]],"date-time":"2007-07-19T20:24:09Z","timestamp":1184876649000},"page":"255-269","source":"Crossref","is-referenced-by-count":169,"title":["Combinatorial Optimization on Graphs of Bounded Treewidth"],"prefix":"10.1093","volume":"51","author":[{"given":"H. L.","family":"Bodlaender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. M. C. A.","family":"Koster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2007,11,23]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/51\/3\/255\/1136951\/bxm037.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T22:37:54Z","timestamp":1503441474000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxm037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,23]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2007,11,23]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxm037","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,23]]}}}