| A 5-Approximation Algorithm for Treewidth HL Bodlaender, PG Drange, MS Dregi, FV Fomin, D Lokshtanov, ... SIAM Journal on Computing 45 (2), 317-378, 2016 | 366 | 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 | 84 | 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 | 63 | 2014 |
| 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 | 57* | 2015 |
| A polynomial kernel for trivially perfect editing PG Drange, M Pilipczuk Algorithmica 80, 3481-3524, 2018 | 50 | 2018 |
| 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 | 48 | 2023 |
| On the Threshold of Intractability PG Drange, MS Dregi, D Lokshtanov, BD Sullivan arXiv, 2015 | 47 | 2015 |
| Fast biclustering by dual parameterization PG Drange, F Reidl, FS Villaamil, S Sikdar arXiv preprint arXiv:1507.08158, 2015 | 15 | 2015 |
| Parameterized graph modification algorithms PG Drange The University of Bergen, 2015 | 11 | 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 |
| 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), 2023 | 5 | 2023 |
| On the threshold of intractability PG Drange, MF Dregi, D Lokshtanov, BD Sullivan Journal of Computer and System Sciences 124, 1-25, 2022 | 4 | 2022 |
| On the computational complexity of vertex integrity PG Drange, MS Dregi, P van’t Hof CoRR, abs/1403.6331, 2014 | 4 | 2014 |
| Kernelization and hardness of harmless sets in sparse classes PG Drange, I Muzi, F Reidl CoRR, abs/2111.11834, 2021 | 2 | 2021 |
| A O (ckn) 5-approximation algorithm for treewidth HL Bodlaender, PG Drange, MS Dregi, F Fomin, D Lokshtanov, ... Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer …, 0 | 2 | |
| Harmless sets in sparse classes PG Drange, I Muzi, F Reidl International Workshop on Combinatorial Algorithms, 299-312, 2022 | 1 | 2022 |
| Epistemic Effectivity: Neighbourhood Semantics for Coalitional Ability and Group Knowledge PG Drange Master’s thesis, University of Bergen, Norway, 2011 | 1 | 2011 |
| Correlation clustering with vertex splitting M Bentert, A Crane, PG Drange, F Reidl, BD Sullivan arXiv preprint arXiv:2402.10335, 2024 | | 2024 |
Fedor V. FominProfessor of Computer Science, University of Bergen在 uib.no 的电子邮件经过验证
