{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T14:22:20Z","timestamp":1715955740977},"reference-count":27,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":3516,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0022-0000(03)00075-8","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T15:02:03Z","timestamp":1058367723000},"page":"691-706","source":"Crossref","is-referenced-by-count":42,"title":["Solving large FPT problems on coarse-grained parallel machines"],"prefix":"10.1016","volume":"67","author":[{"given":"James","family":"Cheetham","sequence":"first","affiliation":[]},{"given":"Frank","family":"Dehne","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Rau-Chaplin","sequence":"additional","affiliation":[]},{"given":"Ulrike","family":"Stege","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Taillon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00075-8_BIB1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(97)00213-5","article-title":"An improved fixed-parameter algorithm for vertex cover","volume":"65","author":"Balasubramanian","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB2","unstructured":"D.J. Becker, T. Sterling, D. Savarese, J.E. Dorband, U.A. Ranawak, C.V. Packer, Beowulf: a parallel workstation for scientific computation, in: Proceedings of the International Conference on Parallel Processing, Oconomowoc, WI, 1995, pp. I: 11\u201314."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB3","unstructured":"H.L. Bodlaender, R.G. Downey, M.R. Fellows, Applications of parameterized complexity to problems of parallel and distributed computation, Unpublished extended abstract, 1994."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB4","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1137\/0222038","article-title":"Nondeterminism within P","volume":"22","author":"Buss","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB5","doi-asserted-by":"crossref","unstructured":"M. Cesati, M. Di Ianni, Parameterized parallel complexity, in: Proceedings of the Fourth International Euro-Par Conference, Southampton, UK, 1998, pp. 892\u2013896.","DOI":"10.1007\/BFb0057945"},{"key":"10.1016\/S0022-0000(03)00075-8_BIB6","doi-asserted-by":"crossref","unstructured":"A. Chan, F. Dehne, A note on coarse-grained parallel integer sorting, in: Proceedings of the 13th Annual International Symposium on High Performance Computers (HPCS\u201999), Kingston, Canada, 1999, pp. 261\u2013267.","DOI":"10.1142\/S0129626499000499"},{"key":"10.1016\/S0022-0000(03)00075-8_BIB7","doi-asserted-by":"crossref","unstructured":"J. Chen, I.A. Kanj, W. Jia, Vertex cover: further observations and further improvements, in: P. Widmayer, G. Neyer, S. Eidenbenz (Eds.), 25th International Workshop on Graph-Theoretical Concepts in Computer Science (WG\u201999), LNCS, Springer, Berlin, 1999.","DOI":"10.1007\/3-540-46784-X_30"},{"issue":"3\/4","key":"10.1016\/S0022-0000(03)00075-8_BIB8","first-page":"173","article-title":"Guest editor's introduction","volume":"24","author":"Dehne","year":"1999","journal-title":"(special issue on Coarse grained parallel algorithms), Algorithmica"},{"issue":"3","key":"10.1016\/S0022-0000(03)00075-8_BIB9","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1142\/S0218195996000241","article-title":"Scalable parallel computational geometry for coarse grained multicomputers","volume":"6","author":"Dehne","year":"1996","journal-title":"Internat. J. Comput. Geom."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB10","unstructured":"L. DeVroye, Private communication, GRACO Conference, Fortaleza, Brazil, March 2001."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB11","first-page":"161","article-title":"Fixed-parameter tractability and completeness","volume":"87","author":"Downey","year":"1992","journal-title":"Congr. Numer."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB12","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\/S0022-0000(03)00075-8_BIB13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","article-title":"Fixed parameter tractability and completeness II","volume":"141","author":"Downey","year":"1995","journal-title":"Theoret. Comput. Sci. A"},{"key":"10.1016\/S0022-0000(03)00075-8_BIB14","series-title":"Feasible Mathematics II","first-page":"219","article-title":"Parameterized computational feasibility","author":"Downey","year":"1995"},{"key":"10.1016\/S0022-0000(03)00075-8_BIB15","series-title":"Parameterized Complexity","author":"Downey","year":"1998"},{"key":"10.1016\/S0022-0000(03)00075-8_BIB16","doi-asserted-by":"crossref","unstructured":"R.G. Downey, M.R. Fellows, U. Stege, Parameterized complexity: a framework for systematically confronting computational intractability, in: F. Roberts, J. Kratochvil, J. Nesetril (Eds.), Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, AMS-DIMACS Proceedings Series, Vol. 49, Amer. Math. Soc. Providence, RI, 1999, pp. 49\u201399.","DOI":"10.1090\/dimacs\/049\/04"},{"key":"10.1016\/S0022-0000(03)00075-8_BIB17","unstructured":"M.R. Fellows, On the complexity of vertex set problems, Technical Report, Computer Science Department, University of New Mexico, 1988."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB18","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0022-0000(03)00075-8_BIB19","unstructured":"G. Gonnet, Vertex cover approximation algorithm, http:\/\/cbrg.inf.ethz.ch\/Server\/VertexCover.html, 1999."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB20","doi-asserted-by":"crossref","unstructured":"R. Niedermeier, P. Rossmanith, Upper bounds for vertex cover further improved, in: C. Meinel, S. Tison (Eds.), Proceedings of the 16th Symposium on Theoretical Aspects in Computer Science (STACS\u201999), LNCS, Springer, New York, 1999.","DOI":"10.1007\/3-540-49116-3_53"},{"key":"10.1016\/S0022-0000(03)00075-8_BIB21","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/jcss.1996.0058","article-title":"On limited nondeterminism and the complexity of the V-C dimension","volume":"53","author":"Papadimitriou","year":"1996","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/S0022-0000(03)00075-8_BIB22","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/71.219757","article-title":"On the efficiency of parallel backtracking","volume":"4","author":"Rao","year":"1993","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"10.1016\/S0022-0000(03)00075-8_BIB23","unstructured":"C. Roth-Korostensky, Algorithms for building multiple sequence alignments and evolutionary trees, Ph.D. Thesis, ETH Z\u00fcrich, Institute of Scientific Computing, February 2000."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB24","unstructured":"U. Stege, M.R. Fellows, An improved fixed-parameter-tractable algorithm for Vertex Cover, Technical Report 318, Department of Computer Science, ETH Z\u00fcrich, April 1999."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB25","unstructured":"U. Stege, Resolving conflicts from problems in computational biology, Ph.D. Thesis, No.13364, ETH Z\u00fcrich, 2000."},{"key":"10.1016\/S0022-0000(03)00075-8_BIB26","doi-asserted-by":"crossref","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","article-title":"CLUSTAL W","volume":"22","author":"Thompson","year":"1994","journal-title":"Nucleic Acids Res."},{"issue":"8","key":"10.1016\/S0022-0000(03)00075-8_BIB27","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","article-title":"A bridging model for parallel computation","volume":"33","author":"Valiant","year":"1990","journal-title":"Comm. ACM"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000758?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000758?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T13:21:49Z","timestamp":1552828909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000758"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0022000003000758"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00075-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}