{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T16:09:26Z","timestamp":1744906166519},"reference-count":19,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T00:00:00Z","timestamp":1270080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,4,28]],"date-time":"2014-04-28T00:00:00Z","timestamp":1398643200000},"content-version":"vor","delay-in-days":1488,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1016\/j.dam.2009.12.006","type":"journal-article","created":{"date-parts":[[2010,1,7]],"date-time":"2010-01-07T09:16:33Z","timestamp":1262855793000},"page":"882-893","source":"Crossref","is-referenced-by-count":5,"title":["Finding large cycles in Hamiltonian graphs"],"prefix":"10.1016","volume":"158","author":[{"given":"Tom\u00e1s","family":"Feder","sequence":"first","affiliation":[]},{"given":"Rajeev","family":"Motwani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2009.12.006_b1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1006\/jagm.1998.0998","article-title":"On the approximability of finding a(nother) hamiltonian cycle in cubic hamiltonian graphs","volume":"31","author":"Bazgan","year":"1999","journal-title":"Journal of Algorithms"},{"issue":"6","key":"10.1016\/j.dam.2009.12.006_b2","doi-asserted-by":"crossref","first-page":"1395","DOI":"10.1137\/S0097539702416761","article-title":"Finding a path of superlogarithmic length","volume":"32","author":"Bj\u00f6rklund","year":"2003","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.dam.2009.12.006_b3","series-title":"ICALP","article-title":"Approximating longest directed path","author":"Bj\u00f6rklund","year":"2004"},{"key":"10.1016\/j.dam.2009.12.006_b4","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1006\/jctb.2001.2108","article-title":"Long cycles in graphs on a fixed surface","volume":"85","author":"B\u00f6hme","year":"2002","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.dam.2009.12.006_b5","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1137\/050633263","article-title":"Approximating longest cycles in graphs with bounded degree","volume":"36","author":"Chen","year":"2006","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"10.1016\/j.dam.2009.12.006_b6","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1137\/S0097539703436473","article-title":"Circumference of graphs with bounded degree","volume":"33","author":"Chen","year":"2004","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.dam.2009.12.006_b7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1006\/jctb.2002.2113","article-title":"Long cycles in 3-connected graphs","volume":"86","author":"Chen","year":"2002","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"10.1016\/j.dam.2009.12.006_b8","first-page":"1596","article-title":"Approximating the longest cycle problem in sparse graphs","volume":"31","author":"Feder","year":"2003","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.dam.2009.12.006_b9","unstructured":"T. Feder, R. Motwani, A. Zhu, k-connected spanning subgraphs of low degree, Electronic Colloquium on Computational Complexity, ECCC, TR06-41, 2006"},{"key":"10.1016\/j.dam.2009.12.006_b10","unstructured":"M. F\u00fcrer, B. Raghavachari, Approximating the minimum degree spanning tree to within one from the optimal degree, in: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 1992, pp. 317\u2013324"},{"key":"10.1016\/j.dam.2009.12.006_b11","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, Finding paths and cycles of superpolylogarithmic length, in: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC, 2004, pp. 407\u2013416","DOI":"10.1145\/1007352.1007418"},{"issue":"3","key":"10.1016\/j.dam.2009.12.006_b12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.dam.2009.12.006_b13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0095-8956(86)90024-9","article-title":"Longest cycles in 3-connected cubic graphs","volume":"41","author":"Jackson","year":"1986","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.dam.2009.12.006_b14","series-title":"Graphs, Matrices, and Designs","first-page":"237","article-title":"Longest cycles in 3-connected graphs of bounded maximum degree","author":"Jackson","year":"1993"},{"key":"10.1016\/j.dam.2009.12.006_b15","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF02523689","article-title":"On approximating the longest path in a graph","volume":"18","author":"Karger","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2009.12.006_b16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0022-0000(80)90057-4","article-title":"The subgraph homeomorphism problem","volume":"20","author":"LaPaugh","year":"1980","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.dam.2009.12.006_b17","series-title":"Proceedings of the 12th Conference on Foundations of Software Tech. and Theoret. Comp. Sci.","first-page":"279","article-title":"Approximation through local optimality: Designing networks with small degree","volume":"vol. 652","author":"Ravi","year":"1992"},{"key":"10.1016\/j.dam.2009.12.006_b18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","article-title":"Graph minors XIII: The disjoint paths problem","volume":"63","author":"Robertson","year":"1995","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.dam.2009.12.006_b19","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1006\/jctb.1998.1836","article-title":"On 2-connected spanning subgraphs with low maximum degree","volume":"74","author":"Sanders","year":"1986","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X09004879?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X09004879?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T00:12:49Z","timestamp":1558743169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X09004879"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":19,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["S0166218X09004879"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2009.12.006","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2010,4]]}}}