Harold N. Gabow. Finding paths and cycles of superpolylogarithmic length. In László Babai, editor, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004. pages 407-416, ACM, 2004. [doi]
Abstract is missing.