Pinar Heggernes

Head of Department, Professor of informatics with specialization in algorithms

Lima, Paloma T. 2019. Structural and Algorithmic Graph Theory Through the Lenses of Graph Classes.
Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza. 2019. Enumeration of Minimal Connected Dominating Sets for Chordal Graphs. Discrete Applied Mathematics.
Heggernes, Pinar; Olsen, Kai. 2019. Dette er Darwin’s «survival of the fittest». Dagens næringsliv.
Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniel. 2019. Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica. 2795-2828.

Heggernes, Pinar; Issac, Davis; Lauri, Juho; T. Lima, Paloma; van Leeuwen, Erik Jan. 2018. Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Leibniz International Proceedings in Informatics. 83:1-83:13.
Golovach, Petr; Heggernes, Pinar; Konstantinidis, Athanasios; T. Lima, Paloma; Papadopoulos, Charis. 2018. Parameterized Aspects of Strong Subgraph Closure. Leibniz International Proceedings in Informatics. 23:1-23:13.
Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve Hortemo; Villanger, Yngve. 2018. Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica. 714-741.
Golovach, Petr; Heggernes, Pinar; Thomé de Lima, Paloma; Montealegre, Pedro. 2018. Finding connected secluded subgraphs. Leibniz International Proceedings in Informatics. 1-13.
Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter. 2018. Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. European journal of combinatorics (Print). 132-147.

Brešar, Boštjan; Heggernes, Pinar; Kamiński, Marcin; Milanič, Martin; Paulusma, Daniël; Potočnik, Primož; Trotignon, Nicolas. 2017. Preface: Algorithmic Graph Theory on the Adriatic Coast. Discrete Applied Mathematics. 1-3.
Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve Hortemo; Villanger, Yngve. 2017. Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Algorithmica. 714-741.
Golovach, Petr; Heggernes, Pinar; Lindzey, Nathan; McConnell, Ross M.; dos Santos, Vínicius Fernandes; Spinrad, Jeremy P.; Szwarcfiter, Jayme Luiz. 2017. On recognition of threshold tolerance graphs and their complements. Discrete Applied Mathematics. 171-180.
Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Villanger, Yngve. 2017. Minimal dominating sets in interval graphs and trees. Discrete Applied Mathematics. 162-170.
Dibek, Cemil; Ekim, Tınaz; Heggernes, Pinar. 2017. Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discrete Mathematics. 927-934.
Seker, Oylum; Heggernes, Pinar; Ekim, Tinaz; Taskin, Z Caner. 2017. Linear-time generation of random chordal graphs. Lecture Notes in Computer Science (LNCS). 442-453.
Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma; Paulusma, Daniël. 2017. Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Lecture Notes in Computer Science (LNCS). 275-288.

Fomin, Fedor; Heggernes, Pinar; van Leeuwen, Erik Jan. 2016. The Firefighter problem on graph classes. Theoretical Computer Science. 38-50.
Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter. 2016. Enumeration and maximum number of minimal connected vertex covers in graphs. Lecture Notes in Computer Science (LNCS). 235-247.
Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou M.; Kratsch, Dieter; Villanger, Yngve. 2016. Enumerating minimal dominating sets in chordal bipartite graphs. Discrete Applied Mathematics. 30-36.
Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter. 2016. Enumerating minimal connected dominating sets in graphs of bounded chordality. Theoretical Computer Science. 63-75.

Fields of competence