{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:12:49Z","timestamp":1761621169127},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,10]],"date-time":"2014-04-10T00:00:00Z","timestamp":1397088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-014-9733-1","type":"journal-article","created":{"date-parts":[[2014,4,9]],"date-time":"2014-04-09T06:51:04Z","timestamp":1397026264000},"page":"257-275","source":"Crossref","is-referenced-by-count":5,"title":["An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Yunlong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,10]]},"reference":[{"issue":"16","key":"9733_CR1","doi-asserted-by":"crossref","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 (2010) Polynomial kernels for 3-leaf power graph modification problems. Discret Appl Math 158(16):1732\u20131744","journal-title":"Discret Appl Math"},{"key":"9733_CR2","doi-asserted-by":"crossref","unstructured":"Bessy S, Perez A (2011) Polynomial kernels for proper interval completion and related problems. In: Proceedings of 18th international symposium on fundamentals of computer theory, vol 6914. Lecture Notes in Computer Science, pp 229\u2013239","DOI":"10.1007\/978-3-642-22953-4_20"},{"key":"9733_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes: a survey (monographs on discrete mathematics and applications)","author":"A Brandst\u00e4da","year":"1999","unstructured":"Brandst\u00e4da A, Le VB, Spinrad JP (1999) Graph classes: a survey (monographs on discrete mathematics and applications). SIAM, Philadelphia"},{"issue":"4","key":"9733_CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai L (1996) Fixed-parameter tractability of graph modification problems for hereditary properties. Inf Process Lett 58(4):171\u2013196","journal-title":"Inf Process Lett"},{"key":"9733_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R Downey","year":"1999","unstructured":"Downey R, Fellows M (1999) Parameterized complexity. Springer-Verlag, Berlin"},{"issue":"4","key":"9733_CR6","doi-asserted-by":"crossref","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 (2006) Error compensation in leaf power problems. Algorithmica 44(4):363\u2013381","journal-title":"Algorithmica"},{"key":"9733_CR7","doi-asserted-by":"crossref","unstructured":"Feng Q, Wang J, Chen J (2014) Matching and weighted P2-packing: algorithms and kernels. Theor Comput Sci 522:85\u201394","DOI":"10.1016\/j.tcs.2013.12.011"},{"issue":"4","key":"9733_CR8","doi-asserted-by":"crossref","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 (2004) Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39(4):321\u2013347","journal-title":"Algorithmica"},{"key":"9733_CR9","doi-asserted-by":"crossref","unstructured":"Guo J, H\u00fcffner F, Komusiewicz C, Zhang Y (2008) Improved algorithms for bicluster editing. In: Proceedings of 5th theory and applications of models of computation, vol 4978. Lecture Notes in Computer Science, pp 445\u2013456","DOI":"10.1007\/978-3-540-79228-4_39"},{"key":"9733_CR10","unstructured":"Guo J (2007) Problem kernels for NP-complete edge modification problems: split and related graphs. In: Proceedings of 18th international symposium on algorithms and computation, vol 4835. Lecture Notes in Computer Science, pp 915\u2013926"},{"issue":"5","key":"9733_CR11","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H Kaplan","year":"1999","unstructured":"Kaplan H, Shamir R, Tarjan RE (1999) Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput. 28(5):1906\u20131922","journal-title":"SIAM J. Comput."},{"key":"9733_CR12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.tcs.2011.11.040","volume":"461","author":"Y Liu","year":"2012","unstructured":"Liu Y, Wang J, Guo J, Chen J (2012) Complexity and parameterized algorithms for cograph editing. Theor Comput Sci 461:45\u201354","journal-title":"Theor Comput Sci"},{"key":"9733_CR13","doi-asserted-by":"crossref","unstructured":"Nastos J, Gao Y (2010) A novel branching strategy for parameterized graph modification problems. In: Proceedings of 4th annual international conference on combinatorial optimization and applications, vol 6509. Lecture Notes in Computer Science, pp 332\u2013346","DOI":"10.1007\/978-3-642-17461-2_27"},{"key":"9733_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R Niedermeier","year":"2000","unstructured":"Niedermeier R, Rossmanith P (2000) A general method to speed up fixed-parameter tractable algorithms. Inf Process Lett 73:125\u2013129","journal-title":"Inf Process Lett"},{"key":"9733_CR15","unstructured":"Sharan R (2002) Graph modification problems and their applications to genomic research. PhD thesis, Tel-Aviv University"},{"key":"9733_CR16","doi-asserted-by":"crossref","unstructured":"Villanger Y (2010a) Proper interval vertex deletion. Presentation in the 5th international symposium on parameterized and exact computation. http:\/\/www.lirmm.fr\/~paul\/ANR\/CIRM-TALKS-2010\/Villanger-cirm-2010.pdf","DOI":"10.1007\/978-3-642-17493-3_22"},{"key":"9733_CR17","doi-asserted-by":"crossref","unstructured":"Villanger Y (2010b) Proper interval vertex deletion. In: Proceedings of the 5th international symposium on parameterized and exact computation, vol 6478. Lecture Notes in Computer Science, pp 228\u2013238","DOI":"10.1007\/978-3-642-17493-3_22"},{"key":"9733_CR18","doi-asserted-by":"crossref","unstructured":"Wang J, Tan P, Yao J, Feng Q, Chen J (2013) On the minimum link-length rectilinear spanning path problem: complexity and algorithms. IEEE Trans Comput. doi: 10.1109\/TC.2013.163","DOI":"10.1109\/TC.2013.163"},{"key":"9733_CR19","unstructured":"Wegner G (1967) Eigenschaften der Nerven homologisch-einfacher Familien im $$R^{n}$$ R n . PhD thesis, Universit\u00e4t G\u00f6ttingen"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9733-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9733-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9733-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T10:21:30Z","timestamp":1565346090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9733-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,10]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9733"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9733-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,10]]}}}