{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:38:18Z","timestamp":1649014698532},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":6102,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/0168-0072(95)00069-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:15:29Z","timestamp":1027624529000},"page":"1-15","source":"Crossref","is-referenced-by-count":1,"title":["Sparse parameterized problems"],"prefix":"10.1016","volume":"82","author":[{"given":"Marco","family":"Cesati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(95)00069-0_BIB1","series-title":"Proc. 10th Ann. Symp. on Theoretical Aspects of Computer Science","first-page":"374","article-title":"Fixed-parameter intractability II (extended abstract)","volume":"Vol. 665","author":"Abrahamson","year":"1993"},{"issue":"3","key":"10.1016\/0168-0072(95)00069-0_BIB2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","article-title":"Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues","volume":"73","author":"Abrahamson","year":"1995","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(95)00069-0_BIB3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/1036051","article-title":"Relativizations of the P =?NP and other problems: Developments in structural complexity theory","volume":"36","author":"Book","year":"1994","journal-title":"SIAM Rev."},{"key":"10.1016\/0168-0072(95)00069-0_BIB4","doi-asserted-by":"crossref","unstructured":"R.G. Downey and M.R. Fellows, Parameterized complexity, Monograph in preparation.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"10.1016\/0168-0072(95)00069-0_BIB5","series-title":"Proc. 7th IEEE Conf. on Structure in Complexity Theory","first-page":"36","article-title":"Fixed-parameter intractability (extended abstract)","author":"Downey","year":"1992"},{"key":"10.1016\/0168-0072(95)00069-0_BIB6","first-page":"161","article-title":"Fixed-parameter tractability and completeness","volume":"87","author":"Downey","year":"1992"},{"key":"10.1016\/0168-0072(95)00069-0_BIB7","series-title":"Complexity Theory: Current Research","first-page":"191","article-title":"Fixed-parameter tractability and completeness III: Some structural aspects of the W hierarchy","author":"Downey","year":"1993"},{"key":"10.1016\/0168-0072(95)00069-0_BIB8","series-title":"Feasible Mathematics II","first-page":"219","article-title":"Parameterized computational feasibility","author":"Downey","year":"1994"},{"key":"10.1016\/0168-0072(95)00069-0_BIB9","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","article-title":"Fixed-parameter tractability and completeness I: Basic results","author":"Downey","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(95)00069-0_BIB10","doi-asserted-by":"crossref","unstructured":"R.G. Downey, M.R. Fellows and K.W. Regan, Parameterized circuit complexity and the W hierarchy, Theoret. Comput. Sci. Ser A, to appear.","DOI":"10.1016\/S0304-3975(96)00317-9"},{"key":"10.1016\/0168-0072(95)00069-0_BIB11","series-title":"Proc. 6th IEEE Conf. on Structure in Complexity Theory","first-page":"79","article-title":"On reductions of NP sets to sparse sets","author":"Homer","year":"1991"},{"key":"10.1016\/0168-0072(95)00069-0_BIB12","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete sets for NP: solution of a conjecture by Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0168-0072(95)00069-0_BIB13","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/0220030","article-title":"On polynomial bounded truth-table reducibility of NP sets to sparse sets","volume":"20","author":"Ogiwara","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007295000690?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007295000690?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:29:16Z","timestamp":1555561756000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007295000690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0168007295000690"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(95)00069-0","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}