The following pages link to Pål Grønås Drange (Q1799207):
Displaying 9 items.
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- On the threshold of intractability (Q2051847) (← links)
- Harmless sets in sparse classes (Q2169963) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
- (Q2965491) (← links)
- Fast biclustering by dual parameterization (Q5363792) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
