{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:35:54Z","timestamp":1787510154157,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319135236","type":"print"},{"value":"9783319135243","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13524-3_1","type":"book-chapter","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T12:51:38Z","timestamp":1417524698000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lower Bounds for Kernelization"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"1_CR1","unstructured":"Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Proceedings of the 6th Workshop on Algorithm Engineering and Experimentation and the 1st Workshop on Analytic Algorithmics and Combinatorics, ALENEX\/ANALCO 2004, pp. 62\u201369. ACM-SIAM (2004)"},{"issue":"5","key":"1_CR2","first-page":"38","volume":"8","author":"D Binkele-Raible","year":"2012","unstructured":"Binkele-Raible, D., Fernau, H., Fomin, F.V., Lokshtanov, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: on out-trees with many leaves. ACM Trans. Algorithms 8(5), 38 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75, 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"2108","DOI":"10.1137\/120903518","volume":"27","author":"HL Bodlaender","year":"2013","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Preprocessing for treewidth: a combinatorial analysis through kernelization. SIAM J. Discrete Math. 27, 2108\u20132142 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/120880240","volume":"28","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28, 277\u2013305 (2014)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"HL Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255\u2013269 (2008)","journal-title":"Comput. J."},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1111\/j.1467-8640.2005.00274.x","volume":"21","author":"HL Bodlaender","year":"2005","unstructured":"Bodlaender, H.L., Koster, A.M.C.A., Eijkhof, F.: Pre-processing rules for triangulation of probabilistic networks. Comput. Intell. 21(3), 286\u2013305 (2005)","journal-title":"Comput. Intell."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"HL Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theoret. Comput. Sci. 412, 4570\u20134578 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1137\/050646354","volume":"37","author":"J Chen","year":"2007","unstructured":"Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 37, 1077\u20131106 (2007)","journal-title":"SIAM J. Comput."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Chen, J., Huang, X., Kanj, I.A., Xia, G.: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72, 1346\u20131367 (2006)","DOI":"10.1016\/j.jcss.2006.04.007"},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s00224-010-9270-y","volume":"48","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Flum, J., M\u00fcller, M.: Lower bounds for kernelizations and other preprocessing procedures. Theory Comput. Syst. 48(4), 803\u2013839 (2011)","journal-title":"Theory Comput. Syst."},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-31594-7_22","volume-title":"Automata, Languages, and Programming","author":"M Cygan","year":"2012","unstructured":"Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlstr\u00f6m, M.: Clique cover and graph separation: new incompressibility results. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 254\u2013265. Springer, Heidelberg (2012)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Kernelization hardness of connectivity problems in $$d$$-degenerate graphs. Discrete Appl. Math. 160, 2131\u20132141 (2012)","DOI":"10.1016\/j.dam.2012.05.016"},{"key":"1_CR14","unstructured":"Dell, H.: A simple proof that AND-compression of NP-complete problems is hard. In: Proceedings IPEC 2014 (2014)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Dell, H., Marx, D.: Kernelization of packing problems. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 68\u201381 (2012)","DOI":"10.1137\/1.9781611973099.6"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: Schulman, L.J. (ed.) Proceedings of the 42nd Annual Symposium on Theory of Computing, STOC 2010, pp. 251\u2013260 (2010)","DOI":"10.1145\/1806689.1806725"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Automata, Languages and Programming","author":"M Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 378\u2013389. Springer, Heidelberg (2009)"},{"key":"1_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)"},{"key":"1_CR19","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Berlin (2013)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Drucker, A.: New limits to classical and quantum instance compression. In: Proceedings of the 53rd Annual Symposium on Foundations of Computer Science, FOCS 2012, pp. 609\u2013618 (2012)","DOI":"10.1109\/FOCS.2012.71"},{"key":"1_CR21","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"key":"1_CR22","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. J. Comput. Syst. Sci. 77, 91\u2013106 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ipl.2012.12.008","volume":"113","author":"G Gutin","year":"2013","unstructured":"Gutin, G., Muciaccia, G., Yeo, A.: Non-existence of polynomial kernels for the test cover problem. Inf. Process. Lett. 113, 123\u2013126 (2013)","journal-title":"Inf. Process. Lett."},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1137\/060668092","volume":"39","author":"D Harnik","year":"2010","unstructured":"Harnik, D., Naor, M.: On the compressibility of $$\\cal {NP}$$ instances and cryptographic applications. SIAM J. Comput. 39, 1667\u20131713 (2010)","journal-title":"SIAM J. Comput."},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-03898-8_18","volume-title":"Parameterized and Exact Computation","author":"D Hermelin","year":"2013","unstructured":"Hermelin, D., Kratsch, S., So\u0142tys, K., Wahlstr\u00f6m, M., Wu, X.: A completeness theory for polynomial (Turing) kernelization. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 202\u2013215. Springer, Heidelberg (2013)"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-319-03898-8_19","volume-title":"Parameterized and Exact Computation","author":"BMP Jansen","year":"2013","unstructured":"Jansen, B.M.P.: On sparsification for computing treewidth. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 216\u2013229. Springer, Heidelberg (2013)"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-662-44777-2_48","volume-title":"Algorithms - ESA 2014","author":"BMP Jansen","year":"2014","unstructured":"Jansen, B.M.P.: Turing kernelization for finding long paths and cycles in restricted graph classes. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 579\u2013591. Springer, Heidelberg (2014)"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00224-012-9393-4","volume":"53","author":"BMP Jansen","year":"2013","unstructured":"Jansen, B.M.P., Bodlaender, H.L.: Vertex cover kernelization revisited - upper and lower bounds for a refined parameter. Theory Comput. Syst. 53, 263\u2013299 (2013)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"1_CR29","first-page":"19","volume":"10","author":"S Kratsch","year":"2014","unstructured":"Kratsch, S.: Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem. ACM Trans. Algorithms 10(4), 19 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Philip, G., Ray, S.: Point line cover: the easy kernel is essentially tight. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pp. 1596\u20131606 (2014)","DOI":"10.1137\/1.9781611973402.116"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-31155-0_32","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"S Kratsch","year":"2012","unstructured":"Kratsch, S., Pilipczuk, M., Rai, A., Raman, V.: Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 364\u2013375. Springer, Heidelberg (2012)"},{"key":"1_CR32","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 Optim. 10, 193\u2013199 (2013)","journal-title":"Discrete Optim."},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.disopt.2010.10.001","volume":"8","author":"N Misra","year":"2011","unstructured":"Misra, N., Raman, V., Saurabh, S.: Lower bounds on kernelization. Discrete Optim. 8, 110\u2013128 (2011)","journal-title":"Discrete Optim."},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"GL Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter, L.E.: Vertex packing: structural properties and algorithms. Math. Program. 8, 232\u2013248 (1975)","journal-title":"Math. Program."},{"key":"1_CR35","series-title":"Oxford Lecture 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 Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)"},{"issue":"2","key":"1_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1721837.1721848","volume":"6","author":"S Thomass\u00e9","year":"2010","unstructured":"Thomass\u00e9, S.: A $$4k^2$$ kernel for feedback vertex set. ACM Trans. Algorithms 6(2), 1\u20138 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"1_CR37","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511662065","volume-title":"Some Topics in Graph Theory","author":"HP Yap","year":"1986","unstructured":"Yap, H.P.: Some Topics in Graph Theory. London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (1986)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13524-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T21:25:13Z","timestamp":1676409913000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13524-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135236","9783319135243"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13524-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"3 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}