Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles.

Venkatesh Raman Saket Saurabh Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. 203-225 2008 52 Algorithmica 2 http://dx.doi.org/10.1007/s00453-007-9148-9 db/journals/algorithmica/algorithmica52.html#RamanS08