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. Algorithmica, 52(2):203-225, 2008. [doi]

Abstract

Abstract is missing.