Pages that link to "Item:Q2802923"

The following pages link to A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion (Q2802923):

Displaying 13 items.

• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
• Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
• Faster exact algorithms for some terminal set problems (Q2361353) (← links)
• A polynomial kernel for block graph deletion (Q2408204) (← links)
• Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
• Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property (Q3181061) (← links)
• (Q5005155) (← links)
• Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← links)
• (Q6065472) (← links)
• (Q6089665) (← links)
• Smaller kernels for two vertex deletion problems (Q6551719) (← links)
• Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)
• A constant-factor approximation for weighted bond cover (Q6671673) (← links)