{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:39:49Z","timestamp":1725896389739},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_10","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T10:52:03Z","timestamp":1257763923000},"page":"72-82","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Kernels for 3-Leaf Power Graph Modification Problems"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Bessy","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Perez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Trees and proximity representations","author":"J.-P. Barth\u00e9l\u00e9my","year":"1991","unstructured":"Barth\u00e9l\u00e9my, J.-P., Gu\u00e9noche, A.: Trees and proximity representations. John Wiley & Sons, Chichester (1991)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-68552-4_22","volume-title":"Experimental Algorithms","author":"S. B\u00f6cker","year":"2008","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)"},{"key":"10_CR3","unstructured":"Brandst\u00e4dt, A., Le., V.B.: Structure and linear time recognition of 4-leaf powers. ACM Transactions on Algorithms (to appear)"},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ipl.2006.01.004","volume":"98","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Le, V.B.: Structure and linear time recognition of 3-leaf powers. Information Processing Letters\u00a098(4), 133\u2013138 (2006)","journal-title":"Information Processing Letters"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-74839-7_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.-S. Chang","year":"2007","unstructured":"Chang, M.-S., Ko, M.-T.: The 3-steiner root problem. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 109\u2013120. Springer, Heidelberg (2007)"},{"key":"10_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., 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":"10_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00453-005-1180-z","volume":"44","author":"M. Dom","year":"2006","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Neidermeier, R.: Error compensation in leaf root problems. Algorithmica\u00a044, 363\u2013381 (2006)","journal-title":"Algorithmica"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-540-30551-4_35","volume-title":"Algorithms and Computation","author":"M. Dom","year":"2004","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R.: Error compensation in leaf root problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 389\u2013401. Springer, Heidelberg (2004)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11604686_35","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Dom","year":"2005","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R.: Extending the tractability border for closest leaf powers. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 397\u2013408. Springer, Heidelberg (2005)"},{"issue":"18","key":"10_CR10","doi-asserted-by":"publisher","first-page":"3345","DOI":"10.1016\/j.dam.2008.01.007","volume":"156","author":"M. Dom","year":"2008","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R.: Closest 4-leaf power is fixed-parameter tractable. Discrete Applied Mathematics\u00a0156(18), 3345\u20133361 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR11","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":"10_CR12","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., Rosamond, F., 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":"10_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"P.W. Goldberg","year":"1995","unstructured":"Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. Journal of Computational Biology\u00a02, 139\u2013152 (1995)","journal-title":"Journal of Computational Biology"},{"issue":"4","key":"10_CR14","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":"10_CR15","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)"},{"issue":"1","key":"10_CR16","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":"1-3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02614317","volume":"79","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Math. Program.\u00a079(1-3), 191\u2013215 (1997)","journal-title":"Math. Program."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H. Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput\u00a028, 780\u2013791 (1999)","journal-title":"SIAM J. Comput"},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jagm.1998.9999","volume":"29","author":"P. Kearney","year":"1998","unstructured":"Kearney, P., Corneil, D.: Tree powers. Journal of Algorithms\u00a029(1), 111\u2013131 (1998)","journal-title":"Journal of Algorithms"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-40996-3_46","volume-title":"Algorithms and Computation","author":"G.H. Lin","year":"2000","unstructured":"Lin, G.H., Kearney, P.E., Jiang, T.: Phylogenetic k-root and steiner k-root. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 539\u2013551. Springer, Heidelberg (2000)"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A. Natazon","year":"2001","unstructured":"Natazon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Applied Mathematics\u00a0113, 109\u2013128 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR22","series-title":"Oxford Lectures 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. Neidermeier","year":"2006","unstructured":"Neidermeier, R.: Invitation to fixed parameter algorithms. Oxford Lectures Series in Mathematics and its Applications, vol.\u00a031. Oxford University Press, Oxford (2006)"},{"issue":"1","key":"10_CR23","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1195","volume":"42","author":"N. Nishimura","year":"2002","unstructured":"Nishimura, N., Ragde, P., Thilikos, D.: On graph powers for leaf-labeled trees. Journal of Algorithms\u00a042(1), 69\u2013108 (2002)","journal-title":"Journal of Algorithms"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Protti, F., Dantas da Silva, M., Szwarcfiter, J.L.: Applying modular decomposition to parameterized cluster editing problems. Theory of Computing Systems (2007)","DOI":"10.1007\/s00224-007-9032-7"},{"issue":"1-2","key":"10_CR25","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":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-70575-8_52","volume-title":"Automata, Languages and Programming","author":"M. Tedder","year":"2008","unstructured":"Tedder, M., Corneil, D., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 634\u2013645. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:52:16Z","timestamp":1606168336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}