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 former 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.

2025

• Leonora Onarheim Bergsjø; Ann-Chatrin Linqvist Leonardsen; Pinar Heggernes et al. (2025). Kunstig eller intelligent? Høyere utdanning i identitetskrise. (external link)
• Cristina Bazgan; Pinar Heggernes; André Nichterlein et al. (2025). On the hardness of problems around s-clubs on split graphs. (external link)

1999

• Åke Björck; Pinar Heggernes; Pontus Matstoms (1999). Methods for large scale total least square problems. (external link)

2008

• Pinar Heggernes; Rodica Georgeta Mihai (2008). Mixed search number of permutation graphs. (external link)
• Pinar Heggernes; Dieter Kratsch; Daniel Meister (2008). Bandwidth of Bipartite Permutation Graphs in Polynomial Time. (external link)
• Pinar Heggernes; Daniel Meister; Charis Papadopoulos (2008). Graphs of Linear Clique-Width at Most 3. (external link)
• Pinar Heggernes; Daniel Meister; Andrzej Proskurowski (2008). Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. (external link)
• Hans L. Bodlaender; Pinar Heggernes; Yngve Villanger (2008). Faster Parameterized Algorithms for Minimum Fill-In. (external link)

2020

• Faisal Abu-Khzam; Carl Feghali; Pinar Heggernes (2020). Partitioning a graph into degenerate subgraphs. (external link)

2006

• Federico Mancini; Pinar Heggernes (2006). A completely dynamic algorithm for split graphs. (external link)
• Johanne Cohen; Fedor Fomin; Pinar Heggernes et al. (2006). Optimal linear arrangement of interval graphs. (external link)

2016

• Marek Cygan; Pinar Heggernes (2016). Erratum to: Foreword: Special Issue on IPEC 2014 (Algorithmica, DOI 10.1007/s00453-016-0151-x). (external link)

2015

• Henning Fernau; Pinar Heggernes; Pim van 't Hof et al. (2015). Computing the metric dimension for chain graphs. (external link)

2014

• Pinar Heggernes; Pim van 't Hof; Erik Jan van Leeuwen et al. (2014). Finding disjoint paths in split graphs. (external link)

2003

• Anne Berry; Pinar Heggernes; Genevieve Simonet (2003). The minimum degree heuristic and the minimal triangulation process. (external link)
• Anne Berry; Pinar Heggernes; Yngve Villanger (2003). A vertex incremental approach for dynamically maintaining chordal graphs. (external link)
• Fedor Fomin; Pinar Heggernes; Jan Arne Telle (2003). Graph searching, elimination trees, and a generalization of bandwidth. (external link)

2013

• Jean-François Couturier; Pinar Heggernes; Pim van 't Hof et al. (2013). Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. (external link)

2010

• Pinar Heggernes; Jan Kratochvil; Andrzej Proskurowski (2010). Guest editors' foreword. (external link)

2022

• Jean Blair; Pinar Heggernes; Paloma T. Lima et al. (2022). On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. (external link)

See a complete overview of publications in NVA.

See all publications in a separate web page

Pinar has been the project leader of four 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.
• Parallel and sequential methods for large scale matrix computations, 1999-2000.

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.