- E-mailPal.Drange@uib.no
- Visitor AddressHIB - Thormøhlens gate 55Room304N1, HIB - Thormøhlensgt. 55
- Postal AddressPostboks 78035020 Bergen
Academic article
- 2017. A Polynomial Kernel for Trivially Perfect Editing. Algorithmica. 1-44.
- 2016. On the computational complexity of vertex integrity and component order connectivity. Algorithmica. 1181-1202.
- 2016. Kernelization and sparseness: The case of dominating set. Leibniz International Proceedings in Informatics. 14 pages.
- 2016. Compressing bounded degree graphs. Lecture Notes in Computer Science (LNCS). 362-375.
- 2016. A $c^k n$ 5-approximation algorithm for treewidth. SIAM journal on computing (Print). 317-378.
- 2015. On the threshold of intractability. Lecture Notes in Computer Science (LNCS). 411-423.
- 2015. Fast biclustering by dual parameterization. Leibniz International Proceedings in Informatics. 402-413.
- 2015. Exploring the subexponential complexity of completion problems. ACM Transactions on Computation Theory.
- 2015. A polynomial kernel for trivially perfect editing. Lecture Notes in Computer Science (LNCS). 424-436.
- 2014. On the Computational Complexity of Vertex Integrity and Component Order Connectivity. Lecture Notes in Computer Science (LNCS). 285-297.
- 2014. Exploring subexponential parameterized complexity of completion problems. Leibniz International Proceedings in Informatics. 288-299.
- 2013. An O(c^k n) 5-approximation algorithm for treewidth. Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS). 499-508.
Feature article
- 2012. Sådde frøene til datarevolusjonen. Bergens Tidende.
- 2012. Er du venn med en robot? Morgenbladet.
Doctoral dissertation
- 2015. Parameterized Graph Modification Algorithms.
More information in national current research information system (CRIStin)