乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:29:37Z","timestamp":1725506977598},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787723"},{"type":"electronic","value":"9783540787730"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78773-0_61","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T04:38:35Z","timestamp":1207197515000},"page":"711-722","source":"Crossref","is-referenced-by-count":11,"title":["Fixed-Parameter Algorithms for Cluster Vertex Deletion"],"prefix":"10.1007","author":[{"given":"Falk","family":"H\u00fcffner","sequence":"first","affiliation":[]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[]},{"given":"Hannes","family":"Moser","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"61_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-73951-7_38","volume-title":"Algorithms and Data Structures","author":"F.N. Abu-Khzam","year":"2007","unstructured":"Abu-Khzam, F.N.: Kernelization algorithms for d-hitting set problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 434\u2013445. Springer, Heidelberg (2007)"},{"key":"61_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/11847250_24","volume-title":"Parameterized and Exact Computation","author":"F.N. Abu-Khzam","year":"2006","unstructured":"Abu-Khzam, F.N., Fernau, H.: Kernels: Annotated, proper and induced. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 264\u2013275. Springer, Heidelberg (2006)"},{"key":"61_CR3","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Proofs of conjectures in Aggregating inconsistent information: Ranking and clustering. Technical Report TR-719-05, Department of Computer Science, Princeton University (2005)","DOI":"10.1145\/1060590.1060692"},{"key":"61_CR4","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q.B.A., Tru\u00df, A.: PEACE: Parameterized and exact algorithms for cluster editing. Manuscript, Lehrstuhl f\u00fcr Bioinformatik, Friedrich-Schiller-Universit\u00e4t Jena (September 2007)"},{"key":"61_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11821069_21","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J. Chen","year":"2006","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"key":"61_CR6","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. Dehne","year":"2006","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)"},{"key":"61_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-74240-1_27","volume-title":"Fundamentals of Computation Theory","author":"M.R. Fellows","year":"2007","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)"},{"key":"61_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/11758471_32","volume-title":"Algorithms and Complexity","author":"H. Fernau","year":"2006","unstructured":"Fernau, H.: Parameterized algorithms for hitting set: The weighted case. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 332\u2013343. Springer, Heidelberg (2006)"},{"key":"61_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.4086\/toc.2006.v002a013","volume":"2","author":"I. Giotis","year":"2006","unstructured":"Giotis, I., Guruswami, V.: Correlation clustering with a fixed number of clusters. Theory of Computing\u00a02, 249\u2013266 (2006)","journal-title":"Theory of Computing"},{"issue":"4","key":"61_CR10","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":"61_CR11","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: Exact algorithms for clique generation. Theory of Computing Systems\u00a038(4), 373\u2013392 (2005)","journal-title":"Theory of Computing Systems"},{"key":"61_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-74450-4_4","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"J. Guo","year":"2007","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol.\u00a04614, pp. 36\u201347. Springer, Heidelberg (2007)"},{"key":"61_CR13","doi-asserted-by":"crossref","unstructured":"H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Techniques for practical fixed-parameter algorithms. The Computer Journal 51(1) (2008)","DOI":"10.1093\/comjnl\/bxm040"},{"issue":"1","key":"61_CR14","first-page":"45","volume":"31","author":"K. Jansen","year":"1997","unstructured":"Jansen, K., Scheffler, P., Woeginger, G.: The disjoint cliques problem. RAIRO Recherche Op\u00e9rationnelle\u00a031(1), 45\u201366 (1997)","journal-title":"RAIRO Recherche Op\u00e9rationnelle"},{"issue":"2","key":"61_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"J.M. Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences\u00a020(2), 219\u2013230 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"61_CR16","series-title":"Oxford Lecture Series in Mathematics and Its Applications","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 Lecture Series in Mathematics and Its Applications, vol.\u00a031. Oxford University Press, Oxford (2006)"},{"issue":"2","key":"61_CR17","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/S0196-6774(03)00005-1","volume":"47","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: On efficient fixed-parameter algorithms for weighted vertex cover. Journal of Algorithms\u00a047(2), 320\u2013331 (2003)","journal-title":"Journal of Algorithms"},{"key":"61_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11847250_1","volume-title":"Parameterized and Exact Computation","author":"F. Protti","year":"2006","unstructured":"Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying modular decomposition to parameterized bicluster editing. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"61_CR19","doi-asserted-by":"crossref","unstructured":"Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Tru\u00df, A., B\u00f6cker, S.: Exact and heuristic algorithms for weighted cluster editing. In: Proc.\u00a06th\u00a0CSB. Computational Systems Bioinformatics, vol.\u00a06, pp. 391\u2013401. Imperial College Press (2007)","DOI":"10.1142\/9781860948732_0040"},{"issue":"4","key":"61_CR20","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B. Reed","year":"2004","unstructured":"Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters\u00a032(4), 299\u2013301 (2004)","journal-title":"Operations Research Letters"},{"issue":"1-2","key":"61_CR21","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"},{"key":"61_CR22","unstructured":"Wahlstr\u00f6m, M.: Algorithms, Measures and Upper Bounds for Satisfiability and Related Problems. PhD thesis, Department of Computer and Information Science, Link\u00f6pings universitet (2007)"},{"key":"61_CR23","volume-title":"Proc.\u00a05th\u00a0WAOA, LNCS. Springer, Heidelberg (to appear, 2007)","author":"A. Zuylen van","year":"2007","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Proc.\u00a05th\u00a0WAOA, LNCS. Springer, Heidelberg (to appear, 2007)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2008: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78773-0_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T08:03:46Z","timestamp":1684310626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78773-0_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787723","9783540787730"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78773-0_61","relation":{},"subject":[]}}