{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:12Z","timestamp":1758586212636,"version":"3.44.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_13","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:31Z","timestamp":1758498331000},"page":"165-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Algorithms for\u00a0Editing to\u00a0Uniform Cluster Graph"],"prefix":"10.1007","author":[{"given":"Ajinkya","family":"Gaikwad","sequence":"first","affiliation":[]},{"given":"Hitendra","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Soumen","family":"Maity","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"issue":"7","key":"13_CR1","doi-asserted-by":"publisher","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."},{"issue":"14","key":"13_CR2","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. Inf. Process. Lett. 111(14), 717\u2013721 (2011)","journal-title":"Inf. Process. Lett."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00224-015-9631-7","volume":"58","author":"A Boral","year":"2013","unstructured":"Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: A fast branching algorithm for cluster vertex deletion. Theory Comput. Syst. 58, 357\u2013376 (2013)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"13_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. Inf. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s00453-011-9595-1","volume":"64","author":"Y Cao","year":"2012","unstructured":"Cao, Y., Chen, J.: Cluster editing: kernelization based on edge cuts. Algorithmica 64, 152\u2013169 (2012)","journal-title":"Algorithmica"},{"key":"13_CR6","unstructured":"Cao, Y., Ke, Y.: Improved kernels for edge modification problems. arXiv preprint arXiv:2104.14510 (2021)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-11269-0_8","volume-title":"Parameterized and Exact Computation","author":"P Damaschke","year":"2009","unstructured":"Damaschke, P.: Bounded-degree techniques accelerate some parameterized graph algorithms. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 98\u2013109. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11269-0_8"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/0024-3795(70)90037-6","volume":"3","author":"M Doob","year":"1970","unstructured":"Doob, M.: On characterizing certain graphs with four eigenvalues by their spectra. Linear Algebra Appl. 3, 461\u2013482 (1970)","journal-title":"Linear Algebra Appl."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.dam.2019.09.016","volume":"277","author":"F Goldberg","year":"2020","unstructured":"Goldberg, F., Kirkland, S., Varghese, A., Vijayakumar, A.: On split graphs with four distinct eigenvalues. Discret. Appl. Math. 277, 163\u2013171 (2020)","journal-title":"Discret. Appl. Math."},{"key":"13_CR10","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 Comput. Syst. 38, 373\u2013392 (2005)","journal-title":"Theory Comput. Syst."},{"issue":"8\u201310","key":"13_CR11","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.tcs.2008.10.021","volume":"410","author":"J Guo","year":"2009","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. Theoret. Comput. Sci. 410(8\u201310), 718\u2013726 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR12","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. 4957, pp. 711\u2013722. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_61"},{"key":"13_CR13","unstructured":"Madathil, J., Meeks, K.: Parameterized algorithms for balanced cluster edge modification problems (2024)"},{"key":"13_CR14","unstructured":"Misra, N., Mittal, H., Saurabh, S., Thakkar, D.: On the complexity of the eigenvalue deletion problem. In: Iwata, S., Kakimura, N., eds, 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol. 283, pp. 53:1\u201353:17. Dagstuhl, Germany. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"13_CR15","unstructured":"Steinvik, A.: Kernelization for balanced graph clustering. Master\u2019s thesis, The University of Bergen (2020)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00224-020-10005-w","volume":"65","author":"D Tsur","year":"2021","unstructured":"Tsur, D.: Faster parameterized algorithm for cluster vertex deletion. Theory Comput. Syst. 65, 1\u201321 (2021)","journal-title":"Theory Comput. Syst."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"106171","DOI":"10.1016\/j.ipl.2021.106171","volume":"173","author":"D Tsur","year":"2022","unstructured":"Tsur, D.: Cluster deletion revisited. Inf. Process. Lett. 173, 106171 (2022)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:32Z","timestamp":1758498332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}