{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:38:31Z","timestamp":1772753911477,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540742395","type":"print"},{"value":"9783540742401","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74240-1_27","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T11:04:18Z","timestamp":1188212658000},"page":"312-321","source":"Crossref","is-referenced-by-count":31,"title":["Efficient Parameterized Preprocessing for Cluster Editing"],"prefix":"10.1007","author":[{"given":"Michael","family":"Fellows","sequence":"first","affiliation":[]},{"given":"Michael","family":"Langston","sequence":"additional","affiliation":[]},{"given":"Frances","family":"Rosamond","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Shaw","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Abu-Khzam, F., Collins, R., Fellows, M., Langston, M., Suters, W.H., Symons, C.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Proceedings of ALENEX 2004, pp. 62\u201369. ACM-SIAM Publications (2004)"},{"key":"27_CR2","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. Machine Learning 56, 89\u2013113 (2004) (Preliminary version In: Proceedings 43rd IEEE FOCS 2002, pp. 238\u2013247)","journal-title":"Machine Learning"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1155\/JBB.2005.172","volume":"2","author":"N.E. Baldwin","year":"2005","unstructured":"Baldwin, N.E., Chesler, E.J., Kirov, S., Langston, M.A., Snoddy, J.R., Williams, R.W., Zhang, B.: Computational, integrative and comparative methods for the elucidation of gene regulatory networks. J. Biomedicine and Biotechnology\u00a02, 172\u2013180 (2005)","journal-title":"J. Biomedicine and Biotechnology"},{"key":"27_CR4","volume-title":"Proceedings of the IEEE International Workshop on High Performance Computational Biology (HiCOMB)","author":"N.E. Baldwin","year":"2004","unstructured":"Baldwin, N.E., Collins, R.L., Langston, M.A., Leuze, M.R., Symons, C.T., Voy, B.H.: High performance computational tools for motif discovery. In: Proceedings of the IEEE International Workshop on High Performance Computational Biology (HiCOMB). IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"27_CR5","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, 171\u2013176 (1996)","journal-title":"Information Processing Letters"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-540-27810-8_16","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Chleb\u00edk","year":"2004","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Improvement of Nemhauser-Trotter theorem and its applications in parameterized complexity. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 174\u2013186. Springer, Heidelberg (2004)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","first-page":"36","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Chor","year":"2004","unstructured":"Chor, B., Fellows, M., Juedes, D.: Linear kernels in linear time. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 36\u201353. Springer, Heidelberg (2004)"},{"key":"27_CR8","doi-asserted-by":"publisher","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. Journal of Computer and System Sciences\u00a071, 360\u2013383 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539701389154","volume":"32","author":"Z.Z. Chen","year":"2003","unstructured":"Chen, Z.Z., Jiang, T., Lin, G.: Computing phylogenetic roots with bounded degrees and errors. SIAM J. Computing\u00a032, 864\u2013879 (2003)","journal-title":"SIAM J. Computing"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11604686_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P. Damaschke","year":"2005","unstructured":"Damaschke, P.: On the fixed-parameter enumerability of cluster editing. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 283\u2013294. Springer, Heidelberg (2005)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11758471_33","volume-title":"Algorithms and Complexity","author":"P. Damaschke","year":"2006","unstructured":"Damaschke, P.: Fixed-parameter tractable generalizations of cluster editing. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 321\u2013332. Springer, Heidelberg (2006)"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2005.10.004","volume":"351","author":"P. Damaschke","year":"2006","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoretical Computer Science\u00a0351, 337\u2013350 (2006)","journal-title":"Theoretical Computer Science"},{"key":"27_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-540-28639-4_24","volume-title":"Parameterized and Exact Computation","author":"F. Dehne","year":"2004","unstructured":"Dehne, F., Fellows, M., Rosamond, F., Shaw, P.: Greedy localization, iterative compression and modeled crown reductions: new FPT techniques, an improved algorithm for set splitting and a novel 2k kernelization for vertex cover. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 271\u2013280. Springer, Heidelberg (2004)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11847250_2","volume-title":"Parameterized and Exact Computation","author":"F. Dehne","year":"2006","unstructured":"Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The Cluster Editing problem: implementations and experiments. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 13\u201324. Springer, Heidelberg (2006)"},{"key":"27_CR16","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"27_CR17","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, 321\u2013347 (2004)","journal-title":"Algorithmica"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: exact algorithms for clique generation. Theory of Computing Systems 38, 373\u2013392 (2005) (preliminary version In: Proceedings of the 5th Italian Conference on Algorithms and Complexity (CIAC 2003). Lecture Notes in Computer Science 2653, pp. 108\u2013119. Springer-Verlag (2003))","DOI":"10.1007\/s00224-004-1178-y"},{"key":"27_CR19","unstructured":"Guo, J.: Manuscript (2007)"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M. Krivanek","year":"1986","unstructured":"Krivanek, M., Moravek, J.: NP-hard problems in hierarchical tree clustering. Acta Informatica\u00a023, 311\u2013323 (1986)","journal-title":"Acta Informatica"},{"key":"27_CR21","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G. Nemhauser","year":"1975","unstructured":"Nemhauser, G., Trotter, L.: Vertex packings: structural properties and algorithms. Mathematical Programming\u00a08, 232\u2013248 (1975)","journal-title":"Mathematical Programming"},{"key":"27_CR23","unstructured":"Prieto-Rodriguez, E.: Systematic kernelization in FPT algorithm design. Ph.D. Thesis, School of EE&CS, University of Newcastle, Australia (2005)"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/978-3-540-28639-4_13","volume-title":"Parameterized and Exact Computation","author":"E. Prieto","year":"2004","unstructured":"Prieto, E., Sloper, C.: Looking at the stars. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 138\u2013148. Springer, Heidelberg (2004)"},{"key":"27_CR25","doi-asserted-by":"crossref","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 144, 173\u2013182 (2004) (Preliminary version In: 28th WG 2002, LNCS 2573, pp. 379\u2013390 (2002))","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74240-1_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:15:14Z","timestamp":1619518514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74240-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742395","9783540742401"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74240-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}