{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:10:31Z","timestamp":1725484231479},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438649"},{"type":"electronic","value":"9783540454656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45465-9_84","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T21:12:57Z","timestamp":1180213977000},"page":"985-992","source":"Crossref","is-referenced-by-count":0,"title":["Finding a Path of Superlogarithmic Length"],"prefix":"10.1007","author":[{"given":"A.","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Husfeldt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"issue":"2","key":"84_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"N. Alon, R. Yuster, and U. Zwick. Color-coding. Journal of the ACM, 42(2):844\u2013856, 1995.","journal-title":"Journal of the ACM"},{"issue":"1","key":"84_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1993.1001","volume":"14","author":"H. L. Bodlaender","year":"1993","unstructured":"H. L. Bodlaender. On linear time minor tests with depth-first search. Journal of Algorithms, 14(1):1\u201323, 1993.","journal-title":"Journal of Algorithms"},{"key":"84_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(81)90159-X","volume":"33","author":"J. A. Bondy","year":"1981","unstructured":"J. A. Bondy and S. C. Locke. Relative length of paths and cycles in 3-connected graphs. Discrete Mathematics, 33:111\u2013122, 1981.","journal-title":"Discrete Mathematics"},{"key":"84_CR4","doi-asserted-by":"crossref","unstructured":"T. Feder, R. Motwani, and C. S. Subi. Finding long paths and cycles in sparse Hamiltonian graphs. In Proc. 32th STOC, pages 524\u2013529. ACM, 2000.","DOI":"10.1145\/335305.335368"},{"key":"84_CR5","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979."},{"issue":"1","key":"84_CR6","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF02523689","volume":"18","author":"D. Karger","year":"1997","unstructured":"D. Karger, R. Motwani, and G.D.S. Ramkumar. On approximating the longest path in a graph. Algorithmica, 18(1):82\u201398, 1997.","journal-title":"Algorithmica"},{"key":"84_CR7","first-page":"239","volume":"25","author":"B. Monien","year":"1985","unstructured":"B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, 25:239\u2013254, 1985.","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"84_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/jcss.1996.0058","volume":"53","author":"C. H. Papadimitriou","year":"1996","unstructured":"C. H. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of the V\u2014C dimension. Journal of Computer and Systems Sciences, 53(2):161\u2013170, 1996.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"84_CR9","unstructured":"S. Vishwanathan. An approximation algorithm for finding a long path in Hamiltonian graphs. In Proc. 11th SODA, pages 680\u2013685, 2000."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45465-9_84","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T18:31:25Z","timestamp":1550341885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45465-9_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438649","9783540454656"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45465-9_84","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}