Pål Grønås Drange

According to our database, Pål Grønås Drange authored at least 22 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

Correlation Clustering with Vertex Splitting.

Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Two-Sets Cut-Uncut on Planar Graphs.

Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

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., May, 2023

Computing Complexity Measures of Degenerate Graphs.

Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

PACE Solver Description: Zygosity.

Emmanuel Arrighi, Pål Grønås Drange, Kenneth Langedal, Farhad Vadiee, Martin Vatshelle, Petra Wolf

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Cluster Editing with Overlapping Communities.

Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

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

Harmless Sets in Sparse Classes.

Pål Grønås Drange, Irene Muzi, Felix Reidl

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021

Kernelization and hardness of harmless sets in sparse classes.

Pål Grønås Drange, Irene Muzi, Felix Reidl

CoRR, 2021

2018

A Polynomial Kernel for Trivially Perfect Editing.

Pål Grønås Drange, Michal Pilipczuk

Algorithmica, 2018

2016

A 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

SIAM J. Comput., 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

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, Sebastian Siebertz, Somnath Sikdar

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Compressing Bounded Degree Graphs.

Pål Grønås Drange, Markus S. Dregi, R. B. Sandeep

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

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

Fast Biclustering by Dual Parameterization.

Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

2014

On the Computational Complexity of Vertex Integrity.

Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof

CoRR, 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, Fernando Sánchez Villaamil, Somnath Sikdar

CoRR, 2014

Exploring Subexponential Parameterized Complexity of Completion Problems.

Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

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

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

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013