{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:46:18Z","timestamp":1776681978367,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642450426","type":"print"},{"value":"9783642450433","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_23","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T14:05:50Z","timestamp":1384265150000},"page":"261-273","source":"Crossref","is-referenced-by-count":2,"title":["FPT Is Characterized by Useful Obstruction Sets"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart M. P.","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-11269-0_2","volume-title":"Parameterized and Exact Computation","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L.: Kernelization: New upper and lower bound techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 17\u201337. Springer, Heidelberg (2009)"},{"issue":"8","key":"23_CR2","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":"23_CR3","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: A new technique for kernelization lower bounds. In: Proc. 28th STACS, pp. 165\u2013176 (2011)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(97)00300-9","volume":"233","author":"K. Cattell","year":"2000","unstructured":"Cattell, K., Dinneen, M.J., Downey, R.G., Fellows, M.R., Langston, M.A.: On computing graph minor obstruction sets. Theor. Comput. Sci.\u00a0233, 107\u2013127 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR5","first-page":"1199","volume":"3","author":"M.J. Dinneen","year":"1997","unstructured":"Dinneen, M.J.: Too many minor order obstructions. J. UCS\u00a03, 1199\u20131206 (1997)","journal-title":"J. UCS"},{"issue":"1-3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0012-365X(00)00083-2","volume":"230","author":"M.J. Dinneen","year":"2001","unstructured":"Dinneen, M.J., Cattell, K., Fellows, M.R.: Forbidden minors to graphs with small feedback sets. Discrete Math.\u00a0230(1-3), 215\u2013252 (2001)","journal-title":"Discrete Math."},{"issue":"21","key":"23_CR7","doi-asserted-by":"publisher","first-page":"2484","DOI":"10.1016\/j.disc.2007.01.003","volume":"307","author":"M.J. Dinneen","year":"2007","unstructured":"Dinneen, M.J., Lai, R.: Properties of vertex cover obstructions. Discrete Math.\u00a0307(21), 2484\u20132500 (2007)","journal-title":"Discrete Math."},{"key":"23_CR8","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Drucker, A.: New limits to classical and quantum instance compression. In: Proc. 53rd FOCS, pp. 609\u2013618 (2012)","DOI":"10.1109\/FOCS.2012.71"},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1145\/44483.44491","volume":"35","author":"M.R. Fellows","year":"1988","unstructured":"Fellows, M.R., Langston, M.A.: Nonconstructive tools for proving polynomial-time decidability. J. ACM\u00a035(3), 727\u2013739 (1988)","journal-title":"J. ACM"},{"key":"23_CR11","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: Proc. 30th FOCS, pp. 520\u2013525 (1989)","DOI":"10.1109\/SFCS.1989.63528"},{"key":"23_CR12","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer-Verlag New York, Inc. (2006)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar \n                  \n                    \n                  \n                  $\\mathcal{F}$\n                -Deletion: Approximation, kernelization and optimal FPT algorithms. In: Proc. 53rd FOCS, pp. 470\u2013479 (2012)","DOI":"10.1109\/FOCS.2012.62"},{"key":"23_CR14","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)"},{"issue":"6","key":"23_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"42","author":"N.G. Kinnersley","year":"1992","unstructured":"Kinnersley, N.G.: The vertex separation number of a graph equals its path-width. Inf. Process. Lett.\u00a042(6), 345\u2013350 (1992)","journal-title":"Inf. Process. Lett."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Kratsch, S.: Co-nondeterminism in compositions: a kernelization lower bound for a ramsey-type problem. In: Proc. 23rd SODA, pp. 114\u2013122 (2012)","DOI":"10.1137\/1.9781611973099.10"},{"key":"23_CR17","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.\u00a07357, pp. 364\u2013375. Springer, Heidelberg (2012)"},{"key":"23_CR18","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: The AND-conjecture may be necessary. In: Parameterized Complexity Newsletter. FPT Wiki (November 2011)"},{"issue":"1","key":"23_CR19","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1006\/jctb.1997.1788","volume":"73","author":"J. Lagergren","year":"1998","unstructured":"Lagergren, J.: Upper bounds on the size of obstructions and intertwines. J. Comb. Theory, Ser. B\u00a073(1), 7\u201340 (1998)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory, Ser. B\u00a063(1), 65\u2013110 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner\u2019s conjecture. J. Comb. Theory, Ser. B\u00a092(2), 325\u2013357 (2004)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"5","key":"23_CR22","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1016\/j.ejc.2011.09.018","volume":"33","author":"J. Ru\u00e9","year":"2012","unstructured":"Ru\u00e9, J., Stavropoulos, K.S., Thilikos, D.M.: Outerplanar obstructions for a feedback vertex set. Eur. J. Comb.\u00a033(5), 948\u2013968 (2012)","journal-title":"Eur. J. Comb."},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0012-365X(94)90092-2","volume":"127","author":"A. Takahashi","year":"1994","unstructured":"Takahashi, A., Ueno, S., Kajitani, Y.: Minimal acyclic forbidden minors for the family of graphs with bounded path-width. Discrete Math.\u00a0127, 293\u2013304 (1994)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45043-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T06:11:06Z","timestamp":1558678266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}