The following pages link to (Q5091008):
Displaying 9 items.
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Target set selection parameterized by vertex cover and more (Q2082561) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- Immunization in the threshold model: a parameterized complexity study (Q6069928) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
