{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:18:52Z","timestamp":1725535132420},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_51","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T10:49:21Z","timestamp":1247222961000},"page":"516-526","source":"Crossref","is-referenced-by-count":6,"title":["Graph-Based Data Clustering with Overlaps"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Uhlmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach.\u00a0Learn.\u00a056(1-3), 89\u2013113 (2004)","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Dor, A., Shamir, R., Yakhini, Z.: Clustering gene expression patterns. J.\u00a0Comput. Biol.\u00a06(3\/4), 281\u2013292 (1999)","DOI":"10.1089\/106652799318274"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q.B.A., Tru\u00df, A.: Going weighted: Parameterized algorithms for cluster editing. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol.\u00a05165, pp. 1\u201312. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-85097-7_1"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6cker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: Evaluation and experiments. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 289\u2013302. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-68552-4_22"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett.\u00a058(4), 171\u2013176 (1996)","DOI":"10.1016\/0020-0190(96)00050-6"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Damaschke, P.: Fixed-parameter enumerability of Cluster Editing and related problems. Theory Comput. Syst. (to appear, 2009)","DOI":"10.1007\/s00224-008-9130-1"},{"key":"51_CR7","doi-asserted-by":"crossref","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)","DOI":"10.1007\/11847250_2"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Langston, M.A., Rosamond, F.A., Shaw, P.: Efficient parameterized preprocessing for Cluster Editing. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 312\u2013321. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-74240-1_27"},{"key":"51_CR10","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Theory Comput. Syst.\u00a038(4), 373\u2013392 (2005)","DOI":"10.1007\/s00224-004-1178-y"},{"key":"51_CR12","unstructured":"Greenwell, D.L., Hemminger, R.L., Klerlein, J.B.: Forbidden subgraphs. In: Proc. 4th Southeastern Conf. on Comb., Graph Theory and Computing, Utilitas Mathematica, pp. 389\u2013394 (1973)"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Guo, J.: A more effective linear kernelization for Cluster Editing. Theor. Comput. Sci.\u00a0410(8-10), 718\u2013726 (2009)","DOI":"10.1016\/j.tcs.2008.10.021"},{"key":"51_CR14","doi-asserted-by":"crossref","unstructured":"Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: A more relaxed model for graph-based data clustering: s-plex editing. In: Proc.\u00a05th\u00a0AAIM. LNCS, Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02158-9_20"},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"K\u0159iv\u00e1nek, M., Mor\u00e1vek, J.: NP-hard problems in hierarchical-tree clustering. Acta Inform.\u00a023(3), 311\u2013323 (1986)","DOI":"10.1007\/BF00289116"},{"key":"51_CR16","doi-asserted-by":"crossref","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 260\u2013272. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"51_CR18","doi-asserted-by":"crossref","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature\u00a0435(7043), 814\u2013818 (2005)","DOI":"10.1038\/nature03607"},{"key":"51_CR19","doi-asserted-by":"crossref","unstructured":"Peeters, R.: The maximum edge biclique problem is NP-complete. Discrete Appl. Math.\u00a0131(3), 651\u2013654 (2003)","DOI":"10.1016\/S0166-218X(03)00333-0"},{"key":"51_CR20","doi-asserted-by":"crossref","unstructured":"Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying modular decomposition to parameterized cluster editing problems. Theory Comput.\u00a0Syst.\u00a044(1), 91\u2013104 (2009)","DOI":"10.1007\/s00224-007-9032-7"},{"key":"51_CR21","doi-asserted-by":"crossref","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math.\u00a0144(1\u20132), 173\u2013182 (2004)","DOI":"10.1016\/j.dam.2004.01.007"},{"key":"51_CR22","doi-asserted-by":"crossref","unstructured":"Sharan, R., Maron-Katz, A., Shamir, R.: CLICK and EXPANDER: a system for clustering and visualizing gene expression data. Bioinformatics\u00a019(14), 1787\u20131799 (2003)","DOI":"10.1093\/bioinformatics\/btg232"},{"key":"51_CR23","doi-asserted-by":"crossref","unstructured":"Talmaciu, M., Nechita, E.: Recognition algorithm for diamond-free graphs. Informatica\u00a018(3), 457\u2013462 (2007)","DOI":"10.15388\/Informatica.2007.188"},{"key":"51_CR24","doi-asserted-by":"crossref","unstructured":"Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a015(11), 1101\u20131113 (1993)","DOI":"10.1109\/34.244673"},{"key":"51_CR25","doi-asserted-by":"crossref","unstructured":"Xu, R., Wunsch II, D.: Survey of clustering algorithms. IEEE Transactions on Neural Networks\u00a016(3), 645\u2013678 (2005)","DOI":"10.1109\/TNN.2005.845141"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T12:40:54Z","timestamp":1589978454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}