{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T02:57:58Z","timestamp":1768618678280,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642332920","type":"print"},{"value":"9783642332937","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33293-7_4","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T06:50:58Z","timestamp":1346223058000},"page":"13-24","source":"Crossref","is-referenced-by-count":7,"title":["The Exponential Time Hypothesis and the Parameterized Clique Problem"],"prefix":"10.1007","author":[{"given":"Yijia","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kord","family":"Eickmeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Flum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Downey, R., Fellows, M.: Fixed-parameter tractability and completeness iii: some structural aspects of the w hierarchy. In: Ambos-Spies, K., Homer, S., Sch\u00f6ning, U. (eds.) Complexity Theory, New York, NY, USA, pp. 191\u2013225. Cambridge University Press (1993)"},{"key":"4_CR2","unstructured":"Ganian, R., Hlinen\u00fd, P., Langer, A., Obdrz\u00e1lek, J., Rossmanith, P., Sikdar, S.: Lower bounds on the complexity of MSO1 model-checking. In: Proc. STACS 2012, pp. 326\u2013337 (2012)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences\u00a063, 512\u2013530 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Chen, J., Huang, X., Kanj, I.A., Xia, G.: Linear fpt reductions and computational lower bounds. In: Proc. of STOC 2004, pp. 212\u2013221 (2004)","DOI":"10.1145\/1007352.1007391"},{"key":"4_CR5","first-page":"71","volume":"84","author":"J. Flum","year":"2004","unstructured":"Flum, J., Grohe, M.: Parametrized complexity and subexponential time (column: Computational complexity). Bulletin of the EATCS\u00a084, 71\u2013100 (2004)","journal-title":"Bulletin of the EATCS"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM\u00a054(1) (2007)","DOI":"10.1145\/1206035.1206036"},{"key":"4_CR7","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.) Fellows Festschrift 2012. LNCS, vol.\u00a07370, pp. 17\u201338. Springer, Heidelberg (2012)"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.tcs.2005.10.003","volume":"351","author":"Y. Chen","year":"2006","unstructured":"Chen, Y., Flum, J.: On miniaturized problems in parameterized complexity theory. Theoretical Computer Science\u00a0351(3), 314\u2013336 (2006)","journal-title":"Theoretical Computer Science"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11847250_10","volume-title":"Parameterized and Exact Computation","author":"Y. Chen","year":"2006","unstructured":"Chen, Y., Grohe, M., Gr\u00fcber, M.: On Parameterized Approximability. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 109\u2013120. Springer, Heidelberg (2006)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. The Computer Journal\u00a051, 60\u201378 (2008)","journal-title":"The Computer Journal"},{"key":"4_CR11","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"}],"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-33293-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:03:29Z","timestamp":1620115409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33293-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332920","9783642332937"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33293-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}