{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T21:50:34Z","timestamp":1785016234217,"version":"3.55.0"},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"DOI":"10.1093\/comjnl\/bxm048","type":"journal-article","created":{"date-parts":[[2007,7,29]],"date-time":"2007-07-29T00:18:21Z","timestamp":1185668301000},"page":"60-78","source":"Crossref","is-referenced-by-count":156,"title":["Parameterized Complexity and Approximation Algorithms"],"prefix":"10.1093","volume":"51","author":[{"given":"D.","family":"Marx","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2007,3,6]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/51\/1\/60\/1357220\/bxm048.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T10:16:23Z","timestamp":1503483383000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxm048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,6]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2007,3,6]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxm048","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,6]]}}}