scientific article; zbMATH DE number 7559376
From MaRDI portal
Publication:5089163
DOI10.4230/LIPIcs.MFCS.2020.5MaRDI QIDQ5089163
O-joung Kwon, Sang-il Oum, Eduard Eiben, Jungho Ahn
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1911.04249
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Towards constant-factor approximation for chordal/distance-hereditary vertex deletion ⋮ A polynomial kernel for 3-leaf power deletion ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Chordal editing is fixed-parameter tractable
- Fundamentals of parameterized complexity
- Improved upper bounds for vertex cover
- Parameterized leaf power recognition via embedding into graph products
- Structure and linear time recognition of 3-leaf powers
- Chordal deletion is fixed-parameter tractable
- Fixed-parameter algorithms for cluster vertex deletion
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- The node-deletion problem for hereditary properties is NP-complete
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- A kernel of order \(2k-c\log k\) for vertex cover
- Linear time solvable optimization problems on graphs of bounded clique-width
- The 4-Steiner Root problem
- A polynomial kernel for block graph deletion
- Parametrized complexity theory.
- Some remarks about leaf roots
- Error compensation in leaf power problems
- On Graph Powers for Leaf-Labeled Trees
- The 3-Steiner Root Problem
- Decomposition of Directed Graphs
- Approximation and Kernelization for Chordal Vertex Deletion
- Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
- Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems
- Kernelization
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Faster Parameterized Algorithms Using Linear Programming
- Structure and linear-time recognition of 4-leaf powers
- Interval Vertex Deletion Admits a Polynomial Kernel
- Parameterized Algorithms
- A polynomial kernel for distance-hereditary vertex deletion
This page was built for publication:
