Pages that link to "Item:Q2912734"

The following pages link to Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width (Q2912734):

Displayed 10 items.

• Structural parameterizations for boxicity (Q289935) ‎ (← links)
• Kernelization using structural parameters on sparse graph classes (Q340583) ‎ (← links)
• Complexity of conflict-free colorings of graphs (Q484316) ‎ (← links)
• On the parameterized complexity of computing balanced partitions in graphs (Q493645) ‎ (← links)
• Approximate association via dissociation (Q505447) ‎ (← links)
• The firefighter problem: further steps in understanding its complexity (Q527402) ‎ (← links)
• Constant thresholds can make target set selection tractable (Q2254488) ‎ (← links)
• Open Problems on Graph Coloring for Special Graph Classes (Q2827799) ‎ (← links)
• The Firefighter Problem: A Structural Analysis (Q2946017) ‎ (← links)
• A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) ‎ (← links)