{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:35:41Z","timestamp":1773272141395,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540390985","type":"print"},{"value":"9783540391012","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847250_2","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T15:43:02Z","timestamp":1158162182000},"page":"13-24","source":"Crossref","is-referenced-by-count":44,"title":["The Cluster Editing Problem: Implementations and Experiments"],"prefix":"10.1007","author":[{"given":"Frank","family":"Dehne","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[]},{"given":"Xuemei","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Pitre","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Shaw","sequence":"additional","affiliation":[]},{"given":"Yun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_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, Workshop on Algorithm Engineering and Experiments, New Orleans, Louisiana (2004)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N., Langston, M.A., Shanbhag, P., Symons, C.T.: Scalable parallel algorithms for FPT problems. Algorithmica (2006) (accepted for publication)","DOI":"10.1007\/s00453-006-1214-1"},{"key":"2_CR3","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":"2_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":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","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. 344\u2013355. Springer, Heidelberg (2006)"},{"issue":"4","key":"2_CR6","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., Hueffner, F., Niedermeier, R.: Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. Theory of Computing Systems\u00a038(4), 373\u2013392 (2005)","journal-title":"Theory of Computing Systems"},{"key":"2_CR7","unstructured":"Guo, J.: Algorithm design techniques for parameterized graph modification problems. PhD thesis, Univ. Jena (2005)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-36379-3_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Hemaspaandra","year":"2002","unstructured":"Hemaspaandra, E., Rothe, J., Spakowski, H.: Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 258\u2013269. Springer, Heidelberg (2002)"},{"key":"2_CR9","volume-title":"The Art of Computer Programming, Seminumerical algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, Seminumerical algorithms, 3rd edn., vol.\u00a02. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"2_CR10","unstructured":"Zhang, Y., Abu-Khzam, F.N., Baldwin, N.E., Chesler, E.J., Langston, M.A., Samatova, N.F.: Genome-scale computational approaches to memory-intensive applications in systems biology. In: Proceedings, Supercomputing, Seattle, Washington (2005)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847250_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:18:42Z","timestamp":1619507922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847250_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540390985","9783540391012"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11847250_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}