{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:42:46Z","timestamp":1725453766738},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_10","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"89-100","source":"Crossref","is-referenced-by-count":3,"title":["Random Methods for Parameterized Problems"],"prefix":"10.1007","author":[{"given":"Qilong","family":"Feng","sequence":"first","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shaohua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-14355-7_10","volume-title":"Algorithmic Aspects in Information and Management","author":"Z.-Z. Chen","year":"2010","unstructured":"Chen, Z.-Z., Fellows, M., Fu, B., Jiang, H., Liu, Y., Wang, L., Zhu, B.: A Linear Kernel for Co-Path\/Cycle Packing. In: Chen, B. (ed.) AAIM 2010. LNCS, vol.\u00a06124, pp. 90\u2013102. Springer, Heidelberg (2010)"},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/s00453-008-9206-y","volume":"54","author":"J. Chen","year":"2008","unstructured":"Chen, J., Lu, S.: Improved parameterized set splitting algorithms: A probabilistic approach. Algorithmica\u00a054(4), 472\u2013489 (2008)","journal-title":"Algorithmica"},{"key":"10_CR3","unstructured":"Chen, J., Lu, S., Sze, S.H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Proc. of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 298\u2013307 (2007)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"1000234","DOI":"10.1371\/journal.pcbi.1000234","volume":"4","author":"C. Chauve","year":"2008","unstructured":"Chauve, C., Tannier, E.: A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genome. PLoS Comput. Biol.\u00a04, e1000234 (2008)","journal-title":"PLoS Comput. Biol."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"K. Bontridder De","year":"2003","unstructured":"De Bontridder, K., Halld\u00f3rsson, B., Lenstra, J., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Program., Ser. B\u00a098, 477\u2013491 (2003)","journal-title":"Math. Program., Ser. B"},{"key":"10_CR6","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., 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)"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10878-009-9230-0","volume":"18","author":"H. Fernau","year":"2009","unstructured":"Fernau, H., Raible, D.: A parameterized perspective on packing paths of length two. Journal of Combinatorial Optimization\u00a018(4), 319\u2013341 (2009)","journal-title":"Journal of Combinatorial Optimization"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-22685-4_31","volume-title":"Computing and Combinatorics","author":"Q. Feng","year":"2011","unstructured":"Feng, Q., Wang, J., Chen, J.: Matching and P\n                  2-Packing: Weighted Versions. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol.\u00a06842, pp. 343\u2013353. Springer, Heidelberg (2011)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1006\/jagm.1998.0995","volume":"31","author":"T. Fujito","year":"1999","unstructured":"Fujito, T.: Approximating node-deletion problems for matroidal properties. J. Algorithms\u00a031, 211\u2013227 (1999)","journal-title":"J. Algorithms"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/j.dam.2005.11.003","volume":"154","author":"R. Hassin","year":"2006","unstructured":"Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. Discrete Appl. Math.\u00a0154, 971\u2013979 (2006)","journal-title":"Discrete Appl. Math."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC 2011), pp. 469\u2013478 (2011)","DOI":"10.1145\/1993636.1993699"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-33293-7_2","volume-title":"Parameterized and Exact Computation","author":"D. Marx","year":"2012","unstructured":"Marx, D.: Randomized Techniques for Parameterized Algorithms. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol.\u00a07535, p. 2. Springer, Heidelberg (2012)"},{"key":"10_CR13","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. Theoretical Computer Science\u00a0351, 437\u2013445 (2006)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T02:04:30Z","timestamp":1557713070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}