{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:46Z","timestamp":1760202646504,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332920"},{"type":"electronic","value":"9783642332937"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33293-7_17","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T10:50:58Z","timestamp":1346237458000},"page":"171-181","source":"Crossref","is-referenced-by-count":4,"title":["Weighted Counting of k-Matchings Is #W[1]-Hard"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Curticapean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM Journal on Computing, 538\u2013547 (2002)","DOI":"10.1109\/SFCS.2002.1181978"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science\u00a08(2), 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"17_CR3","first-page":"1478","volume":"68","author":"H.N.V. Temperley","year":"1961","unstructured":"Temperley, H.N.V., Fisher, M.E.: Dimer problem in statistical mechanics - an exact result. Philosophical Magazine\u00a068(6), 1478\u20136435 (1961)","journal-title":"Philosophical Magazine"},{"issue":"12","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1016\/0031-8914(61)90063-5","volume":"27","author":"P. Kasteleyn","year":"1961","unstructured":"Kasteleyn, P.: The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice. Physica\u00a027(12), 1209\u20131225 (1961)","journal-title":"Physica"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"S.P. Vadhan","year":"2001","unstructured":"Vadhan, S.P.: The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput.\u00a031(2), 398\u2013427 (2001)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M. Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximating the permanent. SIAM J. Comput.\u00a018(6), 1149\u20131178 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1-3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.apal.2003.11.002","volume":"126","author":"J.A. Makowsky","year":"2004","unstructured":"Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic\u00a0126(1-3), 159\u2013213 (2004); Provinces of logic determined. Essays in the memory of Alfred Tarski. Parts I, II and III","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation\u00a085(1), 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Galluccio, A., Loebl, M.: On the theory of Pfaffian orientations. I. Perfect matchings and permanents. Electronic Journal of Combinatorics\u00a06 (1998)","DOI":"10.37236\/1438"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/3-540-45841-7_52","volume-title":"STACS 2002","author":"M. Frick","year":"2002","unstructured":"Frick, M.: Generalized Model-Checking over Locally Tree-Decomposable Classes. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 632\u2013644. Springer, Heidelberg (2002)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/1536414.1536477","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009","author":"V. Vassilevska","year":"2009","unstructured":"Vassilevska, V., Williams, R.: Finding, minimizing, and counting weighted subgraphs. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 455\u2013464. ACM, New York (2009)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-04128-0_52","volume-title":"Algorithms - ESA 2009","author":"A. Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Counting Paths and Packings in Halves. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 578\u2013586. Springer, Heidelberg (2009)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-22993-0_12","volume-title":"Mathematical Foundations of Computer Science 2011","author":"M. Bl\u00e4ser","year":"2011","unstructured":"Bl\u00e4ser, M., Curticapean, R.: The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 96\u2013107. Springer, Heidelberg (2011)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/978-3-540-73420-8_69","volume-title":"Automata, Languages and Programming","author":"M. Bl\u00e4ser","year":"2007","unstructured":"Bl\u00e4ser, M., Dell, H.: Complexity of the Cover Polynomial. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 801\u2013812. Springer, Heidelberg (2007)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jctb.1995.1055","volume":"65","author":"F.R.K. Chung","year":"1995","unstructured":"Chung, F.R.K., Graham, R.L.: On the cover polynomial of a digraph. J. Combin. Theory Ser. B\u00a065, 273\u2013290 (1995)","journal-title":"J. Combin. Theory Ser. B"}],"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_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T12:38:27Z","timestamp":1744029507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33293-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332920","9783642332937"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33293-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}