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)

Parameterized Complexity of Bandwidth on Trees. - Markus Sortland Dregi; Daniel Lokshtanov (ICALP (1), 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)

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)

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