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.

2019

• Pinar Heggernes (2019). Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings. (external link)
• Pinar Heggernes; Kai Olsen (2019). Dette er Darwin’s «survival of the fittest». (external link)

2001

• Jean Blair; Pinar Heggernes; Jan Arne Telle (2001). A Practical Algorithm for Making Filled Graphs Minimal. (external link)

2013

• Endre Boros; Pinar Heggernes; Pim van 't Hof et al. (2013). Vector connectivity in graphs. (external link)
• Tinaz Ekim; Pinar Heggernes; Daniel Meister (2013). Polar permutation graphs are polynomial-time recognisable. (external link)

2015

• Hans Bodlaender; Pinar Heggernes; Jan Arne Telle (2015). Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. (external link)

2009

• Pinar Heggernes; Charis Papadopoulos (2009). Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. (external link)
• Pinar Heggernes; Dieter Kratsch; Daniel Meister (2009). Bandwidth of bipartite permutation graphs in polynomial time. (external link)
• Yngve Villanger; Pinar Heggernes; Christophe Paul et al. (2009). Interval completion is fixed parameter tractable. (external link)

2008

• Pinar Heggernes; Barry W Peyton (2008). Fast computation of minimal fill inside a given elimination ordering. (external link)
• Anne Berry; Elias Dahlhaus; Pinar Heggernes et al. (2008). Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. (external link)

2011

• Pinar Heggernes; Pim van 't Hof; Daniel Lokshtanov et al. (2011). Obtaining a bipartite graph by contracting few edges. (external link)
• Pinar Heggernes; Federico Mancini; Charis Papadopoulos et al. (2011). Strongly chordal and chordal bipartite graphs are sandwich monotone. (external link)

2004

• Jean R S Blair; Pinar Heggernes; Steve Horton et al. (2004). Broadcast Domination Algorithms for Interval Graphs, Series-Parallel Graphs, and Trees. (external link)
• Anne Berry; Jean R S Blair; Pinar Heggernes et al. (2004). Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. (external link)

2012

• Tinaz Ekim; Aysel Erey; Pinar Heggernes et al. (2012). Computing Minimum Geodetic Sets of Proper Interval Graphs. (external link)
• Pinar Heggernes; Jan Kratochvil; Andrzej Proskurowski (2012). Guest editors' foreword. (external link)
• Fedor Fomin; Pinar Heggernes; Erik Jan van Leeuwen (2012). Making Life Easier for Firefighters. (external link)

1996

• Pinar Heggernes (1996). Partitioning and ordering graphs for sparse matrix computations. (external link)

2018

• Petr Golovach; Pinar Heggernes; Mamadou Moustapha Kanté et al. (2018). Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. (external link)

See a complete overview of publications in Cristin.

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.