{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:44Z","timestamp":1725490244537},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540747413"},{"type":"electronic","value":"9783540747420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74742-0_16","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T11:03:30Z","timestamp":1187694210000},"page":"148-159","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Memorization for the k -Vertex Cover Problem"],"prefix":"10.1007","author":[{"given":"Peter J.","family":"Taillon","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s00453-006-1214-1","volume":"45","author":"F.N. Abu-Khzam","year":"2006","unstructured":"Abu-Khzam, F.N., Langston, M.A., Shanbhag, P., Symons, C.T.: Scalable parallel algorithms for FPT problems. Algorithmica\u00a045, 269\u2013284 (2006)","journal-title":"Algorithmica"},{"key":"16_CR2","first-page":"62","volume-title":"ALENEX","author":"F.N. Abu-Khzam","year":"2004","unstructured":"Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: Theory and experiments. In: ALENEX. Proceedings of the ACM-SIAM Workshop on Algorithm Engineering and Experiments, pp. 62\u201369. ACM Press, New York (2004)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0020-0190(89)90192-0","volume":"33","author":"S.G. Akl","year":"1990","unstructured":"Akl, S.G., Gries, D.R., Stojmenovi\u0107, I.: An optimal parallel algorithm for generating combinations. Information Processing Letters\u00a033, 135\u2013139 (1990)","journal-title":"Information Processing Letters"},{"key":"16_CR4","first-page":"192","volume-title":"Proceedings of the IEEE International Workshop on High Performance Computational Biology","author":"N.E. Baldwin","year":"2004","unstructured":"Baldwin, N.E., Collins, R.L., Leuze, M.R., Langston, M.A., Symons, C.T., Voy, B.H.: High-performance computational tools for motif discovery. In: Proceedings of the IEEE International Workshop on High Performance Computational Biology, pp. 192\u2013199. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ipl.2004.10.003","volume":"93","author":"L.S. Chandran","year":"2005","unstructured":"Chandran, L.S., Grandoni, F.F.: Refined memorization for vertex cover. Information Processing Letters\u00a093, 125\u2013131 (2005)","journal-title":"Information Processing Letters"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/S0022-0000(03)00075-8","volume":"67","author":"J. Cheetham","year":"2003","unstructured":"Cheetham, J., Dehne, F., Rau-Chaplin, A., Stege, U., Taillon, P.J.: Solving large FPT problems on coarse grained parallel machines. Journal of Computer and System Sciences\u00a067, 691\u2013706 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR7","first-page":"70","volume-title":"CCGrid","author":"J. Cheetham","year":"2003","unstructured":"Cheetham, J., Dehne, F., Rau-Chaplin, A., Stege, U., Taillon, P.J.: A parallel FPT application for clusters. In: CCGrid. Proceedings of the IEEE-ACM International Symposium on Cluster Computing and the Grid, pp. 70\u201377. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for VERTEX COVER. In: The 31st International Symposium on Mathematical Foundations of Computer Science (MFC), pp. 238\u2013249 (2006)","DOI":"10.1007\/11821069_21"},{"key":"16_CR9","first-page":"173","volume":"24","author":"F. Dehne","year":"1999","unstructured":"Dehne, F.: Guest editor\u2019s introduction. Algorithmica Special Issue on Coarse Grained Parallel Algorithms\u00a024, 173\u2013176 (1999)","journal-title":"Algorithmica Special Issue on Coarse Grained Parallel Algorithms"},{"key":"16_CR10","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1998)"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility among combinatorial problems. Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. Complexity of Computer Computations, pp. 85\u2013104. Plenum Press, New York (1972)"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0196-6774(03)00005-1","volume":"47","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: On efficient fixed-parameter algorithms for weighted vertex cover. Journal of Algorithms\u00a047, 63\u201377 (2003)","journal-title":"Journal of Algorithms"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-36180-4_11","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"C. Pinchak","year":"2002","unstructured":"Pinchak, C., Lu, P., Schaeffer, J., Goldenberg, M.: Practical heterogeneous placeholder scheduling in overlay metacomputers: Early experiences. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol.\u00a02537, pp. 85\u2013105. Springer, Heidelberg (2002)"},{"key":"16_CR14","unstructured":"Pinchak, C., Lu, P., Schaeffer, J., Goldenberg, M.: The Canadian Internetworked Scientific Supercomputer. In: Proceedings of the 17th Annual International Symposium on High Performance Computing Systems and Applications (HPCS), pp. 193\u2013199 (2003)"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"J.M. Robson","year":"1986","unstructured":"Robson, J.M.: Algorithms for maximum independent sets. Journal of Algorithms\u00a07, 425\u2013440 (1986)","journal-title":"Journal of Algorithms"},{"key":"16_CR16","unstructured":"Robson, J.M.: Finding a maximum independent set in time O(2\n                    n\/4). Technical Report LaBRI Universit\u00e9 Bordeaux I 1251-01 (2001)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1080\/17445760500355777","volume":"21","author":"I.I. Stojmenovi\u0107","year":"2006","unstructured":"Stojmenovi\u0107, I.I.: Listing combinatorial objects in parallel. International Journal of Parallel, Emergent and Distributed Systems\u00a021, 127\u2013146 (2006)","journal-title":"International Journal of Parallel, Emergent and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74742-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T07:03:21Z","timestamp":1550819001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74742-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540747413","9783540747420"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74742-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}