Pål Grønås Drange

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 19

Top Topics

Polynomial Kernels

Parameterized Complexity

Top Venues

Publications

Yosuke Mizutani, Daniel Coimbra Salomao, Alex Crane, Matthias Bentert, Pål Grønås Drange, Felix Reidl, Alan Kuntz, Blair D. Sullivan
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning. CoRR (2024)
Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
Correlation Clustering with Vertex Splitting. SWAT (2024)
Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
Correlation Clustering with Vertex Splitting. CoRR (2024)
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Two-Sets Cut-Uncut on Planar Graphs. ICALP (2024)
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Two-sets cut-uncut on planar graphs. CoRR (2023)
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev. 48 (2023)
Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl
Computing complexity measures of degenerate graphs. CoRR (2023)
Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf
Cluster Editing with Overlapping Communities. IPEC (2023)
Emmanuel Arrighi, Pål Grønås Drange, Kenneth Langedal, Farhad Vadiee, Martin Vatshelle, Petra Wolf
PACE Solver Description: Zygosity. IPEC (2023)
Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl
Computing Complexity Measures of Degenerate Graphs. IPEC (2023)
Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan
On the threshold of intractability. J. Comput. Syst. Sci. 124 (2022)
Pål Grønås Drange, Irene Muzi, Felix Reidl
Harmless Sets in Sparse Classes. IWOCA (2022)
Pål Grønås Drange, Irene Muzi, Felix Reidl
Kernelization and hardness of harmless sets in sparse classes. CoRR (2021)
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
A survey of parameterized algorithms and the complexity of edge modification. CoRR (2020)
Pål Grønås Drange, Michal Pilipczuk
A Polynomial Kernel for Trivially Perfect Editing. Algorithmica 80 (12) (2018)
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
Kernelization and Sparseness: the Case of Dominating Set. STACS (2016)
Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
n 5-Approximation Algorithm for Treewidth. SIAM J. Comput. 45 (2) (2016)
Pål Grønås Drange, Markus S. Dregi, Pim van 't Hof
On the Computational Complexity of Vertex Integrity and Component Order Connectivity. Algorithmica 76 (4) (2016)
Pål Grønås Drange, Markus S. Dregi, R. B. Sandeep
Compressing Bounded Degree Graphs. LATIN (2016)
Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar
Fast Biclustering by Dual Parameterization. IPEC (2015)
Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Exploring the Subexponential Complexity of Completion Problems. ACM Trans. Comput. Theory 7 (4) (2015)
Pål Grønås Drange, Michal Pilipczuk
A Polynomial Kernel for Trivially Perfect Editing. ESA (2015)
Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
On the Threshold of Intractability. ESA (2015)
Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
On the Threshold of Intractability. CoRR (2015)
Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar
Fast Biclustering by Dual Parameterization. CoRR (2015)
Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof
On the Computational Complexity of Vertex Integrity and Component Order Connectivity. ISAAC (2014)
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
Kernelization and Sparseness: the case of Dominating Set. CoRR (2014)
Pål Grønås Drange, Michal Pilipczuk
A Polynomial Kernel for Trivially Perfect Editing. CoRR (2014)
Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof
On the Computational Complexity of Vertex Integrity. CoRR (2014)
Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Exploring Subexponential Parameterized Complexity of Completion Problems. STACS (2014)
Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
A O(c^k n) 5-Approximation Algorithm for Treewidth CoRR (2013)
Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Exploring Subexponential Parameterized Complexity of Completion Problems. CoRR (2013)
Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
An O(c^k n) 5-Approximation Algorithm for Treewidth. FOCS (2013)