Pages that link to "Item:Q393083"

The following pages link to Polynomial kernels for proper interval completion and related problems (Q393083):

Displaying 8 items.

• Unit interval editing is fixed-parameter tractable (Q515577) (← links)
• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
• Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
• Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
• A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
• (Q5874519) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)