Pages that link to "Item:Q973007"

The following pages link to Chordal deletion is fixed-parameter tractable (Q973007):

Displaying 49 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)
• Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
• Unit interval editing is fixed-parameter tractable (Q515577) (← links)
• Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
• Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
• Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Proper interval vertex deletion (Q1949742) (← links)
• Paths to trees and cacti (Q1998842) (← links)
• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• A polynomial kernel for bipartite permutation vertex deletion (Q2093571) (← links)
• Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
• Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
• Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
• Erdős-Pósa property of chordless cycles and its applications (Q2200918) (← links)
• Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← 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)
• Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
• Backdoor Sets for CSP. (Q4993598) (← links)
• Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
• (Q5089163) (← links)
• Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
• Paths to Trees and Cacti (Q5283353) (← links)
• (Q5874519) (← links)
• Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
• Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)
• Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
• (Q6065472) (← links)
• Vertex deletion into bipartite permutation graphs (Q6068239) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
• A polynomial kernel for proper Helly circular-arc vertex deletion (Q6547958) (← links)
• Exact and parameterized algorithms for the independent cutset problem (Q6655670) (← links)