Parameterized Algorithms for Feedback Vertex Set

No abstract is available for this paper.

• Publication year

  2004

• Venue

  IWPEC

• Publication date

  2004-09-14

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-28639-4_21
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Dominating sets in planar graphs: branch-width and exponential speed-up

  2003cited by this paper
• Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set

  2002influential reference
• Randomized Algorithms for the Loop Cutset Problem

  2000cited by this paper
• Vertex Cover: Further Observations and Further Improvements

  1999cited by this paper
• Random Algorithms for the Loop Cutset Problem

  1999cited by this paper
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

  1999cited by this paper
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference

  1998cited by this paper
• Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

  1998cited by this paper
• Parameterized Complexity

  1998cited by this paper
• A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach

  1996cited by this paper
• Packing directed circuits

  1996cited by this paper
• Packing directed circuits fractionally

  1995cited by this paper
• Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W Hierarchy

  1992influential reference
• On Disjoint Cycles

  1991influential reference
• The BALLAST Methodology for Structured Partial Scan Design

  1990cited by this paper
• An analytical approach to the partial scan problem

  1990cited by this paper
• BALLAST: a methodology for partial scan design

  1989cited by this paper
• Matrix multiplication via arithmetic progressions

  1987cited by this paper
• An extremal function for contractions of graphs

  1984cited by this paper
• On a class of degenerate extremal graph problems

  1983cited by this paper
• Girth in graphs

  1983cited by this paper
• The minimum Hadwiger number for graphs with a given mean degree of vertices

  1982cited by this paper
• Finding a minimum circuit in a graph

  1977cited by this paper
• Cycles of even length in graphs

  1974cited by this paper
• Graph theory

  1969cited by this paper

• Parameterized algorithms for connectivity, separation, and modification problems in graphs

  2021cites this paper
• On the Complexity of Singly Connected Vertex Deletion

  2020cites this paper
• Parameterized algorithms of fundamental NP-hard problems: a survey

  2020cites this paper
• Mim-Width II. The Feedback Vertex Set Problem

  2019cites this paper
• Detecting Feedback Vertex Sets of Size k in O⋆ (2.7k) Time

  2019cites this paper
• Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set

  2018cites this paper
• Ja n 20 16 A POLYNOMIAL KERNEL FOR BLOCK GRAPH DELETION

  2018cites this paper
• An Improved FPT Algorithm for Independent Feedback Vertex Set

  2018cites this paper
• A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width

  2017cites this paper
• Linear-time Kernelization for Feedback Vertex Set

  2016cites this paper
• Experimental Analysis of Fixed Parameter Algorithms for Odd Cycle Transversals and Feedback Vertex Sets

  2016cites this paper
• A polynomial kernel for Block Graph Vertex Deletion

  2015cites this paper
• A Polynomial Kernel for Block Graph Deletion

  2015cites this paper
• A Note on Finding Dual Feedback Vertex Set

  2015cites this paper
• Directed Graphs: Fixed-Parameter Tractability & Beyond

  2014cites this paper
• Faster deterministic Feedback Vertex Set

  2013cites this paper
• An implementation of a Feedback Vertex Set algorithm.

  2013cites this paper
• An improved parameterized algorithm for the independent feedback vertex set problem

  2013cites this paper
• Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable

  2012cites this paper
• Clustering and Inconsistent Information: A Kernelization Approach

  2012cites this paper
• Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures. (Kernelization algorithms for graph and other structures modification problems)

  2011influential citation
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

  2011cites this paper
• On Group Feedback Vertex Set Parameterized by the Size of the Cutset

  2011cites this paper
• Technika tnij i zliczaj w grafowych problemach spójno±ci parametryzowanych szeroko±ci¡ drzewiast¡

  2011cites this paper
• The Kernelization complexity of some domination and covering problems

  2011cites this paper
• Cut&Count technique for graph connectivity problems parameterized by treewidth

  2011influential citation
• Combinatorial Algorithms

  2011cites this paper
• A 4k2 kernel for feedback vertex set

  2010cites this paper
• Advances in cluster editing: linear FPT kernels and comparative implementations

  2010cites this paper
• Subset Feedback Vertex Set Is Fixed-Parameter Tractable

  2010cites this paper
• Feedback Vertex Set in Mixed Graphs

  2010cites this paper
• On Feedback Vertex Set New Measure and New Structures

  2010influential citation
• On Feedback Vertex Set: New Measure and New Structures

  2010cites this paper
• A Cubic Kernel for Feedback Vertex Set and Loop Cutset

  2010cites this paper
• A Quartic Kernel for Pathwidth-One Vertex Deletion

  2010cites this paper
• Finding optimal solutions for covering and matching problems

  2010cites this paper
• A quadratic kernel for feedback vertex set

  2009cites this paper
• A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem

  2009cites this paper
• Exact Algorithms for Optimization and parameterized versions of some graph theoretic problems[HBNI Th 6]

  2008cites this paper
• A fixed-parameter algorithm for the directed feedback vertex set problem

  2008cites this paper
• A Linear Kernel for Planar Feedback Vertex Set

  2008cites this paper
• A fixed-parameter algorithm for the directed feedback vertex set problem

  2008cites this paper
• Combinatorial Optimization on Graphs of Bounded Treewidth

  2008cites this paper
• Improved Algorithms for the Feedback Vertex Set Problems

  2007cites this paper
• A Cubic Kernel for Feedback Vertex Set

  2007cites this paper
• Directed Feedback Vertex Set Problem is FPT

  2007influential citation
• MICHAEL J. PELSMAJER Brief Research Summary (October 2007)

  2007cites this paper
• Faster fixed parameter tractable algorithms for finding feedback vertex sets

  2006cites this paper
• The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel

  2006cites this paper
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

  2006cites this paper
• Algorithm design techniques for parameterized graph modification problems

  2006cites this paper
• Faster algorithms for feedback vertex set

  2005cites this paper
• Improved Fixed-Parameter Algorithms for Two Feedback Set Problems

  2005cites this paper
• An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem

  2005cites this paper
• FPT Algorithm for the Undirected Feedback Vertex Set Problem ∗

  2004cites this paper