{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:44Z","timestamp":1759847684064},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":3760,"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":[[2003,4]]},"DOI":"10.1016\/s0304-3975(02)00811-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"317-324","source":"Crossref","is-referenced-by-count":20,"title":["On the parametric complexity of schedules to minimize tardy tasks"],"prefix":"10.1016","volume":"298","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"McCartin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00811-3_BIB1","unstructured":"G. Brightwell, Graphs and Partial Orders. London School of Economics, Mathematics Preprint Series, 1994."},{"key":"10.1016\/S0304-3975(02)00811-3_BIB2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s001530050069","article-title":"The parameterized complexity of short computation and factorization","volume":"36","author":"Cai","year":"1997","journal-title":"Arch. Math Logic"},{"key":"10.1016\/S0304-3975(02)00811-3_BIB3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0168-0072(95)00020-8","article-title":"Advice classes of parameterized tractability","volume":"84","author":"Cai","year":"1997","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(02)00811-3_BIB4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. Math."},{"key":"10.1016\/S0304-3975(02)00811-3_BIB5","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","article-title":"Fixed-parameter tractability and completeness I","volume":"24","author":"Downey","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00811-3_BIB6","series-title":"Parameterized Complexity","author":"Downey","year":"1998"},{"key":"10.1016\/S0304-3975(02)00811-3_BIB7","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(02)00811-3_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n5\/2 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008113?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008113?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T07:28:38Z","timestamp":1553671718000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502008113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0304397502008113"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00811-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}