Home
Pål Grønås Drange's picture

Pål Grønås Drange

Associate Professor
  • E-mailPal.Drange@uib.no
  • Visitor Address
    HIB - Thormøhlens gate 55
    Room 
    304N1, HIB - Thormøhlensgt. 55
  • Postal Address
    Postboks 7803
    5020 Bergen

My main research activities are within parameterized complexity of graph algorithms, especially graph modification algorithms, and (parameterized) algorithms for sparse networks.

2022-01: [N/A]

2021-02: INF234 — Algorithms

2021-01: INF237 — Algorithms Engineering

Academic article
  • Show author(s) (2021). On the threshold of intractability. Journal of computer and system sciences. 1-25.
  • Show author(s) (2017). A Polynomial Kernel for Trivially Perfect Editing. Algorithmica. 1-44.
  • Show author(s) (2016). On the computational complexity of vertex integrity and component order connectivity. Algorithmica. 1181-1202.
  • Show author(s) (2016). Kernelization and sparseness: The case of dominating set. Leibniz International Proceedings in Informatics. 14 pages.
  • Show author(s) (2016). Compressing bounded degree graphs. Lecture Notes in Computer Science (LNCS). 362-375.
  • Show author(s) (2016). A $c^k n$ 5-approximation algorithm for treewidth. SIAM journal on computing (Print). 317-378.
  • Show author(s) (2015). On the threshold of intractability. Lecture Notes in Computer Science (LNCS). 411-423.
  • Show author(s) (2015). Fast biclustering by dual parameterization. Leibniz International Proceedings in Informatics. 402-413.
  • Show author(s) (2015). Exploring the subexponential complexity of completion problems. ACM Transactions on Computation Theory.
  • Show author(s) (2015). A polynomial kernel for trivially perfect editing. Lecture Notes in Computer Science (LNCS). 424-436.
  • Show author(s) (2014). On the Computational Complexity of Vertex Integrity and Component Order Connectivity. Lecture Notes in Computer Science (LNCS). 285-297.
  • Show author(s) (2014). Exploring subexponential parameterized complexity of completion problems. Leibniz International Proceedings in Informatics. 288-299.
  • Show author(s) (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
  • Show author(s) (2012). Sådde frøene til datarevolusjonen. Bergens Tidende.
  • Show author(s) (2012). Er du venn med en robot? Morgenbladet.
Doctoral dissertation
  • Show author(s) (2015). Parameterized Graph Modification Algorithms.

More information in national current research information system (CRIStin)