default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPål Grønås Drange
Person information
- affiliation: University of Bergen, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]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: 22:1-22:18- [c13]Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan:
Correlation Clustering with Vertex Splitting. SWAT 2024: 8:1-8:17 - [i13]Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan:
Correlation Clustering with Vertex Splitting. CoRR abs/2402.10335 (2024) - [i12]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 abs/2407.00251 (2024) - 2023
- [j6]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: 100556 (2023) - [c12]Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf:
Cluster Editing with Overlapping Communities. IPEC 2023: 2:1-2:12 - [c11]Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl:
Computing Complexity Measures of Degenerate Graphs. IPEC 2023: 14:1-14:21 - [c10]Emmanuel Arrighi, Pål Grønås Drange, Kenneth Langedal, Farhad Vadiee, Martin Vatshelle, Petra Wolf:
PACE Solver Description: Zygosity. IPEC 2023: 39:1-39:3 - [i11]Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen:
Two-sets cut-uncut on planar graphs. CoRR abs/2305.01314 (2023) - [i10]Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl:
Computing complexity measures of degenerate graphs. CoRR abs/2308.08868 (2023) - 2022
- [j5]Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan:
On the threshold of intractability. J. Comput. Syst. Sci. 124: 1-25 (2022) - [c9]Pål Grønås Drange, Irene Muzi, Felix Reidl:
Harmless Sets in Sparse Classes. IWOCA 2022: 299-312 - 2021
- [i9]Pål Grønås Drange, Irene Muzi, Felix Reidl:
Kernelization and hardness of harmless sets in sparse classes. CoRR abs/2111.11834 (2021) - 2020
- [i8]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 abs/2001.06867 (2020)
2010 – 2019
- 2018
- [j4]Pål Grønås Drange, Michal Pilipczuk:
A Polynomial Kernel for Trivially Perfect Editing. Algorithmica 80(12): 3481-3524 (2018) - 2016
- [j3]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): 1181-1202 (2016) - [j2]Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk:
A ck n 5-Approximation Algorithm for Treewidth. SIAM J. Comput. 45(2): 317-378 (2016) - [c8]Pål Grønås Drange, Markus S. Dregi, R. B. Sandeep:
Compressing Bounded Degree Graphs. LATIN 2016: 362-375 - [c7]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: 31:1-31:14 - 2015
- [j1]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): 14:1-14:38 (2015) - [c6]Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan:
On the Threshold of Intractability. ESA 2015: 411-423 - [c5]Pål Grønås Drange, Michal Pilipczuk:
A Polynomial Kernel for Trivially Perfect Editing. ESA 2015: 424-436 - [c4]Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar:
Fast Biclustering by Dual Parameterization. IPEC 2015: 402-413 - [i7]Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan:
On the Threshold of Intractability. CoRR abs/1505.00612 (2015) - [i6]Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar:
Fast Biclustering by Dual Parameterization. CoRR abs/1507.08158 (2015) - 2014
- [c3]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: 285-297 - [c2]Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Exploring Subexponential Parameterized Complexity of Completion Problems. STACS 2014: 288-299 - [i5]Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof:
On the Computational Complexity of Vertex Integrity. CoRR abs/1403.6331 (2014) - [i4]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 abs/1411.4575 (2014) - [i3]Pål Grønås Drange, Michal Pilipczuk:
A Polynomial Kernel for Trivially Perfect Editing. CoRR abs/1412.7558 (2014) - 2013
- [c1]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: 499-508 - [i2]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 abs/1304.6321 (2013) - [i1]Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Exploring Subexponential Parameterized Complexity of Completion Problems. CoRR abs/1309.4022 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-11 00:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
