Pinar Heggernes
Position
Professor, Deputy rector
Short info
Research
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.
Publications
2022
- Seker, Oylum; Heggernes, Pinar; Ekim, Tinaz et al. (2022). Generation of random chordal graphs using subtrees of a tree. (external link)
- Blair, Jean; Heggernes, Pinar; Lima, Paloma T. et al. (2022). On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. (external link)
- Tonne, Hilde; Ruud, Kenneth; Aronsen, Jan Magnus et al. (2022). Statsråden omtaler situasjonen som «alvorlig». Realiteten er at det er en oppkonstruert krise.. (external link)
2020
- Golovach, Petr; Heggernes, Pinar; Konstantinidis, Athanasios L. et al. (2020). Parameterized Aspects of Strong Subgraph Closure. (external link)
- Abu-Khzam, Faisal; Feghali, Carl; Heggernes, Pinar (2020). Partitioning a graph into degenerate subgraphs. (external link)
- Blair, Jean R S; Heggernes, Pinar; Lima, Paloma T. et al. (2020). On the maximum number of edges in chordal graphs of bounded degree and matching number. (external link)
- Golovach, Petr; Heggernes, Pinar; Lima, Paloma T. et al. (2020). Finding connected secluded subgraphs. (external link)
2019
- Lima, Paloma T.; Heggernes, Pinar (2019). Structural and Algorithmic Graph Theory Through the Lenses of Graph Classes. (external link)
- Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2019). Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. (external link)
- Heggernes, Pinar; Olsen, Kai (2019). Dette er Darwin’s «survival of the fittest». (external link)
- Heggernes, Pinar (2019). Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings. (external link)
- Rossmanith, Peter; Heggernes, Pinar; Katoen, Joost-Pieter (2019). 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. (external link)
- Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2019). Enumeration of Minimal Connected Dominating Sets for Chordal Graphs. (external link)
- Heggernes, Pinar (2019). Preface. (external link)
2018
- Heggernes, Pinar; Issac, Davis; Lauri, Juho et al. (2018). Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. (external link)
- Golovach, Petr; Heggernes, Pinar; Konstantinidis, Athanasios et al. (2018). Parameterized Aspects of Strong Subgraph Closure. (external link)
- Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter (2018). Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. (external link)
- Golovach, Petr; Heggernes, Pinar; Thomé de Lima, Paloma et al. (2018). Finding connected secluded subgraphs. (external link)
- Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha et al. (2018). Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. (external link)
Projects
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.