Pages that link to "Item:Q3522940"

The following pages link to Chordal Deletion Is Fixed-Parameter Tractable (Q3522940):

Displaying 14 items.

• Induced packing of odd cycles in planar graphs (Q764360) (← links)
• Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
• On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
• Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
• Parameterizing above or below guaranteed values (Q1004602) (← links)
• Dynamically maintaining split graphs (Q1026107) (← links)
• Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
• Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
• Wheel-Free Deletion Is W[2]-Hard (Q3503585) (← links)
• On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints (Q3511357) (← links)
• Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
• Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
• Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
• A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)