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]
@article{RamanS08,
title = {Short Cycles Make ::::W:::: -hard Problems Hard: FPT Algorithms for ::::W:::: -hard Problems in Graphs with no Short Cycles},
author = {Venkatesh Raman and Saket Saurabh},
year = {2008},
doi = {10.1007/s00453-007-9148-9},
url = {http://dx.doi.org/10.1007/s00453-007-9148-9},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/RamanS08},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {52},
number = {2},
pages = {203-225},
}