Towards a polynomial kernel for directed feedback vertex set (Q2663705): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-020-00777-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2775670884
@@ Property / OpenAlex ID: W2775670884 / rank @@
+Normal rank
@@ Property / cites work @@
+A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
+Normal rank
@@ Property / cites work @@
+Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
+Normal rank
@@ Property / cites work @@
+Q5111250
@@ Property / cites work: Q5111250 / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+A cubic kernel for feedback vertex set and loop cutset
+Normal rank
@@ Property / cites work @@
+On Feedback Vertex Set New Measure and New Structures
+Normal rank
@@ Property / cites work @@
+Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation
+Normal rank
@@ Property / cites work @@
+Improved algorithms for feedback vertex set problems
+Normal rank
@@ Property / cites work @@
+A fixed-parameter algorithm for the directed feedback vertex set problem
+Normal rank
@@ Property / cites work @@
+Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of losing width
@@ Property / cites work: On the hardness of losing width / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Subset Feedback Vertex Set Is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability and Completeness I: Basic Results
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On Independent Circuits Contained in a Graph
@@ Property / cites work: On Independent Circuits Contained in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum feedback sets and multicuts in directed graphs
+Normal rank
@@ Property / cites work @@
+Kernelization using structural parameters on sparse graph classes
+Normal rank
@@ Property / cites work @@
+Q3757929
@@ Property / cites work: Q3757929 / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of H-Transversal/Packing
@@ Property / cites work: Inapproximability of H-Transversal/Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
+Normal rank
@@ Property / cites work @@
+Q5743513
@@ Property / cites work: Q5743513 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing cycles through prescribed vertices
@@ Property / cites work: Packing cycles through prescribed vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
+Normal rank
@@ Property / cites work @@
+Packing directed cycles through a specified vertex set
+Normal rank
@@ Property / cites work @@
+Faster deterministic \textsc{Feedback Vertex Set}
@@ Property / cites work: Faster deterministic \textsc{Feedback Vertex Set} / rank @@
+Normal rank
@@ Property / cites work @@
+Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS
+Normal rank
@@ Property / cites work @@
+Disjoint cycles intersecting a set of vertices
@@ Property / cites work: Disjoint cycles intersecting a set of vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Faster fixed parameter tractable algorithms for finding feedback vertex sets
+Normal rank
@@ Property / cites work @@
+Packing directed circuits
@@ Property / cites work: Packing directed circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Packing directed circuits fractionally
@@ Property / cites work: Packing directed circuits fractionally / rank @@
+Normal rank
@@ Property / cites work @@
+Packing circuits in eulerian digraphs
@@ Property / cites work: Packing circuits in eulerian digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A 4             <i>k</i>             <sup>2</sup>             kernel for feedback vertex set
+Normal rank
@@ Property / cites work @@
+Half-integrality, LP-branching and FPT Algorithms
@@ Property / cites work: Half-integrality, LP-branching and FPT Algorithms / rank @@
+Normal rank