The following pages link to (Q4268437):
Displayed 12 items.
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- A new approach for approximating node deletion problems (Q1029021) (← links)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- (Q5115821) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)