Home
Pinar Heggernes's picture
Photo:
Ansgar Valbø

Pinar Heggernes

Professor, Deputy rector
  • E-mailPinar.Heggernes@uib.no
  • Phone+47 55 58 41 75+47 924 82 316
  • Visitor Address
    Muséplassen 1
  • Postal Address
    Postboks 7800
    5020 Bergen

Pinar Heggernes is the deputy rector of University of Bergen. Her areas of responsibiliy are education and digital understanding, knowledge and competence. She is a professor of computer science with specialization in algorithms.

Until 2021 she was the head of Department of Informatics at UiB. She has extensive experience as a researcher and educator, as a leader of several externally funded projects and as a member of program boards and editorial committees of international scientific conferences and journals. She is active in the national research and education policy arena, as a board member of the Research Council of Norway and one of the founders of NORA – Norwegian Artificial Intelligence Research Consortium.

She is interested in collaboration between academia, businesses and public administration; she has been a member of the resource group for digitization of Bergen Chamber of Commerce and Industry, and advisory board for the Norwegian Cognitive Center. She has played a key role in coordinating various initiatives related to interdisciplinary ICT research and interdisciplinary ICT educations at UiB. Heggernes has her education from UiB and has had several long research stays abroad, including USA, France and Turkey. She has been a board member of the Faculty of mathematics and natural sciences, and a deputy member of the university board at UiB.

See all publications in a separate web page

  • Show author(s) 2020. Partitioning a graph into degenerate subgraphs. European journal of combinatorics (Print). 12 pages.
  • Show author(s) 2020. Parameterized Aspects of Strong Subgraph Closure. Algorithmica. 2006-2038.
  • Show author(s) 2020. On the maximum number of edges in chordal graphs of bounded degree and matching number. Lecture Notes in Computer Science (LNCS). 600-612.
  • Show author(s) 2020. Finding connected secluded subgraphs. Journal of computer and system sciences. 101-124.
  • Show author(s) 2019. Structural and Algorithmic Graph Theory Through the Lenses of Graph Classes.
  • Show author(s) 2019. Enumeration of Minimal Connected Dominating Sets for Chordal Graphs. Discrete Applied Mathematics. 3-11.
  • Show author(s) 2019. Dette er Darwin’s «survival of the fittest». Dagens næringsliv.
  • Show author(s) 2019. Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica. 2795-2828.
  • Show author(s) 2019. Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings. Springer.
  • Show author(s) 2019. 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. Leibniz-Zentrum für Informatik.
  • Show author(s) 2018. Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Leibniz International Proceedings in Informatics. 83:1-83:13.
  • Show author(s) 2018. Parameterized Aspects of Strong Subgraph Closure. Leibniz International Proceedings in Informatics. 23:1-23:13.
  • Show author(s) 2018. Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica. 714-741.
  • Show author(s) 2018. Finding connected secluded subgraphs. Leibniz International Proceedings in Informatics. 1-13.
  • Show author(s) 2018. Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. European journal of combinatorics (Print). 132-147.
  • Show author(s) 2017. Preface: Algorithmic Graph Theory on the Adriatic Coast. Discrete Applied Mathematics. 1-3.
  • Show author(s) 2017. Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Algorithmica. 714-741.
  • Show author(s) 2017. On recognition of threshold tolerance graphs and their complements. Discrete Applied Mathematics. 171-180.
  • Show author(s) 2017. Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discrete Mathematics. 927-934.
  • Show author(s) 2017. Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Lecture Notes in Computer Science (LNCS). 275-288.

More information in national current research information system (CRIStin)

Pinar has been the project leader of three large grants from the Research Council of Norway's FRIPRO programme:

  • CLASSIS - The renaissance of graph classes - New algorithmic theory of forbidden induced subgraphs, 2016-2020.
  • SCOPE - Exploiting Structure to Cope with Hard Problems, 2010-2015.
  • MIST - Minimal Separators and Triangulations in Graphs - Algorithms and Applications, 2005-2009.

She has led many bilateral mobility projects, and she has been a partner or PI in many other project grants from the Research Council of Norway, Trond Mohn Foundation, National Security Authority and EU.

More details can be found here.

Memberships in national boards and distinctions:

More details can be found here

Twitter