{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T13:07:00Z","timestamp":1749042420318,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_36","type":"book-chapter","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T01:40:34Z","timestamp":1441071634000},"page":"424-436","source":"Crossref","is-referenced-by-count":12,"title":["A Polynomial Kernel for Trivially Perfect Editing"],"prefix":"10.1007","author":[{"given":"P\u00e5l Gr\u00f8n\u00e5s","family":"Drange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"issue":"7","key":"36_CR1","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"F.N. Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: Kernelization algorithms for d-hitting set problems. J. Comput. Syst. Sci.\u00a076(7), 524\u2013531 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"13","key":"36_CR2","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1016\/j.dam.2006.03.031","volume":"154","author":"P. Burzyn","year":"2006","unstructured":"Burzyn, P., Bonomo, F., Dur\u00e1n, G.: NP-completeness results for edge modification problems. Discrete Applied Mathematics\u00a0154(13), 1824\u20131844 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"36_CR3","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. Information Processing Letters\u00a058(4), 171\u2013176 (1996)","journal-title":"Information Processing Letters"},{"issue":"3","key":"36_CR4","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s00453-014-9937-x","volume":"71","author":"L. Cai","year":"2015","unstructured":"Cai, L., Cai, Y.: Incompressibility of H-free edge modification. Algorithmica\u00a071(3), 731\u2013757 (2015)","journal-title":"Algorithmica"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M., van Leeuwen, E.J., Wrochna, M.: Polynomial kernelization for removing induced claws and diamonds. In: WG (2015)","DOI":"10.1007\/978-3-319-21275-3_2"},{"key":"36_CR6","unstructured":"Drange, P.G., Dregi, M.S., Lokshtanov, D., Sullivan, B.D.: On the Intractability of Threshold Editing. In: ESA (2015)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Drange, P.G., Fomin, F.V., Pilipczuk, M., Villanger, Y.: Exploring subexponential parameterized complexity of completion problems. In: STACS (2014)","DOI":"10.1145\/2799640"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Drange, P.G., Pilipczuk, M.: A Polynomial Kernel for Trivially Perfect Editing. CoRR, abs\/1412.7558 (2014)","DOI":"10.1007\/978-3-662-48350-3_36"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar F-deletion: Approximation, kernelization and optimal FPT\u00a0algorithms. In: FOCS (2012)","DOI":"10.1109\/FOCS.2012.62"},{"issue":"4","key":"36_CR10","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1007\/s00453-012-9619-5","volume":"65","author":"S. Guillemot","year":"2013","unstructured":"Guillemot, S., Havet, F., Paul, C., Perez, A.: On the (non-)existence of polynomial kernels for P \u2113-free edge modification problems. Algorithmica\u00a065(4), 900\u2013926 (2013)","journal-title":"Algorithmica"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/978-3-540-77120-3_79","volume-title":"Algorithms and Computation","author":"J. Guo","year":"2007","unstructured":"Guo, J.: Problem kernels for NP-complete edge deletion problems: Split and related graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 915\u2013926. Springer, Heidelberg (2007)"},{"issue":"4","key":"36_CR12","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences\u00a063(4), 512\u2013530 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"15","key":"36_CR13","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","volume":"160","author":"C. Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discrete Applied Mathematics\u00a0160(15), 2259\u20132270 (2012)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"36_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.disopt.2013.02.001","volume":"10","author":"S. Kratsch","year":"2013","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Two edge modification problems without polynomial kernels. Discrete Optimization\u00a010(3), 193\u2013199 (2013)","journal-title":"Discrete Optimization"},{"issue":"4","key":"36_CR15","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/TST.2014.6867517","volume":"19","author":"Y. Liu","year":"2014","unstructured":"Liu, Y., Wang, J., Guo, J.: An overview of kernelization algorithms for graph modification problems. Tsinghua Science and Technology\u00a019(4), 346\u2013357 (2014)","journal-title":"Tsinghua Science and Technology"},{"issue":"3","key":"36_CR16","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.socnet.2013.05.001","volume":"35","author":"J. Nastos","year":"2013","unstructured":"Nastos, J., Gao, Y.: Familial groups in social networks. Social Networks\u00a035(3), 439\u2013450 (2013)","journal-title":"Social Networks"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T09:56:47Z","timestamp":1748599007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}