An O(c^k n) 5-Approximation Algorithm for Treewidth. - Hans L. Bodlaender; Pål Grønås Drange; Markus S. Dregi; Fedor V. Fomin; Daniel Lokshtanov; Michal Pilipczuk (FOCS, 2013)

A O(c^k n) 5-Approximation Algorithm for Treewidth - Hans L. Bodlaender; Pål Grønås Drange; Markus S. Dregi; Fedor V. Fomin; Daniel Lokshtanov; Michal Pilipczuk (CoRR, 2013)

Exploring Subexponential Parameterized Complexity of Completion Problems. - Pål Grønås Drange; Fedor V. Fomin; Michal Pilipczuk; Yngve Villanger (STACS, 2014)

Kernelization and Sparseness: the case of Dominating Set. - Pål Grønås Drange; Markus S. Dregi; Fedor V. Fomin; Stephan Kreutzer; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Felix Reidl; Saket Saurabh 001; Fernando Sánchez Villaamil; Somnath Sikdar (CoRR, 2014)

On the Computational Complexity of Vertex Integrity. - Pål Grønås Drange; Markus Sortland Dregi; Pim van 't Hof (CoRR, 2014)

Fast Biclustering by Dual Parameterization. - Pål Grønås Drange; Felix Reidl; Fernando Sánchez Villaamil; Somnath Sikdar (IPEC, 2015)

Exploring the Subexponential Complexity of Completion Problems. - Pål Grønås Drange; Fedor V. Fomin; Michal Pilipczuk; Yngve Villanger (ACM Trans. Comput. Theory, 2015)

Compressing Bounded Degree Graphs. - Pål Grønås Drange; Markus S. Dregi; R. B. Sandeep (LATIN, 2016)

Kernelization and Sparseness: the Case of Dominating Set. - Pål Grønås Drange; Markus Sortland Dregi; Fedor V. Fomin; Stephan Kreutzer; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Felix Reidl; Fernando Sánchez Villaamil; Saket Saurabh 001; Sebastian Siebertz; Somnath Sikdar (STACS, 2016)

On the Computational Complexity of Vertex Integrity and Component Order Connectivity. - Pål Grønås Drange; Markus S. Dregi; Pim van 't Hof (Algorithmica, 2016)

A ck n 5-Approximation Algorithm for Treewidth. - Hans L. Bodlaender; Pål Grønås Drange; Markus S. Dregi; Fedor V. Fomin; Daniel Lokshtanov; Michal Pilipczuk (SIAM J. Comput., 2016)

A Polynomial Kernel for Trivially Perfect Editing. - Pål Grønås Drange; Michal Pilipczuk (Algorithmica, 2018)

Kernelization and hardness of harmless sets in sparse classes. - Pål Grønås Drange; Irene Muzi; Felix Reidl (CoRR, 2021)

Harmless Sets in Sparse Classes. - Pål Grønås Drange; Irene Muzi; Felix Reidl (IWOCA, 2022)

On the threshold of intractability. - Pål Grønås Drange; Markus Fanebust Dregi; Daniel Lokshtanov; Blair D. Sullivan (J. Comput. Syst. Sci., 2022)

Cluster Editing with Overlapping Communities. - Emmanuel Arrighi; Matthias Bentert; Pål Grønås Drange; Blair D. Sullivan; Petra Wolf 002 (IPEC, 2023)

PACE Solver Description: Zygosity. - Emmanuel Arrighi; Pål Grønås Drange; Kenneth Langedal; Farhad Vadiee; Martin Vatshelle; Petra Wolf 002 (IPEC, 2023)

Computing Complexity Measures of Degenerate Graphs. - Pål Grønås Drange; Patrick Greaves; Irene Muzi; Felix Reidl (IPEC, 2023)

A survey of parameterized algorithms and the complexity of edge modification. - Christophe Crespelle; Pål Grønås Drange; Fedor V. Fomin; Petr A. Golovach (Comput. Sci. Rev., 2023)

Two-Sets Cut-Uncut on Planar Graphs. - Matthias Bentert; Pål Grønås Drange; Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen (ICALP, 2024)

PACE Solver Description: LUNCH - Linear Uncrossing Heuristics. - Kenneth Langedal; Matthias Bentert; Thorgal Blanco; Pål Grønås Drange (IPEC, 2024)

Correlation Clustering with Vertex Splitting. - Matthias Bentert; Alex Crane; Pål Grønås Drange; Felix Reidl; Blair D. Sullivan (SWAT, 2024)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning. - Yosuke Mizutani; Daniel Coimbra Salomao; Alex Crane; Matthias Bentert; Pål Grønås Drange; Felix Reidl; Alan Kuntz; Blair D. Sullivan (CoRR, 2024)

Planar Network Diversion. - Matthias Bentert; Pål Grønås Drange; Fedor V. Fomin; Steinar Simonnes (SEA, 2025)

Overlapping Biclustering. - Matthias Bentert; Pål Grønås Drange; Erlend Haugen (CoRR, 2025)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination. - Matthias Bentert; Alex Crane; Pål Grønås Drange; Yosuke Mizutani; Blair D. Sullivan (CoRR, 2025)