{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T21:55:18Z","timestamp":1765230918992},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_57","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"662-673","source":"Crossref","is-referenced-by-count":1,"title":["Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs"],"prefix":"10.1007","author":[{"given":"Marek","family":"Karpi\u0144ski","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Ruci\u0144ski","sequence":"additional","affiliation":[]},{"given":"Edyta","family":"Szyma\u0144ska","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2008","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 3rd edn. Wiley, Chichester (2008)","edition":"3"},{"key":"57_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"Angluin, D., Valiant, L.: Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. System Sci.\u00a018, 155\u2013193 (1979)","journal-title":"J. Comput. System Sci."},{"key":"57_CR3","first-page":"39","volume":"260","author":"J.C. Bermond","year":"1976","unstructured":"Bermond, J.C., et al.: Hypergraphes hamiltoniens. Prob. Comb. Theorie Graph Orsay\u00a0260, 39\u201343 (1976)","journal-title":"Prob. Comb. Theorie Graph Orsay"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Bollobas, B., Fenner, T.I., Frieze, A.: An algorithm for finding hamiltonian cycles in random graphs. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pp. 430\u2013439 (1985)","DOI":"10.1145\/22145.22193"},{"key":"57_CR5","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/rsa.3240050303","volume":"5","author":"A. Broder","year":"1994","unstructured":"Broder, A., Frieze, A., Shamir, E.: Finding hidden Hamilton cycles. Random Structures Algorithms\u00a05, 395\u2013410 (1994)","journal-title":"Random Structures Algorithms"},{"key":"57_CR6","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1137\/S0097539799351729","volume":"30","author":"A. Czygrinow","year":"2000","unstructured":"Czygrinow, A., R\u00f6dl, V.: An algorithmic regularity lemma for hypergraphs. SIAM Journal on Computing\u00a030, 1041\u20131066 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"57_CR7","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. Algorithms\u00a015, 367\u2013384 (1993)","journal-title":"J. Algorithms"},{"key":"57_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"3","author":"G.A. Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems of abstract graphs. Proc. London Math. Soc.\u00a03, 69\u201381 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"57_CR9","first-page":"183","volume":"2","author":"P. Erd\u0151s","year":"1964","unstructured":"Erd\u0151s, P.: On extremal problems of graphs and generalized graphs, Israel. J. Math.\u00a02, 183\u2013190 (1964)","journal-title":"J. Math."},{"key":"57_CR10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-662-12788-9_2","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"A. Frieze","year":"1998","unstructured":"Frieze, A., Reed, B.: Probabilistic Analysis of Algorithms. In: Probabilistic Methods for Algorithmic Discrete Mathematics, pp. 36\u201392. Springer, Heidelberg (1998)"},{"key":"57_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. John Wiley and Sons, New York (2000)"},{"key":"57_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-10631-6_64","volume-title":"Algorithms and Computation","author":"M. Karpin\u0308ski","year":"2009","unstructured":"Karpin\u0308ski, M., Rucin\u0308ski, A., Szyman\u0308ska, E.: The Complexity of Perfect Matching Problems on Dense Hypergraphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 626\u2013636. Springer, Heidelberg (2009)"},{"key":"57_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O","volume":"30","author":"G.Y. Katona","year":"1999","unstructured":"Katona, G.Y., Kierstead, H.A.: Hamiltonian chains in hypergraphs. J. Graph Theory\u00a030, 205\u2013212 (1999)","journal-title":"J. Graph Theory"},{"issue":"6","key":"57_CR14","first-page":"767","volume":"96","author":"D. K\u00fchn","year":"2006","unstructured":"K\u00fchn, D., Osthus, D.: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. JCT B\u00a096(6), 767\u2013821 (2006)","journal-title":"JCT B"},{"issue":"2","key":"57_CR15","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1137\/060657492","volume":"21","author":"V. R\u00f6dl","year":"2007","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Schacht, M.: Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. SIAM J. of Discrete Math.\u00a021(2), 442\u2013460 (2007)","journal-title":"SIAM J. of Discrete Math."},{"issue":"2","key":"57_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00493-008-2295-z","volume":"28","author":"V. R\u00f6dl","year":"2008","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: An approximate Dirac-type theorem for k-uniform hypergraphs. Combinatorica\u00a028(2), 229\u2013260 (2008)","journal-title":"Combinatorica"},{"key":"57_CR17","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs. The Mittag-Leffler preprint series (Spring 2009) (submitted)"},{"key":"57_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/978-3-642-10217-2_43","volume-title":"IWOCA 2009","author":"E. Szyma\u0144ska","year":"2009","unstructured":"Szyma\u0144ska, E.: The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree. In: Fiala, J. (ed.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 438\u2013449. Springer, Heidelberg (2009)"},{"key":"57_CR19","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","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:51:20Z","timestamp":1606186280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}