{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:02:17Z","timestamp":1743109337097,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174926"},{"type":"electronic","value":"9783642174933"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17493-3_15","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T08:41:01Z","timestamp":1291365661000},"page":"147-157","source":"Crossref","is-referenced-by-count":4,"title":["On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Guillemot","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Perez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-540-70575-8_46","volume-title":"Automata, Languages and Programming","author":"H. Bodlaender","year":"2008","unstructured":"Bodlaender, H., Downey, R., Fellows, M., Hermelin, D.: On problems without polynomial kernels. 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. 563\u2013574. Springer, Heidelberg (2008)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-642-04128-0_57","volume-title":"Algorithms - ESA 2009","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 635\u2013646. Springer, Heidelberg (2009)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"A.\u00a0Brandst\u00e4dt, V.\u00a0B. Le, and J.\u00a0P. Spinrad. Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"4","key":"15_CR4","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"},{"key":"15_CR5","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":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/31.1748","volume":"35","author":"E.S. El-Mallah","year":"1988","unstructured":"El-Mallah, E.S., Colbourn, C.: The complexity of some edge deletion problems. IEEE Transactions on Circuits and Systems\u00a035(3), 354\u2013362 (1988)","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"15_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., 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":"15_CR8","series-title":"Texts in Theoretical Computer Science","volume-title":"Parameterized complexity theorey","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theorey. Texts in Theoretical Computer Science. Springer, Heidelberg (2006)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: STOC, pp. 133\u2013142 (2008)","DOI":"10.1145\/1374376.1374398"},{"key":"15_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. Garey","year":"1978","unstructured":"Garey, M., Johnson, S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York (1978)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"M. Golumbic","year":"1995","unstructured":"Golumbic, M., Kaplan, H., Shamir, R.: Graph sandwich problems. Journal of Algorithms\u00a019, 449\u2013473 (1995)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M. Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey on algorithmic aspects of modular decomposition. Computer Science Review\u00a04(1), 41\u201359 (2010)","journal-title":"Computer Science Review"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Heggernes, P., Paul, C., Telle, J.A., Villanger, Y.: Interval completion with few edges. In: STOC, pp. 374\u2013381 (2007)","DOI":"10.1145\/1250790.1250847"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Annual ACM Symposium on Theory of Computing (STOC), pp. 95\u2013103 (2007)","DOI":"10.1145\/1250790.1250806"},{"key":"15_CR15","series-title":"LNCS","first-page":"264","volume-title":"IWPEC 2009","author":"S. Kratsch","year":"2009","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Two edge modification problems without polynomial kernels. In: IWPEC 2009. LNCS, vol.\u00a05917, pp. 264\u2013275. Springer, Heidelberg (2009)"},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A. Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Applied Mathematics\u00a0113(1), 109\u2013128 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR17","series-title":"Oxford Lectures Series in Mathematics and its Applications","doi-asserted-by":"publisher","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 Lectures Series in Mathematics and its Applications, vol.\u00a031. Oxford University Press, Oxford (2006)"},{"issue":"3-4","key":"15_CR18","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. Information Processing Letters\u00a073(3-4), 125\u2013129 (2000)","journal-title":"Information Processing Letters"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Rose, D.J.: A graph-theoretic study of the numerical solution of sparse positive systems of linear equations. In: Graph Theory and Computing, pp. 183\u2013217 (1972)","DOI":"10.1016\/B978-1-4832-3187-7.50018-0"},{"issue":"1-2","key":"15_CR20","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":"15_CR21","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. Tarjan","year":"1984","unstructured":"Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal of Computing\u00a013, 566\u2013579 (1984)","journal-title":"SIAM Journal of Computing"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-77918-6_21","volume-title":"Approximation and Online Algorithms","author":"A. Zuylen van","year":"2008","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggragation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol.\u00a04927, pp. 260\u2013273. Springer, Heidelberg (2008)"}],"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-642-17493-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:39:02Z","timestamp":1559835542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17493-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174926","9783642174933"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17493-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}