{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T12:05:00Z","timestamp":1775736300621,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0167-6377(95)00031-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"93-97","source":"Crossref","is-referenced-by-count":35,"title":["W[2]-hardness of precedence constrained K-processor scheduling"],"prefix":"10.1016","volume":"18","author":[{"given":"Hans L.","family":"Bodlaender","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\/0167-6377(95)00031-9_BIB1","series-title":"Proc. 10th Symp. on Theoretical Aspects of Computer Science (STACS)","first-page":"374","article-title":"Fixedparameter intractability II","author":"Abrahamson","year":"1993"},{"key":"10.1016\/0167-6377(95)00031-9_BIB2","unstructured":"K. Abrahamson, R. Downey and M. Fellows, \u201cFixed-parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogs\u201d, to appear in Ann. Pure Appl. Logic."},{"key":"10.1016\/0167-6377(95)00031-9_BIB3","series-title":"Graph Structure Theory: Proc. Joint Summer Res. Conf. on Graph Minors","first-page":"539","article-title":"Finite automata, bounded treewidth and well-quasiordering","volume":"Vol. 147","author":"Abrahamson","year":"1993"},{"key":"10.1016\/0167-6377(95)00031-9_BIB4","article-title":"A tourist guide through treewidth","author":"Bodlaender","year":"1992"},{"key":"10.1016\/0167-6377(95)00031-9_BIB5","unstructured":"H. Bodlaender, R. Downey, M. Fellows, M. Hallett and H. Wareham, \u201cParameterized complexity analysis in computational biology\u201d, to appear in Comput. Appl. Biosci."},{"key":"10.1016\/0167-6377(95)00031-9_BIB6","series-title":"Proc. 5th Symp. on Combinatorial Pattern Matching (CPM)","first-page":"15","article-title":"The parameterized complexity of sequence alignment and consensus","volume":"Vol. 807","author":"Bodlaender","year":"1994"},{"key":"10.1016\/0167-6377(95)00031-9_BIB7","unstructured":"H. Bodlaender, R. Downey, M. Fellows and H. Wareham, \u201cThe parameterized complexity of the longest common subsequence problem\u201d, to appear in Theoret. Comput. Sci."},{"key":"10.1016\/0167-6377(95)00031-9_BIB8","article-title":"Domino treewidth","author":"Bodlaender","year":"1994"},{"key":"10.1016\/0167-6377(95)00031-9_BIB9","series-title":"Proc. ACM Symp. on the Theory of Computing (STOC)","first-page":"449","article-title":"Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy","author":"Bodlaender","year":"1994"},{"key":"10.1016\/0167-6377(95)00031-9_BIB10","series-title":"Proc. 2nd Israel Symp. on Theory of Computing and Systems","first-page":"118","article-title":"Fixed-parameter tractability and approximability of NP-hard optimization problems","author":"Cai","year":"1993"},{"key":"10.1016\/0167-6377(95)00031-9_BIB11","series-title":"Proc. 11th Symp. on Theoretical Aspects of Computer Science (STACS'94)","first-page":"509","article-title":"On the structure of parameterized problems in NP","volume":"Vol. 775","author":"Cai","year":"1994"},{"key":"10.1016\/0167-6377(95)00031-9_BIB12","unstructured":"L. Cai, J. Chen, R. Downey and M. Fellows, \u201cThe parameterized complexity of short computation and factorization\u201d, to appear in Arch. Math. Logic."},{"key":"10.1016\/0167-6377(95)00031-9_BIB13","series-title":"Proc. 6th ACM Workshop on Computational Learning Theory (COLT)","first-page":"51","article-title":"Parameterized learning complexity","author":"Downey","year":"1993"},{"key":"10.1016\/0167-6377(95)00031-9_BIB14","series-title":"Proc. 7th Ann. Conf. on Structure in Complexity Theory","first-page":"36","article-title":"\u201cFixed-parameter intractability\u201d (extended abstract)","author":"Downey","year":"1992"},{"key":"10.1016\/0167-6377(95)00031-9_BIB15","series-title":"Proc. 1992 Dagstuhl Workshop on Structural Complexity 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\/0167-6377(95)00031-9_BIB16","series-title":"Proc. 2nd Cornell Workshop on Feasible Mathematics, Feasible Mathematics II","first-page":"219","article-title":"Parameterized computational feasibility","author":"Downey","year":"1995"},{"key":"10.1016\/0167-6377(95)00031-9_BIB17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","article-title":"Fixed-parameter tractability and completeness II: completeness for W[1]","volume":"141","author":"Downey","year":"1995","journal-title":"Theoret. Comput. Sci. A"},{"key":"10.1016\/0167-6377(95)00031-9_BIB18","series-title":"Proc. Symp. on Logical Foundations of Computer Science (LFCS)","first-page":"89","article-title":"The parameterized complexity of some problems in logic and linguistics","volume":"Vol. 813","author":"Downey","year":"1994"},{"key":"10.1016\/0167-6377(95)00031-9_BIB19","series-title":"Algorithms - ESA '93 (Proc. 1st European Symp. on Algorithms)","first-page":"157","article-title":"DNA physical mapping: three ways difficult","volume":"Vol. 726","author":"Fellows","year":"1993"},{"key":"10.1016\/0167-6377(95)00031-9_BIB20","series-title":"Proc. 10th Internat. Symp. on Applied Algebra, Algebraic Algorithms and Error Correcting Codes (AAECC'93)","first-page":"121","article-title":"Fixed-parameter complexity and cryptography","volume":"Vol. 673","author":"Fellows","year":"1993"},{"key":"10.1016\/0167-6377(95)00031-9_BIB21_1","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1137\/0117070","article-title":"Optimal sequencing of two equivalent processors","volume":"17","author":"Fujii","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0167-6377(95)00031-9_BIB21_2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1137\/0120018","article-title":"erratum","volume":"20","author":"Fujii","year":"1971","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0167-6377(95)00031-9_BIB22","series-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-6377(95)00031-9_BIB23","series-title":"Proc. IEEE Symp. on Foundations of Computer Science (FOCS)","article-title":"Tractablity of parameterized completion problems on chordal and interval graphs","author":"Kaplan","year":"1994"},{"key":"10.1016\/0167-6377(95)00031-9_BIB24","first-page":"445","article-title":"Sequencing and scheduling: algorithms and complexity","volume":"Vol. 4","author":"Lawler","year":"1993"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637795000319?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637795000319?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:53:36Z","timestamp":1555577616000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637795000319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["0167637795000319"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(95)00031-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}