Kernels for deletion to classes of acyclic digraphs
From MaRDI portal
Recommendations
Cites work
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A 4k^2 kernel for feedback vertex set
- A kernelization algorithm for \(d\)-hitting set
- Approximating minimum feedback sets and multicuts in directed graphs
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Constant factor approximation for subset feedback set problems via a new LP relaxation
- Directed subset feedback vertex set is fixed-parameter tractable
- Disjoint cycles intersecting a set of vertices
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Faster deterministic \textsc{Feedback Vertex Set}
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Fixed-parameter tractability results for feedback set problems in tournaments
- Fundamentals of parameterized complexity
- Half-integrality, LP-branching and FPT algorithms
- scientific article; zbMATH DE number 5485529 (Why is no real title available?)
- Improved algorithms for feedback vertex set problems
- Inapproximability of \(H\)-transversal/packing
- On feedback vertex set new measure and new structures
- On Independent Circuits Contained in a Graph
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Packing circuits in eulerian digraphs
- Packing cycles through prescribed vertices
- Packing directed circuits
- Packing directed circuits fractionally
- Packing directed cycles through a specified vertex set
- Parameterized algorithms
- Polynomial kernels for deletion to classes of acyclic digraphs
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Cited in
(14)- Polynomial kernels for deletion to classes of acyclic digraphs
- On the complexity of singly connected vertex deletion
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}
- Faster algorithm for pathwidth one vertex deletion
- A polynomial kernel for funnel arc deletion set
- Parameterised algorithms for deletion to classes of DAGs
- Faster parameterized algorithm for pumpkin vertex deletion set
- Polynomial kernels for deletion to classes of acyclic digraphs
- Kernels for deletion to classes of acyclic digraphs
- Brief announcement: Treewidth modulator: emergency exit for DFVS
- On the Complexity of Singly Connected Vertex Deletion
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- A Polynomial Kernel for Funnel Arc Deletion Set.
- Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set
This page was built for publication: Kernels for deletion to classes of acyclic digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678165)
