Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles
- 3 January 2008
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 52 (2) , 203-225
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A refined search tree technique for Dominating Set on planar graphsJournal of Computer and System Sciences, 2005
- Boundary classes of graphs for the dominating set problemDiscrete Mathematics, 2004
- Polynomial-time data reduction for dominating setJournal of the ACM, 2004
- On easy and hard hereditary classes of graphs with respect to the independent set problemDiscrete Applied Mathematics, 2003
- Computing small partial coveringsInformation Processing Letters, 2003
- The complexity of irredundant sets parameterized by sizeDiscrete Applied Mathematics, 2000
- Parameterized Complexity1999
- The Parametrized Complexity of Some Fundamental Problems in Coding TheorySIAM Journal on Computing, 1999
- Threshold dominating sets and an improved characterization of W[2]Theoretical Computer Science, 1998
- Approximation of k-set cover by semi-local optimization1997