{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:07:51Z","timestamp":1725757671197},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038971"},{"type":"electronic","value":"9783319038988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03898-8_9","type":"book-chapter","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T02:57:26Z","timestamp":1384829846000},"page":"84-96","source":"Crossref","is-referenced-by-count":3,"title":["Incompressibility of H-Free Edge Modification"],"prefix":"10.1007","author":[{"given":"Leizhen","family":"Cai","sequence":"first","affiliation":[]},{"given":"Yufei","family":"Cai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/s00453-010-9428-7","volume":"61","author":"N. Alon","year":"2011","unstructured":"Alon, N., Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: Solving Max-r-SAT above a tight lower bound. Algorithmica\u00a061, 638\u2013655 (2011)","journal-title":"Algorithmica"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Cai, L., Chen, J., Fellows, M.R., Telle, J.A., Marx, D.: Open problems in parameterized and exact computation \u2014 IWPEC 2006. Utrecht University Technical Report UU-CS-2006-052 (2006)","DOI":"10.1007\/11847250"},{"issue":"8","key":"9_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. Journal of Computer and System Sciences\u00a075(8), 423\u2013434 (2009)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR4","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: a new technique for kernelization lower bounds. arXiv:1011.4224v2 (2012), \n                  \n                    http:\/\/arxiv.org\/abs\/1011.4224"},{"key":"9_CR5","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Analysis of data reduction: transformations give evidence for non-existence of polynomial kernels. Utrecht University Technical Report UU-CS-2008-030 (2008)"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"157","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), 157\u2013206 (1996)","journal-title":"Information Processing Letters"},{"key":"9_CR7","unstructured":"Cai, Y.: Polynomial Kernelisation of H-free Edge Modification Problems. MPhil Thesis, Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China (2012), \n                  \n                    http:\/\/www.uni-marburg.de\/fb12\/ps\/team\/cai-masterarbeit.pdf"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"L. Fortnow","year":"2011","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. Journal of Computer and System Sciences\u00a077(1), 91\u2013106 (2011)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"9_CR9","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. Theory of Computing Systems\u00a038(4), 373\u2013392 (2005)","journal-title":"Theory of Computing Systems"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-17493-3_15","volume-title":"Parameterized and Exact Computation","author":"S. Guillemot","year":"2010","unstructured":"Guillemot, S., Paul, C., Perez, A.: On the (non-)existence of polynomial kernels for P\n                        \n                  l\n                -free edge modification problems. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 147\u2013157. Springer, Heidelberg (2010)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-11269-0_22","volume-title":"Parameterized and Exact Computation","author":"S. Kratsch","year":"2009","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Two edge modification problems without polynomial kernels. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 264\u2013275. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03898-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T06:44:35Z","timestamp":1558680275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03898-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038971","9783319038988"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03898-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}