{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T13:38:51Z","timestamp":1775828331625,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642106309","type":"print"},{"value":"9783642106316","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_64","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"626-636","source":"Crossref","is-referenced-by-count":4,"title":["The Complexity of Perfect Matching Problems on Dense Hypergraphs"],"prefix":"10.1007","author":[{"given":"Marek","family":"Karpi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Ruci\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edyta","family":"Szyma\u0144ska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Feige, U., Saberi, A.: Santa Claus Meets Hypergraph Matchings. In: Proc. of APPROX-RANDOM 2008, pp. 10\u201320 (2008)","DOI":"10.1007\/978-3-540-85363-3_2"},{"key":"64_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jagm.1993.1046","volume":"15","author":"E. Dalhaus","year":"1993","unstructured":"Dalhaus, E., Hajnal, P., Karpi\u0144ski, M.: On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs. J. Alg.\u00a015, 367\u2013384 (1993)","journal-title":"J. Alg."},{"key":"64_CR3","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Canad J. Math.\u00a017, 449\u2013467 (1965)","journal-title":"Canad J. Math."},{"key":"64_CR4","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. Freeman, New York (1979)"},{"key":"64_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF01793010","volume":"11","author":"P.E. Haxell","year":"1995","unstructured":"Haxell, P.E.: A Condition for Matchability in Hypergraphs. Graphs and Combinatorics\u00a011, 245\u2013248 (1995)","journal-title":"Graphs and Combinatorics"},{"key":"64_CR6","doi-asserted-by":"crossref","unstructured":"K\u00fchn, D., Osthus, D.: Critical chromatic number and the complexity of perfect packings in graphs. In: 17th ACM-SIAM Symposium on Discrete Algorithms 2006 (SODA), pp. 851\u2013859 (2006)","DOI":"10.1145\/1109557.1109651"},{"issue":"4","key":"64_CR7","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput.\u00a015(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"64_CR8","first-page":"613","volume":"116","author":"V. R\u00f6dl","year":"2009","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Perfect matchings in large uniform hypergraphs with large minimum collective degree. JCT A\u00a0116(3), 613\u2013636 (2009)","journal-title":"JCT A"},{"issue":"4","key":"64_CR9","first-page":"633","volume":"49","author":"V. R\u00f6dl","year":"2008","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Schacht, M., Szemer\u00e9di, E.: A note on perfect matchings in uniform hypergraphs with large minimum collective degree. Commen. Math. Univ. Carol.\u00a049(4), 633\u2013636 (2008)","journal-title":"Commen. Math. Univ. Carol."},{"key":"64_CR10","doi-asserted-by":"crossref","unstructured":"Szyma\u0144ska, E.: The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree. In: Proc. of IWOCA (2009) (to appear)","DOI":"10.1007\/978-3-642-10217-2_43"},{"key":"64_CR11","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1016\/j.disc.2008.02.041","volume":"309","author":"G. S\u00e4rk\u00f3zy","year":"2009","unstructured":"S\u00e4rk\u00f3zy, G.: A fast parallel algorithm for finding Hamiltonian cycles in dense graphs. Discrete Mathematics\u00a0309, 1611\u20131622 (2009)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:36:57Z","timestamp":1619782617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}