{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:13:39Z","timestamp":1781345619096,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":60,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642308901","type":"print"},{"value":"9783642308918","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30891-8_10","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T09:24:05Z","timestamp":1340011445000},"page":"129-161","source":"Crossref","is-referenced-by-count":33,"title":["Kernelization \u2013 Preprocessing with a Guarantee"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Lokshtanov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"7","key":"10_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.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci.\u00a076(7), 524\u2013531 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1145\/990308.990309","volume":"51","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. Journal of the ACM\u00a051(3), 363\u2013384 (2004)","journal-title":"Journal of the ACM"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: Solving MAX-r-SAT above a tight lower bound. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 511\u2013517. SIAM (2010)","DOI":"10.1137\/1.9781611973075.44"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.jalgor.2003.09.003","volume":"50","author":"N. Alon","year":"2004","unstructured":"Alon, N., Gutin, G., Krivelevich, M.: Algorithms with large domination ratio. J. Algorithms\u00a050, 118\u2013131 (2004)","journal-title":"J. Algorithms"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach.\u00a042(4), 844\u2013856 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/174147.169807","volume":"40","author":"S. Arnborg","year":"1993","unstructured":"Arnborg, S., Courcelle, B., Proskurowski, A., Seese, D.: An algebraic theory of graph reduction. J. ACM\u00a040(5), 1134\u20131164 (1993)","journal-title":"J. ACM"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Bodlaender, H., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) Kernelization. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), pp. 629\u2013638. IEEE (2009)","DOI":"10.1109\/FOCS.2009.46"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-61332-3_153","volume-title":"Computing and Combinatorics","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., de Fluiter, B.: Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 199\u2013208. Springer, Heidelberg (1996)"},{"issue":"8","key":"10_CR9","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. J. Comput. Syst. Sci.\u00a075(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1137\/S0097539795289859","volume":"27","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., Hagerup, T.: Parallel algorithms with optimal speedup for bounded treewidth. SIAM J. Comput.\u00a027, 1725\u20131746 (1998)","journal-title":"SIAM J. Comput."},{"key":"10_CR11","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: A new technique for kernelization lower bounds. In: Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). LIPIcs, vol.\u00a09, pp. 165\u2013176. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-22006-7_37","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 437\u2013448. Springer, Heidelberg (2011)"},{"key":"10_CR13","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Analysis of data reduction: Transformations give evidence for non-existence of polynomial kernels, Tech. Report CS-UU-2008-030, Department of Information and Computer Sciences, Utrecht University, Utrecht, The Netherlands (2008)"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/inco.2000.2958","volume":"167","author":"H.L. Bodlaender","year":"2001","unstructured":"Bodlaender, H.L., van Antwerpen-de Fluiter, B.: Reduction algorithms for graphs of small treewidth. Inf. Comput.\u00a0167(2), 86\u2013119 (2001)","journal-title":"Inf. Comput."},{"key":"10_CR15","unstructured":"Bourgain, J.: Walsh subspaces of l p -product space. Seminar on Functional Analysis, Exp.\u00a0(4A), 9 (1980)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/11847250_18","volume-title":"Parameterized and Exact Computation","author":"K. Burrage","year":"2006","unstructured":"Burrage, K., Estivill-Castro, V., Fellows, M.R., Langston, M.A., Mac, S., Rosamond, F.A.: The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 192\u2013202. Springer, Heidelberg (2006)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms\u00a041, 280\u2013301 (2001)","journal-title":"Journal of Algorithms"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-30559-0_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Chor","year":"2004","unstructured":"Chor, B., Fellows, M., Juedes, D.W.: Linear Kernels in Linear Time, or How to Save k Colors in o(n2) Steps. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 257\u2013269. Springer, Heidelberg (2004)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-13731-0_17","volume-title":"Algorithm Theory - SWAT 2010","author":"R. Crowston","year":"2010","unstructured":"Crowston, R., Gutin, G., Jones, M., Kim, E.J., Ruzsa, I.Z.: Systems of Linear Equations over $\\mathbb{F}_2$ and Problems Parameterized above Average. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol.\u00a06139, pp. 164\u2013175. Springer, Heidelberg (2010)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlstr\u00f6m, M.: Clique cover and graph separation: New incompressibility results. CoRR, abs\/1111.0570 (2011)","DOI":"10.1007\/978-3-642-31594-7_22"},{"key":"10_CR21","unstructured":"de Fluiter, B.: Algorithms for Graphs of Small Treewidth. PhD thesis, Utrecht University (1997)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Dell, H., Marx, D.: Kernelization of packing problems. In: SODA, pp. 68\u201381 (2012)","DOI":"10.1137\/1.9781611973099.6"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: STOC, pp. 251\u2013260 (2010)","DOI":"10.1145\/1806689.1806725"},{"key":"10_CR24","series-title":"Graduate Texts in Mathematics","volume-title":"Graph theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph theory, 3rd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Berlin (2005)","edition":"3"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11758471_31","volume-title":"Algorithms and Complexity","author":"M. Dom","year":"2006","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R., Tru\u00df, A.: Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 320\u2013331. Springer, Heidelberg (2006)"},{"key":"10_CR26","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)"},{"key":"10_CR27","unstructured":"Downey, R.G., Fellows, M.R., Stege, U.: Computational tractability: the view from Mars. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS\u00a0(69), 73\u201397 (1999)"},{"key":"10_CR28","unstructured":"Drucker, A.: On the hardness of compressing an AND of SAT instances, Theory Lunch, February 17, Center for Computational Intractability (2012), http:\/\/intractability.princeton.edu\/blog\/2012\/03\/theory-lunch-february-17\/"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"35","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Rado, R.: Intersection theorems for systems of sets. J. London Math. Soc.\u00a035, 85\u201390 (1960)","journal-title":"J. London Math. Soc."},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/11847250_25","volume-title":"Parameterized and Exact Computation","author":"M.R. Fellows","year":"2006","unstructured":"Fellows, M.R.: The Lost Continent of Polynomial Time: Preprocessing and Kernelization. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 276\u2013277. Springer, Heidelberg (2006)"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Langston, M.A.: An analogue of the myhill-nerode theorem and its use in computing finite-basis characterizations (extended abstract). In: FOCS, pp. 520\u2013525 (1989)","DOI":"10.1109\/SFCS.1989.63528"},{"issue":"4","key":"10_CR32","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/s00224-009-9167-9","volume":"45","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Mnich, M., Rosamond, F.A., Saurabh, S.: The complexity ecology of parameters: An illustration using bounded max leaf number. Theory Comput. Syst.\u00a045(4), 822\u2013848 (2009)","journal-title":"Theory Comput. Syst."},{"key":"10_CR33","unstructured":"Fernau, H., Fomin, F.V., Lokshtanov, D., Raible, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: On out-trees with many leaves. In: STACS 2009, pp. 421\u2013432. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik (2009)"},{"key":"10_CR34","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science, An EATCS Series, Springer, Berlin (2006)"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Fomin, F., Lokshtanov, D., Misra, N., Saurabh, S.: Planar- ${\\cal F}$ Deletion: Approximation, Kernelization and Optimal FPT algorithms (2012) (unpublished manuscript)","DOI":"10.1109\/FOCS.2012.62"},{"key":"10_CR36","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Philip, G., Saurabh, S.: Hitting forbidden minors: Approximation and kernelization. In: Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). LIPIcs, vol.\u00a09, pp. 189\u2013200. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Bidimensionality and kernels. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 503\u2013510. SIAM (2010)","DOI":"10.1137\/1.9781611973075.43"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 133\u2013142. ACM (2008)","DOI":"10.1145\/1374376.1374398"},{"key":"10_CR39","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics\u00a013 (2008)","DOI":"10.1145\/1412228.1412236"},{"key":"10_CR41","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, 31\u201345 (2007)","journal-title":"SIGACT News"},{"key":"10_CR42","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.jcss.2010.06.001","volume":"77","author":"G. Gutin","year":"2011","unstructured":"Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci.\u00a077, 422\u2013429 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-15775-2_28","volume-title":"Algorithms \u2013 ESA 2010","author":"G. Gutin","year":"2010","unstructured":"Gutin, G., van Iersel, L., Mnich, M., Yeo, A.: All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 326\u2013337. Springer, Heidelberg (2010)"},{"key":"10_CR44","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. London Math. Soc.\u00a010, 26\u201330 (1935)","journal-title":"J. London Math. Soc."},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., Venkatesh, S.: On the advantage over a random assignment. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 43\u201352. ACM (2002)","DOI":"10.1145\/509907.509916"},{"key":"10_CR46","unstructured":"Hermelin, D., Kratsch, S., Soltys, K., Wahlstr\u00f6m, M., Wu, X.: Hierarchies of inefficient kernelizability. CoRR, abs\/1110.0976 (2011)"},{"key":"10_CR47","unstructured":"Jansen, B.M.P., Bodlaender, H.L.: Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter. In: Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). LIPIcs, vol.\u00a09, pp. 177\u2013188. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"10_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-22953-4_8","volume-title":"Fundamentals of Computation Theory","author":"B.M.P. Jansen","year":"2011","unstructured":"Jansen, B.M.P., Kratsch, S.: Data Reduction for Graph Coloring Problems. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol.\u00a06914, pp. 90\u2013101. Springer, Heidelberg (2011)"},{"key":"10_CR49","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u0151nig","year":"1916","unstructured":"K\u0151nig, D.: \u00dcber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math. Ann.\u00a077, 453\u2013465 (1916)","journal-title":"Math. Ann."},{"key":"10_CR50","doi-asserted-by":"crossref","unstructured":"Kratsch, S.: Co-nondeterminism in compositions: a kernelization lower bound for a ramsey-type problem. In: SODA, pp. 114\u2013122 (2012)","DOI":"10.1137\/1.9781611973099.10"},{"key":"10_CR51","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Representative sets and irrelevant vertices: New tools for kernelization. CoRR, abs\/1111.2195 (2011)","DOI":"10.1109\/FOCS.2012.46"},{"key":"10_CR52","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Compression via matroids: a randomized polynomial kernel for odd cycle transversal. In: SODA, pp. 94\u2013103 (2012)","DOI":"10.1137\/1.9781611973099.8"},{"key":"10_CR53","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D.: Phd thesis, New Methods in Parameterized Algorithms and Complexity (2009)","DOI":"10.1007\/978-3-642-10217-2_37"},{"issue":"2","key":"10_CR54","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: Maxsat and maxcut. J. Algorithms\u00a031(2), 335\u2013354 (1999)","journal-title":"J. Algorithms"},{"key":"10_CR55","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.\u00a08, 110\u2013128 (2011)","journal-title":"Discrete Optim."},{"key":"10_CR56","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, vol.\u00a031. Oxford University Press, Oxford (2006)"},{"key":"10_CR57","unstructured":"Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010). LIPIcs, vol.\u00a05, pp. 17\u201332. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)"},{"key":"10_CR58","doi-asserted-by":"publisher","first-page":"521","DOI":"10.2307\/2308219","volume":"59","author":"W.V. Quine","year":"1952","unstructured":"Quine, W.V.: The problem of simplifying truth functions. Amer. Math. Monthly\u00a059, 521\u2013531 (1952)","journal-title":"Amer. Math. Monthly"},{"key":"10_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L.J. Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comp. Sc.\u00a03, 1\u201322 (1976)","journal-title":"Theor. Comp. Sc."},{"key":"10_CR60","doi-asserted-by":"crossref","unstructured":"Thomass\u00e9, S.: A quadratic kernel for feedback vertex set. ACM Transactions on Algorithms\u00a06 (2010)","DOI":"10.1137\/1.9781611973068.13"}],"container-title":["Lecture Notes in Computer Science","The Multivariate Algorithmic Revolution and Beyond"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30891-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T17:37:04Z","timestamp":1642527424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30891-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308901","9783642308918"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30891-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}