Pages that link to "Item:Q3058699"

The following pages link to On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699):

Displaying 14 items.

• Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
• Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
• Two edge modification problems without polynomial kernels (Q1662097) (← links)
• On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
• On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
• Faster algorithms for cograph edge modification problems (Q2308466) (← links)
• Incompressibility of \(H\)-free edge modification problems (Q2343091) (← links)
• An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
• On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion (Q2946005) (← links)
• Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
• Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
• (Q5743380) (← links)
• (Q5743381) (← links)
• Polynomial kernels for paw-free edge modification problems (Q5919117) (← links)