{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:22Z","timestamp":1759638442871},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,7,3]],"date-time":"2008-07-03T00:00:00Z","timestamp":1215043200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s00453-008-9207-x","type":"journal-article","created":{"date-parts":[[2008,7,2]],"date-time":"2008-07-02T10:59:25Z","timestamp":1214996365000},"page":"530-543","source":"Crossref","is-referenced-by-count":2,"title":["On Counting 3-D Matchings of Size k"],"prefix":"10.1007","volume":"54","author":[{"given":"Yunlong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,3]]},"reference":[{"key":"9207_CR1","doi-asserted-by":"crossref","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 42, 844\u2013856 (1995)","journal-title":"J. ACM"},{"key":"9207_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/3-540-36136-7_40","volume-title":"Proc. 13th International Symposium on Algorithms and Computation (ISAAC 02)","author":"V. Arvind","year":"2002","unstructured":"Arvind, V., Raman, V.: Approximation algorithms for some parameterized counting problems. In: Proc. 13th International Symposium on Algorithms and Computation (ISAAC 02), Lecture Notes in Computer Science, vol.\u00a02518, pp. 453\u2013464. Springer, Berlin (2002)"},{"key":"9207_CR3","doi-asserted-by":"crossref","unstructured":"Bayati, M., Gamarnik, D., Katz, D., Nair, C., Tetali, P.: Simple deterministic approximation algorithms for counting matchings. In: Proc. 39th Symposium on Theory of Computing (STOC 07), pp.\u00a0122\u2013127 (2007)","DOI":"10.1145\/1250790.1250809"},{"key":"9207_CR4","unstructured":"Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 07), pp.\u00a0298\u2013307 (2007)"},{"key":"9207_CR5","unstructured":"Chien, S.: A determinant-based algorithm for counting perferct matchings in a general graph. In: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 04), pp.\u00a0728\u2013735 (2004)"},{"key":"9207_CR6","doi-asserted-by":"crossref","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. 33, 892\u2013922 (2004)","journal-title":"SIAM J. Comput."},{"key":"9207_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-540-30140-0_29","volume-title":"Proc. 12th Annual European Symposium on Algorithms (ESA 04)","author":"M. Fellows","year":"2004","unstructured":"Fellows, M., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Proc. 12th Annual European Symposium on Algorithms (ESA 04). Lecture Notes in Computer Science, vol.\u00a03221, pp. 311\u2013322. Springer, Berlin (2004)"},{"key":"9207_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9207_CR9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.ipl.2004.12.005","volume":"94","author":"I. Koutis","year":"2005","unstructured":"Koutis, I.: A faster parameterized algorithm for set packing. Inf. Process. Lett. 94, 7\u20139 (2005)","journal-title":"Inf. Process. Lett."},{"key":"9207_CR10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/0196-6774(89)90038-2","volume":"10","author":"R. Karp","year":"1989","unstructured":"Karp, R., Luby, M., Madras, N.: Monte-Carlo approximation algorithms for enumeration problems. J. Algorithms 10, 429\u2013448 (1989)","journal-title":"J. Algorithms"},{"key":"9207_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/3-540-36494-3_38","volume-title":"Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 03)","author":"P. Sankowski","year":"2003","unstructured":"Sankowski, P.: Alternative algorithms for counting all matchings in graph. In: Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 03). Lecture Notes in Computer Science, vol.\u00a02607, pp. 427\u2013438. Springer, Berlin (2003)"},{"key":"9207_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/11847250_8","volume-title":"Proc. 2nd International Workshop on Parameterized and Exact Computation (IWPEC 06)","author":"Y. Liu","year":"2006","unstructured":"Liu, Y., Lu, S., Chen, J., Sze, S.-H.: Greedy localization and color-coding: improved matching and packing algorithms. In: Proc. 2nd International Workshop on Parameterized and Exact Computation (IWPEC 06). Lecture Notes in Computer Science, vol.\u00a04169, pp. 84\u201395. Springer, Berlin (2006)"},{"key":"9207_CR13","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"S. Vadhan","year":"2002","unstructured":"Vadhan, S.: The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput. 31, 398\u2013427 (2002)","journal-title":"SIAM J. Comput."},{"key":"9207_CR14","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L. Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"9207_CR15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9207-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9207-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9207-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:02Z","timestamp":1559123102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9207-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,3]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9207"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9207-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,3]]}}}