Pål Grønås Drange

43 papers A* 3A 4B 10C 1Journal 24Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
Discounted Cuts: A Stackelberg Approach to Network Disruption.
AAAI
Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Danil Sagunov
2026 B conf
Efficient Trace Frequency Queries in Sparse Graphs.
SOFSEM
Christine Awofeso, Pål Grønås Drange, Patrick Greaves, Oded Lachish, Felix Reidl
2026 B conf
Overlapping Biclustering.
SOFSEM
Matthias Bentert, Pål Grønås Drange, Erlend Haugen
2025 J jnl
Discounted Cuts: A Stackelberg Approach to Network Disruption.
CoRR
Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Danil Sagunov
2025 J jnl
Efficient Trace Frequency Queries in Sparse Graphs.
CoRR
Christine Awofeso, Pål Grønås Drange, Patrick Greaves, Oded Lachish, Felix Reidl
2025 J jnl
Overlapping Biclustering.
CoRR
Matthias Bentert, Pål Grønås Drange, Erlend Haugen
2025 B conf
Planar Network Diversion.
SEA
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Steinar Simonnes
2025 J jnl
Planar Network Diversion.
CoRR
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Steinar Simonnes
2025 J jnl
Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination.
CoRR
Matthias Bentert, Alex Crane, Pål Grønås Drange, Yosuke Mizutani, Blair D. Sullivan
2024 — conf
Correlation Clustering with Vertex Splitting.
SWAT
Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
2024 J jnl
Correlation Clustering with Vertex Splitting.
CoRR
Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
2024 J jnl
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning.
CoRR
Yosuke Mizutani, Daniel Coimbra Salomao, Alex Crane, Matthias Bentert, Pål Grønås Drange, Felix Reidl, Alan Kuntz, Blair D. Sullivan
2024 B conf
PACE Solver Description: LUNCH - Linear Uncrossing Heuristics.
IPEC
Kenneth Langedal, Matthias Bentert, Thorgal Blanco, Pål Grønås Drange
2024 A* conf
Two-Sets Cut-Uncut on Planar Graphs.
ICALP
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
2023 J jnl
A survey of parameterized algorithms and the complexity of edge modification.
Comput. Sci. Rev.
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
2023 B conf
Cluster Editing with Overlapping Communities.
IPEC
Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf
2023 B conf
Computing Complexity Measures of Degenerate Graphs.
IPEC
Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl
2023 J jnl
Computing complexity measures of degenerate graphs.
CoRR
Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl
2023 B conf
PACE Solver Description: Zygosity.
IPEC
Emmanuel Arrighi, Pål Grønås Drange, Kenneth Langedal, Farhad Vadiee, Martin Vatshelle, Petra Wolf
2023 J jnl
Two-sets cut-uncut on planar graphs.
CoRR
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
2022 C conf
Harmless Sets in Sparse Classes.
IWOCA
Pål Grønås Drange, Irene Muzi, Felix Reidl
2022 J jnl
On the threshold of intractability.
J. Comput. Syst. Sci.
Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan
2021 J jnl
Kernelization and hardness of harmless sets in sparse classes.
CoRR
Pål Grønås Drange, Irene Muzi, Felix Reidl
2020 J jnl
A survey of parameterized algorithms and the complexity of edge modification.
CoRR
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
2018 J jnl
A Polynomial Kernel for Trivially Perfect Editing.
Algorithmica
Pål Grønås Drange, Michal Pilipczuk
2016 J jnl
A c
SIAM J. Comput.
Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2016 B conf
Compressing Bounded Degree Graphs.
LATIN
Pål Grønås Drange, Markus S. Dregi, R. B. Sandeep
2016 A conf
Kernelization and Sparseness: the Case of Dominating Set.
STACS
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
2016 J jnl
On the Computational Complexity of Vertex Integrity and Component Order Connectivity.
Algorithmica
Pål Grønås Drange, Markus S. Dregi, Pim van 't Hof
2015 A conf
A Polynomial Kernel for Trivially Perfect Editing.
ESA
Pål Grønås Drange, Michal Pilipczuk
2015 J jnl
Exploring the Subexponential Complexity of Completion Problems.
ACM Trans. Comput. Theory
Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2015 B conf
Fast Biclustering by Dual Parameterization.
IPEC
Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar
2015 J jnl
Fast Biclustering by Dual Parameterization.
CoRR
Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar
2015 A conf
On the Threshold of Intractability.
ESA
Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
2015 J jnl
On the Threshold of Intractability.
CoRR
Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
2014 J jnl
A Polynomial Kernel for Trivially Perfect Editing.
CoRR
Pål Grønås Drange, Michal Pilipczuk
2014 A conf
Exploring Subexponential Parameterized Complexity of Completion Problems.
STACS
Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2014 J jnl
Kernelization and Sparseness: the case of Dominating Set.
CoRR
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
2014 B conf
On the Computational Complexity of Vertex Integrity and Component Order Connectivity.
ISAAC
Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof
2014 J jnl
On the Computational Complexity of Vertex Integrity.
CoRR
Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof
2013 J jnl
A O(c^k n) 5-Approximation Algorithm for Treewidth
CoRR
Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2013 A* conf
An O(c^k n) 5-Approximation Algorithm for Treewidth.
FOCS
Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2013 J jnl
Exploring Subexponential Parameterized Complexity of Completion Problems.
CoRR
Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger