scientific article; zbMATH DE number 7765420
From MaRDI portal
Publication:6065472
DOI10.4230/lipics.isaac.2020.62MaRDI QIDQ6065472
Jungho Ahn, Euiwoong Lee, Eun Jung Kim
Publication date: 14 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Chordal editing is fixed-parameter tractable
- Parameterized complexity of vertex deletion into perfect graph classes
- Finding odd cycle transversals.
- Structure and linear time recognition of 3-leaf powers
- Chordal deletion is fixed-parameter tractable
- Laminar structure of ptolemaic graphs with applications
- On diameters and radii of bridged graphs
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- Erdős-Pósa property of chordless cycles and its applications
- Rank-width and vertex-minors
- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
- Hitting Diamonds and Growing Cacti
- Computing the Minimum Fill-In is NP-Complete
- A New Algorithm for Generating All the Maximal Independent Sets
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation
- Linear Recognition of Almost Interval Graphs
- Approximation and Kernelization for Chordal Vertex Deletion
- Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
- Compression via Matroids
- Interval Deletion Is Fixed-Parameter Tractable
- Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
- Interval Vertex Deletion Admits a Polynomial Kernel
- Losing Treewidth by Separating Subsets
- A polynomial kernel for distance-hereditary vertex deletion
This page was built for publication:
