{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T22:20:46Z","timestamp":1769206846395,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642250101","type":"print"},{"value":"9783642250118","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25011-8_7","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T20:27:34Z","timestamp":1320784054000},"page":"85-95","source":"Crossref","is-referenced-by-count":5,"title":["A Golden Ratio Parameterized Algorithm for Cluster Editing"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"B\u00f6cker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"52","key":"7_CR1","doi-asserted-by":"publisher","first-page":"5467","DOI":"10.1016\/j.tcs.2009.05.006","volume":"410","author":"S. B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q.B.A., Truss, A.: Going weighted: Parameterized algorithms for cluster editing. Theor. Comput. Sci.\u00a0410(52), 5467\u20135480 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s00453-009-9339-7","volume":"60","author":"S. B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: Evaluation and experiments. Algorithmica\u00a060(2), 316\u2013334 (2011)","journal-title":"Algorithmica"},{"issue":"14","key":"7_CR3","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/j.ipl.2011.05.003","volume":"111","author":"S. B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Damaschke, P.: Even faster parameterized cluster deletion and cluster editing. Inform. Process. Lett.\u00a0111(14), 717\u2013721 (2011)","journal-title":"Inform. Process. Lett."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-17493-3_8","volume-title":"Parameterized and Exact Computation","author":"Y. Cao","year":"2010","unstructured":"Cao, Y., Chen, J.: Cluster Editing: Kernelization Based on Edge Cuts. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 60\u201371. Springer, Heidelberg (2010)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-14031-0_49","volume-title":"Computing and Combinatorics","author":"J. Chen","year":"2010","unstructured":"Chen, J., Meng, J.: A 2k Kernel for the Cluster Editing Problem. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol.\u00a06196, pp. 459\u2013468. Springer, Heidelberg (2010)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-11269-0_8","volume-title":"Parameterized and Exact Computation","author":"P. Damaschke","year":"2009","unstructured":"Damaschke, P.: Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 98\u2013109. Springer, Heidelberg (2009)"},{"key":"7_CR7","doi-asserted-by":"publisher","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)"},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"issue":"4","key":"7_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(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"issue":"4","key":"7_CR10","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., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. Theor. Comput. Syst.\u00a038(4), 373\u2013392 (2005)","journal-title":"Theor. Comput. Syst."},{"issue":"8-10","key":"7_CR11","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.tcs.2008.10.021","volume":"410","author":"J. Guo","year":"2009","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. Theor. Comput. Sci.\u00a0410(8-10), 718\u2013726 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-54945-5_49","volume-title":"ISA \u201991 Algorithms","author":"W.-L. Hsu","year":"1991","unstructured":"Hsu, W.-L., Ma, T.-H.: Substitution Decomposition on Chordal Graphs and Applications. In: Hsu, W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol.\u00a0557, pp. 52\u201360. Springer, Heidelberg (1991)"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M. K\u0159iv\u00e1nek","year":"1986","unstructured":"K\u0159iv\u00e1nek, M., Mor\u00e1vek, J.: NP-hard problems in hierarchical-tree clustering. Acta. Inform.\u00a023(3), 311\u2013323 (1986)","journal-title":"Acta. Inform."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: Proc. of ACM Symposium on Theory of Computing, STOC 2011, pp. 469\u2013478. ACM (2011), doi:10.1145\/1993636.1993699","DOI":"10.1145\/1993636.1993699"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R. Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter-tractable algorithms. Inform. Process. Lett.\u00a073, 125\u2013129 (2000)","journal-title":"Inform. Process. Lett."},{"key":"7_CR17","unstructured":"Rosamond, F. (ed.): FPT News: The Parameterized Complexity Newsletter (Since 2005), \n                  \n                    http:\/\/fpt.wikidot.com\/"},{"issue":"6","key":"7_CR18","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1038\/nmeth0610-419","volume":"7","author":"T. Wittkop","year":"2010","unstructured":"Wittkop, T., Emig, D., Lange, S., Rahmann, S., Albrecht, M., Morris, J.H., B\u00f6cker, S., Stoye, J., Baumbach, J.: Partitioning biological data with transitivity clustering. Nat. Methods\u00a07(6), 419\u2013420 (2010)","journal-title":"Nat. Methods"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25011-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T01:43:06Z","timestamp":1555378986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25011-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250101","9783642250118"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25011-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}