{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:19:31Z","timestamp":1725517171957},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852377"},{"type":"electronic","value":"9783540852384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85238-4_11","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T15:34:36Z","timestamp":1219073676000},"page":"144-155","source":"Crossref","is-referenced-by-count":2,"title":["Clustering with Partial Information"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Mancini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charis","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frances","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: Theory and experiments. In: Proceedings of ALENEX\/ANALC 2004 - 6th Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, pp. 62\u201369 (2004)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. In: Proceedings of FOCS 2002 - 43rd Symposium on Foundations of Computer Science, p. 238 (2002)","DOI":"10.1109\/SFCS.2002.1181947"},{"issue":"1-3","key":"11_CR3","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(1-3), 89\u2013113 (2004)","journal-title":"Machine Learning"},{"issue":"3-4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A. Ben-Dor","year":"1999","unstructured":"Ben-Dor, A., Shamir, R., Yakhini, Z.: Clustering gene expression patterns. Journal of Computational Biology\u00a06(3-4), 281\u2013297 (1999)","journal-title":"Journal of Computational Biology"},{"key":"11_CR5","unstructured":"Bodlaender, H.L., Fellows, M.R., Heggernes, P., Mancini, F., Papadopoulos, C., Rosamond, F.: Clustering with partial information. Reports in Informatics 373, University of Bergen, Norway (2008)"},{"key":"11_CR6","first-page":"421","volume":"10","author":"N.J. Bruijin De","year":"1948","unstructured":"De Bruijin, N.J., Erdos, P.: On a combinatorial problem. Ind. Math.\u00a010, 421\u2013423 (1948)","journal-title":"Ind. Math."},{"issue":"4","key":"11_CR7","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":"3","key":"11_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. J. Comput. Syst. Sci.\u00a071(3), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"11_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. Comput.\u00a032(4), 864\u2013879 (2003)","journal-title":"SIAM J. Comput."},{"key":"11_CR10","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.K.H.A. Dehne","year":"2006","unstructured":"Dehne, F.K.H.A., Langston, M.A., Luo, X., Shaw, P., Zhang, Y., Pitre, S.: 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)"},{"issue":"2-3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2006.05.008","volume":"361","author":"E.D. Demaine","year":"2006","unstructured":"Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theor. Comput. Sci.\u00a0361(2-3), 172\u2013187 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Immorlica, N.: Correlation clustering with partial information. In: Proceedings of RANDOM-APPROX 2003 - 7th International Workshop on Randomization and Approximation Techniques in Computer Science, pp. 1\u201313 (2003)","DOI":"10.1007\/978-3-540-45198-3_1"},{"key":"11_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":"11_CR14","doi-asserted-by":"crossref","unstructured":"Emanuel, D., Fiat, A.: Correlation clustering - minimizing disagreements on arbitrary weighted graphs. In: Proceedings of ESA 2003 - 11th Annual European Symposium on Algorithms, pp. 208\u2013220 (2003)","DOI":"10.1007\/978-3-540-39658-1_21"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/11847250_25","volume-title":"Proceedings of IWPEC 2006 - Parameterized and Exact Computation, Second International Workshop","author":"M.R. Fellows","year":"2006","unstructured":"Fellows, M.R.: The Lost Continent of Polynomial Time: Preprocessing and Kernelization. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 276\u2013277. Springer, Heidelberg (2006)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Langston, M.A., Rosamond, F.A., Shaw, P.: Efficient parameterized preprocessing for cluster editing. In: Proceedings of FCT 2007 - Fundamentals of Computation Theory, 16th International Symposium, pp. 312\u2013321 (2007)","DOI":"10.1007\/978-3-540-74240-1_27"},{"key":"11_CR17","unstructured":"Fellows, M.R., Mnich, M., Rosamond, F., Saurabh, S.: Manuscript (2008)"},{"issue":"3","key":"11_CR18","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"M.C. Golumbic","year":"1995","unstructured":"Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. J. Algorithms\u00a019(3), 449\u2013473 (1995)","journal-title":"J. Algorithms"},{"issue":"4","key":"11_CR19","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., Huffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Theory Comput. Syst.\u00a038(4), 373\u2013392 (2005)","journal-title":"Theory Comput. Syst."},{"key":"11_CR20","first-page":"86","volume-title":"Proceedings of the 8th ACM-SIAM ALENEX","author":"J. Gramm","year":"2006","unstructured":"Gramm, J., Guo, J., Huffner, F., Niedermeier, R.: Data reduction, exact, and heuristic algorithms for clique cover. In: Proceedings of the 8th ACM-SIAM ALENEX, pp. 86\u201394. ACM-SIAM, New York (2006)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. In: Proceedings of ESCAPE 2007 - Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, pp. 36\u201347 (2007)","DOI":"10.1007\/978-3-540-74450-4_4"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"issue":"3","key":"11_CR23","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":"11_CR24","first-page":"59","volume":"67","author":"S.H. Ma","year":"1988","unstructured":"Ma, S.H., Wallis, W.D., Wu, J.L.: The complexity of the clique partition number problem. Congr. Numer.\u00a067, 59\u201366 (1988)","journal-title":"Congr. Numer."},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-540-28639-4_7","volume-title":"Proceedings of IWPEC 2004 - 1st International Workshop on Parameterized and Exact Computation","author":"D. Marx","year":"2004","unstructured":"Marx, D.: Parameterized Graph Separation Problems. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 71\u201382. Springer, Heidelberg (2004)"},{"key":"11_CR26","unstructured":"Mujuni, E., Rosamond, F.A.: Parameterized complexity of the clique partition problem. In: Proceedings of ACiD 2007 - 2nd Workshop of Algorithms and Complexity in Durham (2007)"},{"key":"11_CR27","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":"11_CR28","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/1385-7258(77)90055-5","volume":"39","author":"J. Orlin","year":"1977","unstructured":"Orlin, J.: Contentment in graph theory: Covering graphs with cliques. Indagationes Math.\u00a039, 406\u2013424 (1977)","journal-title":"Indagationes Math."},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying modular decomposition to parameterized bicluster editing. In: Proceedings of IWPEC 2006 - Parameterized and Exact Computation, Second International Workshop, pp. 1\u201312 (2006)","DOI":"10.1007\/11847250_1"},{"issue":"1-2","key":"11_CR30","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"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:23:22Z","timestamp":1606184602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852377","9783540852384"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}