Pages that link to "Item:Q2912734"
From MaRDI portal
The following pages link to Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width (Q2912734):
Displayed 19 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)
- Parameterized algorithms for conflict-free colorings of graphs (Q1786593) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← 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)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)