{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:45Z","timestamp":1770994065273,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705741","type":"print"},{"value":"9783540705758","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_48","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"587-596","source":"Crossref","is-referenced-by-count":18,"title":["Understanding the Complexity of Induced Subgraph Isomorphisms"],"prefix":"10.1007","author":[{"given":"Yijia","family":"Chen","sequence":"first","affiliation":[]},{"given":"Marc","family":"Thurley","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Weyer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"48_CR1","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. ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"key":"48_CR2","unstructured":"Bodirski, M., Grohe, M.: Non-dichotomies in Constraint Satisfaction Complexity. In: Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008, Track B) (to appear, 2008)"},{"key":"48_CR3","first-page":"250","volume-title":"Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity","author":"Y. Chen","year":"2007","unstructured":"Chen, Y., Flum, J.: On parameterized path and chordless path problems. In: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity, pp. 250\u2013263. IEEE Computer Society, Los Alamitos (2007)"},{"issue":"1-3","key":"48_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2004.08.008","volume":"329","author":"V. Dalmau","year":"2004","unstructured":"Dalmau, V., Jonsson, P.: The complexity of counting homomorphisms seen from the other side. Theor. Comput. Sci.\u00a0329(1-3), 315\u2013323 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Dalmau, V., Kolaitis, P.G., Vardi, M.Y.: Constraint satisfaction, bounded treewidth, and finite-variable logics. In: Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, CP 2002, pp. 310\u2013326 (2002)","DOI":"10.1007\/3-540-46135-3_21"},{"issue":"4","key":"48_CR6","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput.\u00a024(4), 873\u2013921 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"48_CR7","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 J. Comput.\u00a031(1), 113\u2013145 (2001)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"48_CR8","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1137\/S0097539703427203","volume":"33","author":"J. Flum","year":"2004","unstructured":"Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM J. Comput.\u00a033(4), 892\u2013922 (2004)","journal-title":"SIAM J. Comput."},{"key":"48_CR9","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"48_CR10","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"},{"issue":"1","key":"48_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"R.E. Ladner","year":"1975","unstructured":"Ladner, R.E.: On the structure of polynomial time reducibility. J. ACM\u00a022(1), 155\u2013171 (1975)","journal-title":"J. ACM"},{"issue":"1-3","key":"48_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.apal.2005.06.010","volume":"138","author":"C. McCartin","year":"2006","unstructured":"McCartin, C.: Parameterized counting problems. Ann. Pure Appl. Logic\u00a0138(1-3), 147\u2013182 (2006)","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:30:26Z","timestamp":1714620626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}