Pages that link to "Item:Q392038"
From MaRDI portal
The following pages link to Parameterized complexity of vertex deletion into perfect graph classes (Q392038):
Displaying 18 items.
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)
- A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
- (Q6065472) (← links)
- Vertex deletion into bipartite permutation graphs (Q6068239) (← links)
- (Q6089665) (← links)
- (Q6089666) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
