A HL Bodlaender, PG Drange, MS Dregi, FV Fomin, D Lokshtanov, ...
SIAM Journal on Computing 45 (2), 317-378, 2016
388 2016 On the computational complexity of vertex integrity and component order connectivity PG Drange, M Dregi, P van’t Hof
Algorithmica 76, 1181-1202, 2016
91 2016 Kernelization and sparseness: the case of dominating set PG Drange, MS Dregi, FV Fomin, S Kreutzer, D Lokshtanov, M Pilipczuk, ...
arXiv preprint arXiv:1411.4575, 2014
72 2014 A survey of parameterized algorithms and the complexity of edge modification C Crespelle, PG Drange, FV Fomin, P Golovach
Computer Science Review 48, 100556, 2023
68 2023 Exploring the subexponential complexity of completion problems PG Drange, FV Fomin, M Pilipczuk, Y Villanger
ACM Transactions on Computation Theory (TOCT) 7 (4), 1-38, 2015
60 * 2015 A polynomial kernel for trivially perfect editing PG Drange, M Pilipczuk
Algorithmica 80, 3481-3524, 2018
54 2018 On the Threshold of Intractability PG Drange, MS Dregi, D Lokshtanov, BD Sullivan
arXiv, 2015
48 2015 Fast biclustering by dual parameterization PG Drange, F Reidl, FS Villaamil, S Sikdar
arXiv preprint arXiv:1507.08158, 2015
16 2015 Cluster editing with overlapping communities E Arrighi, M Bentert, PG Drange, BD Sullivan, P Wolf
18th International Symposium on Parameterized and Exact Computation (IPEC …, 2023
14 2023 Parameterized graph modification algorithms PG Drange
The University of Bergen, 2015
12 2015 A survey of parameterized algorithms and the complexity of edge modification (2020) C Crespelle, PG Drange, FV Fomin, PA Golovach
arXiv preprint arXiv:2001.06867, 2001
10 2001 Compressing bounded degree graphs PG Drange, M Dregi, RB Sandeep
LATIN 2016: Theoretical Informatics, 362-375, 2016
8 2016 A survey of parameterized algorithms and the complexity of edge modification. CoRR, abs/2001.06867 C Crespelle, PG Drange, FV Fomin, PA Golovach
arXiv preprint arXiv:2001.06867, 2020
7 2020 On the threshold of intractability PG Drange, MF Dregi, D Lokshtanov, BD Sullivan
Journal of Computer and System Sciences 124, 1-25, 2022
5 2022 Kernelization and hardness of harmless sets in sparse classes PG Drange, I Muzi, F Reidl
CoRR, abs/2111.11834, 2021
4 2021 On the computational complexity of vertex integrity PG Drange, MS Dregi, P van’t Hof
CoRR, abs/1403.6331, 2014
4 2014 Two-sets cut-uncut on planar graphs M Bentert, PG Drange, FV Fomin, PA Golovach, T Korhonen
arXiv preprint arXiv:2305.01314, 2023
2 2023 A HL Bodlaender, PG Drange, MS Dregi, F Fomin, D Lokshtanov, ...
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer …, 0
2 Leveraging Fixed-Parameter Tractability for Robot Inspection Planning Y Mizutani, DC Salomao, A Crane, M Bentert, PG Drange, F Reidl, ...
arXiv preprint arXiv:2407.00251, 2024
1 2024 Correlation clustering with vertex splitting M Bentert, A Crane, PG Drange, F Reidl, BD Sullivan
arXiv preprint arXiv:2402.10335, 2024
1 2024 
Fedor V. FominProfessor of Computer Science, University of BergenVerifisert e-postadresse på uib.no
