Pages that link to "Item:Q2223699"
From MaRDI portal
The following pages link to On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699):
Displaying 12 items.
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- On structural parameterizations of the offensive alliance problem (Q2150581) (← links)
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
- Group activity selection with few agent types (Q2701380) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- Hedonic diversity games: a complexity picture with more than two colors (Q6067039) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
- Slim tree-cut width (Q6586668) (← links)
