{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:21:56Z","timestamp":1761805316090,"version":"3.40.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_9","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T05:30:40Z","timestamp":1401687040000},"page":"111-124","source":"Crossref","is-referenced-by-count":8,"title":["A Fast Branching Algorithm for Cluster Vertex Deletion"],"prefix":"10.1007","author":[{"given":"Anudhyan","family":"Boral","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Cygan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Kociumaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"9_CR1","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"F.N. Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. Journal of Computer and System Sciences\u00a076(7), 524\u2013531 (2010)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/11847250_24","volume-title":"Parameterized and Exact Computation","author":"F.N. Abu-Khzam","year":"2006","unstructured":"Abu-Khzam, F.N., Fernau, H.: Kernels: Annotated, proper and induced. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 264\u2013275. Springer, Heidelberg (2006)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. Journal of the ACM 55(5), 23:1\u201323:27 (2008)","DOI":"10.1145\/1411509.1411513"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Makarychev, K., Makarychev, Y., Naor, A.: Quadratic forms on graphs. In: Proceedings of STOC 2005, pp. 486\u2013493. ACM (2005)","DOI":"10.1145\/1060590.1060664"},{"key":"9_CR5","doi-asserted-by":"publisher","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. Machine Learning\u00a056, 89\u2013113 (2004)","journal-title":"Machine Learning"},{"issue":"3\/4","key":"9_CR6","doi-asserted-by":"publisher","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. Journal of Computational Biology\u00a06(3\/4), 281\u2013297 (1999)","journal-title":"Journal of Computational Biology"},{"key":"9_CR7","doi-asserted-by":"publisher","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. Journal of Discrete Algorithms\u00a016, 79\u201389 (2012)","journal-title":"Journal of Discrete Algorithms"},{"issue":"52","key":"9_CR8","doi-asserted-by":"publisher","first-page":"5467","DOI":"10.1016\/j.tcs.2009.05.006","volume":"410","author":"S. B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q.B.A., Tru\u00df, A.: Going weighted: Parameterized algorithms for cluster editing. Theoretical Computer Science\u00a0410(52), 5467\u20135480 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s00453-009-9339-7","volume":"60","author":"S. B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: Evaluation and experiments. Algorithmica\u00a060(2), 316\u2013334 (2011)","journal-title":"Algorithmica"},{"issue":"14","key":"9_CR10","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/j.ipl.2011.05.003","volume":"111","author":"S. B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Damaschke, P.: Even faster parameterized cluster deletion and cluster editing. Information Processing Letters\u00a0111(14), 717\u2013721 (2011)","journal-title":"Information Processing Letters"},{"issue":"7-9","key":"9_CR11","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1016\/j.tcs.2009.12.016","volume":"411","author":"H.L. Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Fellows, M.R., Heggernes, P., Mancini, F., Papadopoulos, C., Rosamond, F.A.: Clustering with partial information. Theoretical Computer Science\u00a0411(7-9), 1202\u20131211 (2010)","journal-title":"Theoretical Computer Science"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: Fast branching algorithm for cluster vertex deletion. CoRR, abs\/1306.3877 (2013)","DOI":"10.1007\/978-3-319-06686-8_9"},{"issue":"4","key":"9_CR13","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\u2013176 (1996)","journal-title":"Information Processing Letters"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Charikar, M., Wirth, A.: Maximizing quadratic programs: Extending Grothendieck\u2019s inequality. In: Proceedings of FOCS 2004, pp. 54\u201360. IEEE Computer Society (2004)","DOI":"10.1109\/FOCS.2004.39"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00224-008-9130-1","volume":"46","author":"P. Damaschke","year":"2010","unstructured":"Damaschke, P.: Fixed-parameter enumerability of cluster editing and related problems. Theory of Computing Systems\u00a046(2), 261\u2013283 (2010)","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.disopt.2010.09.006","volume":"8","author":"M.R. Fellows","year":"2011","unstructured":"Fellows, M.R., Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Graph-based data clustering with overlaps. Discrete Optimization\u00a08(1), 2\u201317 (2011)","journal-title":"Discrete Optimization"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","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\u00a057(1), 97\u2013118 (2010)","journal-title":"Algorithmica"},{"key":"9_CR18","series-title":"Texts in theoretical computer science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"F.V. Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in theoretical computer science. Springer, Heidelberg (2010)"},{"key":"9_CR19","series-title":"LIPIcs","first-page":"32","volume-title":"Proceedings of STACS 2013","author":"F.V. Fomin","year":"2013","unstructured":"Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight bounds for parameterized complexity of cluster editing. In: Proceedings of STACS 2013. LIPIcs, vol.\u00a020, pp. 32\u201343. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Leibniz-Zentrum fuer Informatik (2013)"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"249","DOI":"10.4086\/toc.2006.v002a013","volume":"2","author":"I. Giotis","year":"2006","unstructured":"Giotis, I., Guruswami, V.: Correlation clustering with a fixed number of clusters. Theory of Computing\u00a02(1), 249\u2013266 (2006)","journal-title":"Theory of Computing"},{"issue":"4","key":"9_CR21","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"},{"issue":"4","key":"9_CR22","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00224-004-1178-y","volume":"38","author":"J. Gramm","year":"2005","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Theory of Computing Systems\u00a038(4), 373\u2013392 (2005)","journal-title":"Theory of Computing Systems"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s00453-011-9487-4","volume":"61","author":"J. Guo","year":"2011","unstructured":"Guo, J., Kanj, I.A., Komusiewicz, C., Uhlmann, J.: Editing graphs into disjoint unions of dense clusters. Algorithmica\u00a061(4), 949\u2013970 (2011)","journal-title":"Algorithmica"},{"issue":"4","key":"9_CR24","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1137\/090767285","volume":"24","author":"J. Guo","year":"2010","unstructured":"Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: A more relaxed model for graph-based data clustering: s-plex cluster editing. SIAM Journal of Discrete Mathematics\u00a024(4), 1662\u20131683 (2010)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-540-78773-0_61","volume-title":"LATIN 2008: Theoretical Informatics","author":"F. H\u00fcffner","year":"2008","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 711\u2013722. Springer, Heidelberg (2008)"},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","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 of Computing Systems\u00a047(1), 196\u2013217 (2010)","journal-title":"Theory of Computing Systems"},{"key":"9_CR27","unstructured":"Komusiewicz, C.: Parameterized Algorithmics for Network Analysis: Clustering & Querying. PhD thesis, Technische Universit\u00e4t Berlin (2011), http:\/\/fpt.akt.tu-berlin.de\/publications\/diss-komusiewicz.pdf"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-18381-2_29","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"C. Komusiewicz","year":"2011","unstructured":"Komusiewicz, C., Uhlmann, J.: Alternative parameterizations for cluster editing. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 344\u2013355. Springer, Heidelberg (2011)"},{"issue":"1","key":"9_CR29","doi-asserted-by":"publisher","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 of Computing Systems\u00a044(1), 91\u2013104 (2009)","journal-title":"Theory of Computing Systems"},{"issue":"4","key":"9_CR30","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B.A. Reed","year":"2004","unstructured":"Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters\u00a032(4), 299\u2013301 (2004)","journal-title":"Operations Research Letters"},{"issue":"1-2","key":"9_CR31","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R. Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Mathematics\u00a0144(1-2), 173\u2013182 (2004)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:49:04Z","timestamp":1746251344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}