Pages that link to "Item:Q973007"
From MaRDI portal
The following pages link to Chordal deletion is fixed-parameter tractable (Q973007):
Displayed 21 items.
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs (Q2828227) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
- Proper Interval Vertex Deletion (Q3058706) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)