{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T10:43:39Z","timestamp":1781952219201,"version":"3.54.5"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,4,25]],"date-time":"2015-04-25T00:00:00Z","timestamp":1429920000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s00224-015-9631-7","type":"journal-article","created":{"date-parts":[[2015,4,24]],"date-time":"2015-04-24T00:44:32Z","timestamp":1429836272000},"page":"357-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":56,"title":["A Fast Branching Algorithm for Cluster Vertex Deletion"],"prefix":"10.1007","volume":"58","author":[{"given":"Anudhyan","family":"Boral","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marek","family":"Cygan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomasz","family":"Kociumaka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcin","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,4,25]]},"reference":[{"issue":"7","key":"9631_CR1","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"FN Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for d-Hitting Set. J. Comput. Syst. Sci. 76(7), 524\u2013531 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"9631_CR2","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N., Fernau, H. Kernels: Annotated, proper and induced. In: Proceedings of IWPEC 2006, volume 4169 of Lecture Notes in Computer Science, pp. 264\u2013275. Springer (2006)","DOI":"10.1007\/11847250_24"},{"issue":"5","key":"9631_CR3","doi-asserted-by":"crossref","first-page":"23:1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J ACM 55(5), 23:1\u201323:27 (2008)","journal-title":"J ACM"},{"key":"9631_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56, 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"issue":"3\/4","key":"9631_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor, A., Shamir, R., Yakhini, Z.: Clustering gene expression patterns. J. Comput. Biol. 6(3\/4), 281\u2013297 (1999)","journal-title":"J. Comput. Biol."},{"key":"9631_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.jda.2012.04.005","volume":"16","author":"S B\u00f6cker","year":"2012","unstructured":"B\u00f6cker, S.: A golden ratio parameterized algorithm for cluster editing. J. Discrete Algorithms 16, 79\u201389 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"9631_CR7","doi-asserted-by":"crossref","unstructured":"B\u00f6cker, S., Baumbach, J.: Cluster editing. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) The Nature of Computation. Logic, Algorithms, Applications, volume 7921 of Lecture Notes in Computer Science, pp 33\u201344. Springer, Berlin Heidelberg (2013)","DOI":"10.1007\/978-3-642-39053-1_5"},{"issue":"4","key":"9631_CR8","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.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"9631_CR9","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"71","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 71(3), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9631_CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.jcss.2011.04.001","volume":"78","author":"J Chen","year":"2012","unstructured":"Chen, J., Meng, J.: A 2k kernel for the cluster editing problem. J. Comput. Syst. Sci. 78(1), 211\u2013220 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9631_CR11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00453-008-9199-6","volume":"57","author":"H Fernau","year":"2010","unstructured":"Fernau, H.: A top-down approach to search-trees: improved algorithmics for 3-hitting set. Algorithmica 57(1), 97\u2013118 (2010)","journal-title":"Algorithmica"},{"key":"9631_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms. Texts in Theoretical Computer Science","author":"F Fomin","year":"2010","unstructured":"Fomin, F., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. Springer, Berlin Heidelberg (2010)"},{"issue":"7","key":"9631_CR13","doi-asserted-by":"crossref","first-page":"1430","DOI":"10.1016\/j.jcss.2014.04.015","volume":"80","author":"FV Fomin","year":"2014","unstructured":"Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight bounds for parameterized complexity of cluster editing with a small number of clusters. J. Comput. Syst. Sci. 80(7), 1430\u20131447 (2014)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"9631_CR14","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.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"issue":"1","key":"9631_CR15","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/s00224-008-9150-x","volume":"47","author":"F H\u00fcffner","year":"2010","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47(1), 196\u2013217 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"9631_CR16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0020-0190(98)00071-4","volume":"66","author":"H Ito","year":"1998","unstructured":"Ito, H., Yokoyama, M.: Linear time algorithms for graph search and connectivity determination on complement graphs. Inf. Process. Lett. 66(4), 209\u2013213 (1998)","journal-title":"Inf. Process. Lett."},{"key":"9631_CR17","unstructured":"Komusiewicz, C.: Parameterized Algorithmics for Network Analysis: Clustering & Querying. PhD thesis, Technische Universit\u00e4t Berlin. Available at http:\/\/fpt.akt.tu-berlin.de\/publications\/diss-komusiewicz.pdf (2011)"},{"issue":"15","key":"9631_CR18","doi-asserted-by":"crossref","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","volume":"160","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discret. Appl. Math. 160(15), 2259\u20132270 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9631_CR19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00224-007-9032-7","volume":"44","author":"F Protti","year":"2009","unstructured":"Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying modular decomposition to parameterized cluster editing problems. Theory Comput. Syst. 44(1), 91\u2013104 (2009)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"9631_CR20","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"BA Reed","year":"2004","unstructured":"Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."},{"key":"9631_CR21","unstructured":"Wahlstr\u00f6m, M.: Algorithms, measures, and upper bounds for satisfiability and related problems. PhD thesis, Link\u00f6ping Studies in Science and Technology. Available at http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:liu:diva-8714 (2007)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9631-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9631-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9631-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T14:12:49Z","timestamp":1551190369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9631-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,25]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9631"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9631-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,25]]}}}