An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem

This publication has 20 references indexed in Scilit:

• Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
  2005
• On Miniaturized Problems in Parameterized Complexity Theory
  2004
• On the existence of subexponential parameterized algorithms
  Journal of Computer and System Sciences, 2003
• Cutting Up Is Hard To Do
  Electronic Notes in Theoretical Computer Science, 2003
• Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
  Algorithmica, 2002
• Randomized Algorithms for the Loop Cutset Problem
  Journal of Artificial Intelligence Research, 2000
• Parameterized Complexity
  1999
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
  SIAM Journal on Discrete Mathematics, 1999
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
  SIAM Journal on Computing, 1998
• ON DISJOINT CYCLES
  International Journal of Foundations of Computer Science, 1994