{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:51:17Z","timestamp":1743000677214,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319500614"},{"type":"electronic","value":"9783319500621"}],"license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-50062-1_2","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T10:09:42Z","timestamp":1480500582000},"page":"9-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Surfing with Rod"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamson, K., Ellis, J., Fellows, M., Mata, M.: On the complexity of fixed-parameter problems. In: Proceedings of 13th FOCS, pp. 210\u2013215 (1989)","DOI":"10.1109\/SFCS.1989.63480"},{"key":"2_CR2","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":"HL Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels (extended abstract). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 563\u2013574. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-70575-8_46"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender, H., Fellows, M.R., Hallett, M.T.: Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. In: Proceedings of ACM Symposium on Theory of Computing (STOC), pp. 449\u2013458 (1994)","DOI":"10.1145\/195058.195229"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0168-0072(95)00020-8","volume":"84","author":"L Cai","year":"1997","unstructured":"Cai, L., Chen, J., Downey, R., Fellows, M.: Advice classes of parameterized tractability. Ann. Pure Appl. Logic 84, 119\u2013138 (1997)","journal-title":"Ann. Pure Appl. Logic"},{"key":"2_CR5","first-page":"1199","volume":"3","author":"M Dinneen","year":"1997","unstructured":"Dinneen, M.: Too many minor order obstructions (for parameterized lower ideals). J. Univers. Comput. Sci. 3, 1199\u20131206 (1997)","journal-title":"J. Univers. Comput. Sci."},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-30891-8_2","volume-title":"The Multivariate Algorithmic Revolution and Beyond","author":"R Downey","year":"2012","unstructured":"Downey, R.: The birth and early years of parameterized complexity. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) The Multivariate Algorithmic Revolution and Beyond. LNCS, vol. 7370, pp. 17\u201338. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-30891-8_2"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1090\/dimacs\/049\/04","volume-title":"Contemporary Trends in Discrete Mathematics, DIMACS","author":"R Downey","year":"1999","unstructured":"Downey, R., Fellows, M., Stege, U.: Parameterized complexity: a framework for systematically confronting computational intractability. In: Graham, R., Krachovil, J., Nesetril, J., Roberts, F. (eds.) Contemporary Trends in Discrete Mathematics, DIMACS, vol. 49, pp. 49\u2013100. American Mathematical Society, Providence (1999)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(96)00317-9","volume":"191","author":"RG Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R., Regan, K.W.: Parameterized circuit complexity and the W hierarchy. Theoret. Comput. Sci. A 191, 91\u2013115 (1998)","journal-title":"Theoret. Comput. Sci. A"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(97)00101-1","volume":"209","author":"RG Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M., Regan, K.: Threshold dominating sets and an improved characterization of \n$$W$$\n[2]. Theoret. Comput. Sci. A 209, 123\u2013140 (1998)","journal-title":"Theoret. Comput. Sci. A"},{"key":"2_CR10","unstructured":"Downey, R.G., Fellows, M., Taylor, U.: The parameterized complexity of relational database queries, an improved characterization of \n$$W$$\n[1]. In: Combinatorics, Complexity and Logic: Proceedings of DMTCS 1996, pp. 194\u2013213. Springer, Heidelberg (1997)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/S0097539797323571","volume":"29","author":"R Downey","year":"1999","unstructured":"Downey, R., Fellows, M., Vardy, A., Whittle, G.: The parameterized complexity of some fundamental problems in coding theory. SIAM J. Comput. 29, 545\u2013570 (1999)","journal-title":"SIAM J. Comput."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Fellows, M., Langston, M.: Nonconstructive proofs of polynomial-time complexity. Inf. Process. Lett. 26, 157\u2013162 (1987\/1988)","DOI":"10.1016\/0020-0190(87)90054-8"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1145\/44483.44491","volume":"35","author":"M Fellows","year":"1988","unstructured":"Fellows, M., Langston, M.: Nonconstructive tools for proving polynomial-time complexity. J. Assoc. Comput. Mach. 35, 727\u2013739 (1988)","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Computability and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50062-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:55:19Z","timestamp":1709830519000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50062-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,1]]},"ISBN":["9783319500614","9783319500621"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50062-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,1]]},"assertion":[{"value":"1 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}