{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:24:07Z","timestamp":1725470647415},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540390985"},{"type":"electronic","value":"9783540391012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847250_8","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T11:43:02Z","timestamp":1158147782000},"page":"84-95","source":"Crossref","is-referenced-by-count":21,"title":["Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms"],"prefix":"10.1007","author":[{"given":"Yang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Songjian","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Sing-Hoi","family":"Sze","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Struct. Alg.\u00a03, 289\u2013304 (1992)","journal-title":"Random Struct. Alg."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM\u00a042, 844\u2013856 (1995)","journal-title":"J. ACM"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s00453-004-1096-z","volume":"40","author":"J. Chen","year":"2004","unstructured":"Chen, J., Friesen, D.K., Jia, W., Kanj, I.A.: Using nondeterminism to design efficient deterministic algorithms. Algorithmica\u00a040, 83\u201397 (2004)","journal-title":"Algorithmica"},{"key":"8_CR4","unstructured":"Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems (manuscript, 2006)"},{"key":"8_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-28639-4_24","volume-title":"Parameterized and Exact Computation","author":"F. Dehne","year":"2004","unstructured":"Dehne, F., Fellows, M., Rosamond, F.A., Shaw, P.: Greedy localization, iterative compression, and modeled crown reductions: new FPT techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex cover. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 271\u2013280. Springer, Heidelberg (2004)"},{"key":"8_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-30559-0_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Fellows","year":"2004","unstructured":"Fellows, M., Heggernes, P., Rosamond, F.A., Sloper, C., Telle, J.A.: Finding k disjoint triangles in an arbitrary graph. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 235\u2013244. Springer, Heidelberg (2004)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-30140-0_29","volume-title":"Algorithms \u2013 ESA 2004","author":"M.R. Fellows","year":"2004","unstructured":"Fellows, M.R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F.A., Stege, U., Thilikos, D.M., Whitesides, S.H.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 311\u2013322. Springer, Heidelberg (2004)"},{"key":"8_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jalgor.2003.07.001","volume":"50","author":"W. Jia","year":"2004","unstructured":"Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. J. Alg.\u00a050, 106\u2013117 (2004)","journal-title":"J. Alg."},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11917496_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kneis","year":"2006","unstructured":"Kneis, J., M\u00f6lle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 58\u201367. Springer, Heidelberg (2006)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.ipl.2004.12.005","volume":"94","author":"I. Koutis","year":"2005","unstructured":"Koutis, I.: A faster parameterized algorithm for set packing. Inf. Process. Lett.\u00a094, 7\u20139 (2005)","journal-title":"Inf. Process. Lett."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-28639-4_12","volume-title":"Parameterized and Exact Computation","author":"L. Mathieson","year":"2004","unstructured":"Mathieson, L., Prieto, E., Shaw, P.: Packing edge disjoint triangles: A\u00a0parameterized view. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 127\u2013137. Springer, Heidelberg (2004)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.tcs.2005.10.009","volume":"351","author":"E. Prieto","year":"2006","unstructured":"Prieto, E., Sloper, C.: Looking at the stars. Theor. Comp. Sci.\u00a0351, 437\u2013445 (2006)","journal-title":"Theor. Comp. Sci."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1137\/0219054","volume":"19","author":"J.P. Schmidt","year":"1990","unstructured":"Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM J. Comp.\u00a019, 775\u2013786 (1990)","journal-title":"SIAM J. Comp."}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847250_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:18:47Z","timestamp":1619493527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847250_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540390985","9783540391012"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11847250_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}