{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:09:08Z","timestamp":1725757748390},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_25","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T06:13:18Z","timestamp":1385014398000},"page":"284-294","source":"Crossref","is-referenced-by-count":2,"title":["The Multi-parameterized Cluster Editing Problem"],"prefix":"10.1007","author":[{"given":"Faisal N.","family":"Abu-Khzam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"52","key":"25_CR1","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., Truss, A.: Going weighted: Parameterized algorithms for cluster editing. Theor. Comput. Sci.\u00a0410(52), 5467\u20135480 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-25011-8_7","volume-title":"Combinatorial Algorithms","author":"S. B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S.: A golden ratio parameterized algorithm for cluster editing. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 85\u201395. Springer, Heidelberg (2011)"},{"issue":"2","key":"25_CR3","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":"4","key":"25_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.\u00a058(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"25_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\u00a064(1), 152\u2013169 (2012)","journal-title":"Algorithmica"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-14031-0_49","volume-title":"Computing and Combinatorics","author":"J. Chen","year":"2010","unstructured":"Chen, J., Meng, J.: A 2k kernel for the cluster editing problem. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol.\u00a06196, pp. 459\u2013468. Springer, Heidelberg (2010)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"25_CR8","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"key":"25_CR9","unstructured":"Ghrayeb, A.: Improved search-tree algorithms for the cluster edit problem. MS thesis, Lebanese American University (2011)"},{"issue":"4","key":"25_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. Theor. Comp. Sys.\u00a038(4), 373\u2013392 (2005)","journal-title":"Theor. Comp. Sys."},{"issue":"8-10","key":"25_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. Theor. Comput. Sci.\u00a0410(8-10), 718\u2013726 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"15","key":"25_CR12","doi-asserted-by":"publisher","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. Discrete Applied Mathematics\u00a0160(15), 2259\u20132270 (2012)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M. Kriv\u00e1nek","year":"1986","unstructured":"Kriv\u00e1nek, M., Mor\u00e1vek, J.: NP -hard problems in hierarchical-tree clustering. Acta Inf.\u00a023(3), 311\u2013323 (1986)","journal-title":"Acta Inf."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Langston, M.A.: Private communication (2012)","DOI":"10.12968\/nuwa.2012.2.4.1096940"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"1-2","key":"25_CR16","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"},{"issue":"4","key":"25_CR17","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00453-011-9546-x","volume":"64","author":"J.M.M. Rooij van","year":"2012","unstructured":"van Rooij, J.M.M., Bodlaender, H.L.: Exact algorithms for edge domination. Algorithmica\u00a064(4), 535\u2013563 (2012)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T22:03:29Z","timestamp":1647468209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}