{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:32Z","timestamp":1725552152031},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_25","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"283-294","source":"Crossref","is-referenced-by-count":3,"title":["On the Fixed-Parameter Enumerability of Cluster Editing"],"prefix":"10.1007","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chawla, S., Blum, A.: Correlation clustering. In: 43rd IEEE FOCS 2002, pp. 238\u2013247 (2002)","DOI":"10.1109\/SFCS.2002.1181947"},{"key":"25_CR2","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. Comp.\u00a032, 864\u2013879 (2003)","journal-title":"SIAM J. Comp."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-30559-0_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Chor","year":"2004","unstructured":"Chor, B., Fellows, M.R., Juedes, D.: Linear kernels in linear time, or how to save k colors in O(n\n                           2) steps. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 257\u2013269. Springer, Heidelberg (2004)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. In: [6], 1-12, journal version accepted for a special issue of Theoretical Computer Science","DOI":"10.1007\/978-3-540-28639-4_1"},{"key":"25_CR5","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":"25_CR6","unstructured":"Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 13\u201324. Springer, Heidelberg (2004)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-30559-0_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.R. Fellows","year":"2004","unstructured":"Fellows, M.R., Heggernes, P., Rosamond, F., Sloper, C., Telle, J.A.: Exact algorithms for finding k disjoint triangles in an arbitrary graph. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 235\u2013244. Springer, Heidelberg (2004)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/3-540-45655-4_60","volume-title":"Computing and Combinatorics","author":"H. Fernau","year":"2002","unstructured":"Fernau, H.: On parameterized enumeration. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 564\u2013573. Springer, Heidelberg (2002)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-44849-7_17","volume-title":"Algorithms and Complexity","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol.\u00a02653, pp. 108\u2013119. Springer, Heidelberg (2003)"},{"key":"25_CR10","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":"25_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4153\/CJM-1955-001-4","volume":"7","author":"R.E. Greenwood","year":"1955","unstructured":"Greenwood, R.E., Gleason, A.M.: Combinatorial relations and chromatic graphs. Canad J. Math.\u00a07, 1\u20137 (1955)","journal-title":"Canad J. Math."},{"key":"25_CR12","volume-title":"Machine Learning","author":"T.M. Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Prieto, E., Sloper, C.: Looking at the stars. In: [6], pp. 138\u2013148","DOI":"10.1007\/978-3-540-28639-4_13"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Math. 144, 173\u2013182 (2004); preliminary version. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 379\u2013390. Springer, Heidelberg (2002)","DOI":"10.1016\/j.dam.2004.01.007"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1093\/bioinformatics\/btg232","volume":"19","author":"R. Sharan","year":"2003","unstructured":"Sharan, R., Maron-Katz, A., Shamir, R.: Click and Expander: A system for clustering and visualizing gene expression data. Bioinformatics\u00a019, 1787\u20131799 (2003)","journal-title":"Bioinformatics"},{"key":"25_CR16","first-page":"269","volume-title":"Current Topics in Computational Molecular Biology","author":"R. Sharan","year":"2002","unstructured":"Sharan, R., Shamir, R.: Algorithmic approaches to clustering gene expression data. In: Current Topics in Computational Molecular Biology, pp. 269\u2013300. MIT Press, Cambridge (2002)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:23Z","timestamp":1619507063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11604686_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}