{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:43:13Z","timestamp":1725453793480},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_49","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T00:31:28Z","timestamp":1368750688000},"page":"555-566","source":"Crossref","is-referenced-by-count":1,"title":["An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs"],"prefix":"10.1007","author":[{"given":"Yunlong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"16","key":"49_CR1","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1016\/j.dam.2010.07.002","volume":"158","author":"S. Bessy","year":"2010","unstructured":"Bessy, S., Paul, C., Perez, A.: Polynomial Kernels for 3-Leaf Power Graph Modification Problems. Discrete Applied Mathematics\u00a0158(16), 1732\u20131744 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"49_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-22953-4_20","volume-title":"Fundamentals of Computation Theory","author":"S. Bessy","year":"2011","unstructured":"Bessy, S., Perez, A.: Polynomial kernels for proper interval completion and related problems. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol.\u00a06914, pp. 229\u2013239. Springer, Heidelberg (2011)"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4da, A., Le, V.B., Spinrad, J.P.: Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"4","key":"49_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters\u00a058(4), 171\u2013196 (1996)","journal-title":"Information Processing Letters"},{"issue":"4","key":"49_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00453-005-1180-z","volume":"44","author":"M. Dom","year":"2006","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R.: Error compensation in leaf power problems. Algorithmica\u00a044(4), 363\u2013381 (2006)","journal-title":"Algorithmica"},{"issue":"4","key":"49_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J. Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica\u00a039(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"key":"49_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-540-79228-4_39","volume-title":"Theory and Applications of Models of Computation","author":"J. Guo","year":"2008","unstructured":"Guo, J., H\u00fcffner, F., Komusiewicz, C., Zhang, Y.: Improved algorithms for bicluster editing. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 445\u2013456. Springer, Heidelberg (2008)"},{"key":"49_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/978-3-540-77120-3_79","volume-title":"Algorithms and Computation","author":"J. Guo","year":"2007","unstructured":"Guo, J.: Problem kernels for NP-complete edge deletion problems: Split and related graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 915\u2013926. Springer, Heidelberg (2007)"},{"issue":"5","key":"49_CR9","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H. Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput.\u00a028(5), 1906\u20131922 (1999)","journal-title":"SIAM J. Comput."},{"key":"49_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-22685-4_10","volume-title":"Computing and Combinatorics","author":"Y. Liu","year":"2011","unstructured":"Liu, Y., Wang, J., Guo, J., Chen, J.: Cograph editing: Complexity and parameterized algorithms. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol.\u00a06842, pp. 110\u2013121. Springer, Heidelberg (2011)"},{"key":"49_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-17461-2_27","volume-title":"Combinatorial Optimization and Applications","author":"J. Nastos","year":"2010","unstructured":"Nastos, J., Gao, Y.: A novel branching strategy for parameterized graph modification problems. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol.\u00a06509, pp. 332\u2013346. Springer, Heidelberg (2010)"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R. Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter tractable algorithms. Information Processing Letters\u00a073, 125\u2013129 (2000)","journal-title":"Information Processing Letters"},{"key":"49_CR13","unstructured":"Sharan, R.: Graph modification problems and their applications to genomic research. PhD Thesis, Tel-Aviv University (2002)"},{"key":"49_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-17493-3_22","volume-title":"Parameterized and Exact Computation","author":"Y. Villanger","year":"2010","unstructured":"Villanger, Y.: Proper interval vertex deletion. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 228\u2013238. Springer, Heidelberg (2010)"},{"key":"49_CR15","unstructured":"Wegner, G.: Eigenschaften der Nerven homologisch-einfacher Familien im R\n                  \n                    n\n                  . PhD thesis, Universit\u00e4t G\u00f6ttingen (1967)"}],"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_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T22:13:44Z","timestamp":1557699224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}