Pål Grønås Drange
Pål Grønås Drange
University of Bergen, Department of Informatics
Verified email at ii.uib.no - Homepage
Cited by
Cited by
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
On the computational complexity of vertex integrity and component order connectivity
PG Drange, M Dregi, P van’t Hof
Algorithmica 76 (4), 1181-1202, 2016
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
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
On the Threshold of Intractability
PG Drange, MS Dregi, D Lokshtanov, BD Sullivan
arXiv, 2015
A polynomial kernel for trivially perfect editing
PG Drange, M Pilipczuk
Algorithmica 80 (12), 3481-3524, 2018
A survey of parameterized algorithms and the complexity of edge modification
C Crespelle, PG Drange, FV Fomin, PA Golovach
arXiv preprint arXiv:2001.06867, 2020
Fast biclustering by dual parameterization
PG Drange, F Reidl, FS Villaamil, S Sikdar
arXiv preprint arXiv:1507.08158, 2015
Compressing bounded degree graphs
PG Drange, M Dregi, RB Sandeep
LATIN 2016: Theoretical Informatics, 362-375, 2016
Parameterized graph modification algorithms
PG Drange
The University of Bergen, 2015
On the computational complexity of vertex integrity
PG Drange, MS Dregi, P van’t Hof
CoRR, abs/1403.6331, 2014
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
Epistemic Effectivity: Neighbourhood Semantics for Coalitional Ability and Group Knowledge
PG Drange
Master’s thesis, University of Bergen, Norway, 2011
The system can't perform the operation now. Try again later.
Articles 1–13