{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:34:39Z","timestamp":1740548079571,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230717"},{"type":"electronic","value":"9783540286394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28639-4_10","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:25:35Z","timestamp":1285014335000},"page":"108-120","source":"Crossref","is-referenced-by-count":1,"title":["On Miniaturized Problems in Parameterized Complexity Theory"],"prefix":"10.1007","author":[{"given":"Yijia","family":"Chen","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Flum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/3-540-48224-5_23","volume-title":"Automata, Languages and Programming","author":"L. Cai","year":"2001","unstructured":"Cai, L., Juedes, D.: Subexponential parameterized algorithms collapse the Whierarchy. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, p. 273. Springer, Heidelberg (2001)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Chen, J., Huang, X., Kanj, I., Xia, G.: Linear FPT Reductions and Computational Lower Bounds. In: Proceedings of STOC 2004 (2004)","DOI":"10.1145\/1007352.1007391"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Downey, R.: Parameterized complexity for the sceptic. In: Proceedings of the 18th IEEE Conference on Computational Complexity, pp. 147\u2013168 (2003)","DOI":"10.1109\/CCC.2003.1214417"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Downey, R., Estivill, V., Fellows, M., Prieto, E., Rosamond, F.: Cutting up is hard to do: the parameterized complexity of k-cut and related problems. In: Proceedings of CATS 2003. ENTCS, vol.\u00a078(0) (2003)","DOI":"10.1016\/S1571-0661(04)81014-4"},{"key":"10_CR5","series-title":"AMS-DIMACS Volume Series","first-page":"119","volume-title":"Proof Complexity and Feasible Arithmetic","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R., Regan, K.: Descriptive complexity and the Whierarchy. In: Beame, P., Buss, S. (eds.) Proof Complexity and Feasible Arithmetic. AMS-DIMACS Volume Series, vol.\u00a039, pp. 119\u2013134. AMS, Providence (1998)"},{"key":"10_CR6","doi-asserted-by":"crossref","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_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-540-45078-8_44","volume-title":"Algorithms and Data Structures","author":"M. Fellows","year":"2003","unstructured":"Fellows, M.: New directions and new challenges in algorithm design and complexity, parameterized. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 505\u2013519. Springer, Heidelberg (2003)"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1137\/S0097539799360768","volume":"31","author":"J. Flum","year":"2001","unstructured":"Flum, J., Grohe, M.: Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing\u00a031(1), 113\u2013145 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-27836-8_48","volume-title":"Automata, Languages and Programming","author":"J. Flum","year":"2004","unstructured":"Flum, J., Grohe, M., Weyer, M.: Bounded fixed-parameter tractability and log2n nondeterministic bits. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 555\u2013567. Springer, Heidelberg (2004)"},{"issue":"2","key":"10_CR10","first-page":"367","volume":"62","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: Complexity of k-SAT. JCSS\u00a062(2), 367\u2013375 (2001)","journal-title":"JCSS"},{"issue":"4","key":"10_CR11","first-page":"512","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? JCSS\u00a063(4), 512\u2013530 (2001)","journal-title":"JCSS"}],"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-540-28639-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:11:48Z","timestamp":1740525108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28639-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230717","9783540286394"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28639-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}