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
    5006 Bergen
    Room 
    304N1, HIB - Thormøhlensgt. 55
  • Postal Address
    Postboks 7803
    5020 Bergen

My primary research focuses on the parameterized complexity of graph algorithms, with a special emphasis on graph modification algorithms and algorithms tailored for sparse networks.

I also do experimental algorithmics including algorithm engineering, machine learning, and recommender algorithms.

My current research projects are:

  1. Correlation clustering with overlapping data, to enhance clustering accuracy in datasets where entities belong to multiple categories simultaneously
  2. Autonomous drone inspection algorithms, focusing on optimizing path planning and real-time data processing techniques to improve the efficiency and accuracy of drone-based inspections in complex environments
  3. Network interdiction algorithms, which involves strategically disrupting or blocking flows through a network, such as transportation or communication channels, using limited resources to minimize unwanted activities like drug trafficking.

I am affiliated with CEDAS: Center for Data Science at UiB. I serve as a principle investigator in the research project Algorithmic Foundations for Trustworthy AI, funded by the Trond Mohn Foundation.  Additionally, I am engaged in the Machine Teaching for Explainable AI research project, which is supported by the Norwegian Research Council. I have also received funding from the NRC project Parameterized Complexity for Practical Computing (PCPC), led by Professor Mike R. Fellows.

Since 2021, I have taken on the role of editor of IT and Algoritmer in Store Norske Leksikon.

Program committee work:

 

With over five years in the high-tech sector, I have gained proficiency in Python, C, C++, C#, and Java, and have in-depth experience with databases such as Postgres and MySQL/MariaDB. I had the honor of serving as the lead software engineering advisor for Equinor and played a key role in the FriskBy project, a crowdsourced initiative focused on air quality monitoring. My dedication to the open-source community is reflected in my numerous contributions and original projects, all of which can be explored on my GitHub profile: github.com/pgdr.

In addition to my teaching role at UiB, I have conducted numerous courses within the industry, covering topics such as machine learning, Python, software craftsmanship and development, Linux, Git, and competitive programming, among others.

 

Selected presentations

  • UiT — Norges arktiske universitet: ITAs 50-årsjubileum
  • Introductory presentation on AI and digitalization at Arbeiderpartiet and the Minister of Digitalisation and Public Governance, 2024
  • Invited lecture on opportunities and drawbacks in AI – UiB IT forum, 2024
  • Opening lecture on opportunities in AI — IT-forum vest, Vestland & Rogaland, 2024
  • Seniortreff i fem bygder, Tysnes Kommune, 2024
  • Innledning til paneldebatt om KI — LO Vestland regionkonferanse, 2024
  • Hvordan påvirker KI vår hverdag — Pensjonistforeningen ved UiB, 2024
  • KI for toppledere i Vestland — Apriil seminar, 2023
  • Hvordan påvirker KI vår hverdag — Senioruniversitetet i Hordaland, 2023
  • KI og falsk framferd — Falturiltu (verdas største nynorske litteraturfestival for barn og ungdom), 2023
  • Står superintelligensen og banker på døren? — Intelligente Bergen, November 2023
  • Hva er AI? — Bergen Kommune, Fagdag for IT, May 2023
  • Revisionist Software Craftsmanship — Webstep Fagkveld, 2022
  • Hva er maskinlæring — Seniorklubb, 2021
  • Open source — Booster, 2019

Interviewed by

  • TV 2 Nyhetsmorgen
  • NRK Nyhetsmorgen
  • Klassekampen
  • VG
  • NTB Tema
  • Digi

Recent courses:

  • 2024-01: INF237 — Algorithms engineering
  • 2024-01: SDG607 — Energy transition
  • 2023-02: INF234 — Algorithms
  • 2023 january: Git Crash Course for Echo
  • 2022-02: INF234 — Algorithms & INF319 — Projects in Informatics
  • 2022-01: INF237 — Algorithms Engineering
  • 2022 january: Git Crash Course for Echo
  • 2021-02: INF234 — Algorithms & INF219/INF319 — Projects in Informatics
  • 2021-01: INF237 — Algorithms Engineering
  • 2021 january: Git Crash Course for Echo

 

     

    Previous teaching way back when:

    • INFO282 — Artificial Intelligence
    • INF207 — Social Network Theory
    • INF109 — Python for natural science
    • INF112 — Software Engineering
    • DASP106 — Computational linguistics

    Teaching and courses in the industry:

    • Python crash course
    • Advanced Python for engineers
    • Git crash course
    • Machine learning, an introduction

    My first course, that I ever taught:

    • 2008–02: Computational linguistics (datalingvistikk, da: DASP106)

    2024:

    • Correlation Clustering with Vertex Splitting, SWAT 2024 (to appear.)
    • Two-sets cut-uncut on planar graphs, ICALP 2024 (to appear).

    2023:

    • Zygosity, a twin-width solver.  PACE challenge, silver medal heuristics.
    • Computing complexity measures of degenerate graphs.  International Symposium on Parameterized and Exact Computation.
    • Cluster Editing with Overlapping Communities. International Symposium on Parameterized and Exact Computation.
    • A survey of parameterized algorithms and the complexity of edge modification. Computer Science Review. 100556-100556.
    • On the threshold of intractability. Journal of Computer and System Sciences.
    Academic article
    • Show author(s) (2024). Correlation Clustering with Vertex Splitting. arXiv.org. 1-20.
    • Show author(s) (2023). Two-sets cut-uncut on planar graphs. arXiv.org.
    • Show author(s) (2023). Computing complexity measures of degenerate graphs. arXiv.
    • Show author(s) (2023). Computing Complexity Measures of Degenerate Graphs. Leibniz International Proceedings in Informatics. 14:1-14:21.
    • Show author(s) (2023). Cluster Editing with Overlapping Communities. Leibniz International Proceedings in Informatics. 2:1-2:12.
    • Show author(s) (2022). Harmless Sets in Sparse Classes. Lecture Notes in Computer Science (LNCS). 299-312.
    • 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.
    Popular scientific article
    • Show author(s) (2023). blokkprogrammering. Store Norske Leksikon (Nettutgaven).
    • Show author(s) (2022). sorteringsalgoritme. Store Norske Leksikon (Nettutgaven).
    • Show author(s) (2022). binærsøk. Store Norske Leksikon (Nettutgaven).
    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.
    Academic literature review
    • Show author(s) (2023). A survey of parameterized algorithms and the complexity of edge modification. Computer Science Review. 31 pages.
    Article in business/trade/industry journal
    • Show author(s) (2023). PACE Solver Description: Zygosity. Leibniz International Proceedings in Informatics. 39:1-39:3.
    • Show author(s) (2023). Cluster Editing with Vertex Splitting. arXiv.org.

    More information in national current research information system (CRIStin)

    My master students:

    • Maya
    • Thorgal
    • Vilde
    • Steinar
    • Erlend

    Alumnied master students:

    • Tuva — A faster algorithm for computing c-closure (2023)
    • Marie — An algorithm for k-insertion into a binary heap (2023)
    • Karina — Comparing maximum flow algorithms (2023)
    • Sandra — The structure of complex networks (2023)
    • Gard — Overlapping community detection (2022)