{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:16:02Z","timestamp":1774419362163,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540343752","type":"print"},{"value":"9783540343783","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_33","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"344-355","source":"Crossref","is-referenced-by-count":4,"title":["Fixed-Parameter Tractable Generalizations of Cluster Editing"],"prefix":"10.1007","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","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"},{"key":"33_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":"#cr-split#-33_CR3.1","doi-asserted-by":"crossref","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoretical Computer Science??351, 337???350 (2006);","DOI":"10.1016\/j.tcs.2005.10.004"},{"key":"#cr-split#-33_CR3.2","unstructured":"Special issue: 1st International Workshop on Parameterized and Exact Computation IWPEC 2004"},{"key":"33_CR4","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":"33_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":"33_CR6","unstructured":"Fernau, H.: A top-down approach to search trees: improved algorithmics for 3-hitting set, ECCC Report 73 (2004)"},{"key":"33_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-1-4757-4305-0_3","volume-title":"Survey of Text Mining","author":"H. Frigui","year":"2004","unstructured":"Frigui, H., Nasraoui, O.: Simultaneous clustering and dynamic keyword weighting for text documents. In: Berry, M. (ed.) Survey of Text Mining, pp. 45\u201370. Springer, Heidelberg (2004)"},{"key":"#cr-split#-33_CR8.1","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H??ffner, F., Niedermeier, R.: Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. Theory of Computing Systems??38, 373???392 (2005);","DOI":"10.1007\/s00224-004-1178-y"},{"key":"#cr-split#-33_CR8.2","unstructured":"Preliminary version In: 5th CIAC 2003. LNCS vol. 2653, pp. 108-119. Springer, Heidelberg (2003)"},{"key":"33_CR9","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":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"J. Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: Distance from triviality. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 162\u2013173. Springer, Heidelberg (2004)"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-40996-3_46","volume-title":"Algorithms and Computation","author":"G.H. Lin","year":"2000","unstructured":"Lin, G.H., Jiang, T., Kearney, P.E.: Phylogenetic k-root and Steiner k-root. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 539\u2013551. Springer, Heidelberg (2000)"},{"key":"#cr-split#-33_CR12.1","doi-asserted-by":"crossref","unstructured":"Nishimura, N., Ragde, P., Thilikos, D.M.: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.??2125, pp. 75???86. Springer, Heidelberg (2001);","DOI":"10.1007\/3-540-44634-6_8"},{"key":"#cr-split#-33_CR12.2","unstructured":"Journal version to appear in Discrete Applied Math."},{"key":"#cr-split#-33_CR13.1","doi-asserted-by":"crossref","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Math.??144, 173???182 (2004);","DOI":"10.1016\/j.dam.2004.01.007"},{"key":"#cr-split#-33_CR13.2","unstructured":"Preliminary version In: Ku??era, L. (ed.) WG 2002. LNCS, vol.??2573, pp. 379???390. Springer, Heidelberg (2002)"},{"key":"33_CR14","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":"33_CR15","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)"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/11533719_4","volume-title":"Computing and Combinatorics","author":"S. Wu","year":"2005","unstructured":"Wu, S., Gu, X.: Gene network: Model, dynamics and simulation. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 12\u201321. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:28Z","timestamp":1619507068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11758471_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}