Pål Grønås Drange

A $c^k n$ 5-Approximation Algorithm for Treewidth

Hans L. Bodlaender, Pål Grønås Drange, Markus Sortland Dregi et al. · SIAM Journal on Computing · 2016 · 198 citations · Full text

On the Computational Complexity of Vertex Integrity and Component Order Connectivity

Pål Grønås Drange, Markus Sortland Dregi, Pim van ’t Hof · Algorithmica · 2016 · 85 citations

Vertex Integrity, Engineering, Graph Theory +13

An O(c^k n) 5-Approximation Algorithm for Treewidth

Hans L. Bodlaender, Pål Grønås Drange, Markus Sortland Dregi et al. · 2013 · 64 citations

Engineering, Analysis Of Algorithm, Computational Complexity +18

A survey of parameterized algorithms and the complexity of edge modification

Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin et al. · Computer Science Review · 2023 · 41 citations · Full text

Mathematical Programming, Graph Sparsity, Engineering +23

Exploring the Subexponential Complexity of Completion Problems

Pål Grønås Drange, Fedor V. Fomin, Michał Pilipczuk et al. · ACM Transactions on Computation Theory · 2015 · 27 citations

Mathematical Programming, Computational Complexity Theory, Engineering +14